./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.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 4fdd5c1041cb450f4848a5d2243efab154355b9039f1e674dfe24010b27b76eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:25:04,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:25:04,838 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:25:04,842 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:25:04,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:25:04,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:25:04,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:25:04,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:25:04,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:25:04,865 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:25:04,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:25:04,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:25:04,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:25:04,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:25:04,867 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:25:04,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:25:04,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:25:04,867 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:25:04,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:25:04,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:25:04,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:25:04,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:25:04,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:25:04,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:25:04,868 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:25:04,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:25:04,868 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:25:04,868 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:25:04,868 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:25:04,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:25:04,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:25:04,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:25:04,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:25:04,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:25:04,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:25:04,869 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:25:04,869 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:25:04,869 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:25:04,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:25:04,869 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:25:04,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:25:04,870 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:25:04,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:25:04,870 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 -> 4fdd5c1041cb450f4848a5d2243efab154355b9039f1e674dfe24010b27b76eb [2025-03-16 20:25:05,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:25:05,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:25:05,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:25:05,085 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:25:05,086 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:25:05,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c [2025-03-16 20:25:06,210 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df9e0bef1/5dd6132d7c43400f847ef784166a52a7/FLAG75ce0e209 [2025-03-16 20:25:06,651 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:25:06,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c [2025-03-16 20:25:06,679 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df9e0bef1/5dd6132d7c43400f847ef784166a52a7/FLAG75ce0e209 [2025-03-16 20:25:06,694 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df9e0bef1/5dd6132d7c43400f847ef784166a52a7 [2025-03-16 20:25:06,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:25:06,698 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:25:06,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:25:06,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:25:06,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:25:06,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:25:06" (1/1) ... [2025-03-16 20:25:06,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b328b29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:06, skipping insertion in model container [2025-03-16 20:25:06,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:25:06" (1/1) ... [2025-03-16 20:25:06,774 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:25:07,066 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c[8712,8725] [2025-03-16 20:25:07,095 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c[9554,9567] [2025-03-16 20:25:07,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:25:07,558 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:25:07,584 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c[8712,8725] [2025-03-16 20:25:07,586 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c[9554,9567] [2025-03-16 20:25:07,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:25:07,855 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:25:07,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:07 WrapperNode [2025-03-16 20:25:07,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:25:07,857 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:25:07,857 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:25:07,857 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:25:07,862 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:25:07" (1/1) ... [2025-03-16 20:25:07,904 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:25:07" (1/1) ... [2025-03-16 20:25:08,172 INFO L138 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5033 [2025-03-16 20:25:08,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:25:08,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:25:08,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:25:08,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:25:08,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:07" (1/1) ... [2025-03-16 20:25:08,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:07" (1/1) ... [2025-03-16 20:25:08,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:07" (1/1) ... [2025-03-16 20:25:08,402 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:25:08,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:07" (1/1) ... [2025-03-16 20:25:08,402 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:07" (1/1) ... [2025-03-16 20:25:08,518 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:07" (1/1) ... [2025-03-16 20:25:08,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:07" (1/1) ... [2025-03-16 20:25:08,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:07" (1/1) ... [2025-03-16 20:25:08,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:07" (1/1) ... [2025-03-16 20:25:08,613 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:25:08,615 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:25:08,615 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:25:08,615 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:25:08,616 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:07" (1/1) ... [2025-03-16 20:25:08,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:25:08,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:25:08,641 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:25:08,644 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:25:08,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:25:08,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:25:08,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:25:08,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:25:08,733 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:25:08,735 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:25:12,026 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5025: havoc calculate_output3_#t~ret35#1; [2025-03-16 20:25:12,026 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2056: havoc calculate_output_#t~ret33#1; [2025-03-16 20:25:12,027 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3535: havoc calculate_output2_#t~ret34#1; [2025-03-16 20:25:12,159 INFO L? ?]: Removed 735 outVars from TransFormulas that were not future-live. [2025-03-16 20:25:12,159 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:25:12,187 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:25:12,187 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:25:12,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:25:12 BoogieIcfgContainer [2025-03-16 20:25:12,188 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:25:12,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:25:12,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:25:12,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:25:12,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:25:06" (1/3) ... [2025-03-16 20:25:12,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6861f807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:25:12, skipping insertion in model container [2025-03-16 20:25:12,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:25:07" (2/3) ... [2025-03-16 20:25:12,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6861f807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:25:12, skipping insertion in model container [2025-03-16 20:25:12,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:25:12" (3/3) ... [2025-03-16 20:25:12,195 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c [2025-03-16 20:25:12,205 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:25:12,208 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c that has 1 procedures, 822 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:25:12,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:25:12,283 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;@47b6005e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:25:12,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:25:12,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 822 states, 819 states have (on average 1.9743589743589745) internal successors, (1617), 821 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states 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:25:12,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-16 20:25:12,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:12,293 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-16 20:25:12,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:12,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:12,298 INFO L85 PathProgramCache]: Analyzing trace with hash 741460894, now seen corresponding path program 1 times [2025-03-16 20:25:12,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:12,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834575811] [2025-03-16 20:25:12,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:12,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:12,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-16 20:25:12,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-16 20:25:12,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:12,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:12,470 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:25:12,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:12,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834575811] [2025-03-16 20:25:12,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834575811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:12,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:12,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:25:12,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352527624] [2025-03-16 20:25:12,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:12,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:12,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:12,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:12,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:12,494 INFO L87 Difference]: Start difference. First operand has 822 states, 819 states have (on average 1.9743589743589745) internal successors, (1617), 821 states have internal predecessors, (1617), 0 states have call successors, (0), 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 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states 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:25:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:15,322 INFO L93 Difference]: Finished difference Result 2372 states and 4683 transitions. [2025-03-16 20:25:15,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:15,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-03-16 20:25:15,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:15,344 INFO L225 Difference]: With dead ends: 2372 [2025-03-16 20:25:15,345 INFO L226 Difference]: Without dead ends: 1569 [2025-03-16 20:25:15,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:25:15,353 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 922 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:15,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 194 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 20:25:15,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2025-03-16 20:25:15,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2025-03-16 20:25:15,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1567 states have (on average 1.8653477983407785) internal successors, (2923), 1568 states have internal predecessors, (2923), 0 states have call successors, (0), 0 states 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:25:15,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2923 transitions. [2025-03-16 20:25:15,450 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2923 transitions. Word has length 6 [2025-03-16 20:25:15,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:15,450 INFO L471 AbstractCegarLoop]: Abstraction has 1569 states and 2923 transitions. [2025-03-16 20:25:15,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states 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:25:15,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2923 transitions. [2025-03-16 20:25:15,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 20:25:15,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:15,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:15,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:25:15,452 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:15,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:15,453 INFO L85 PathProgramCache]: Analyzing trace with hash -2146949576, now seen corresponding path program 1 times [2025-03-16 20:25:15,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:15,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882594993] [2025-03-16 20:25:15,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:15,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:15,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 20:25:15,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 20:25:15,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:15,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:15,639 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:25:15,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:15,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882594993] [2025-03-16 20:25:15,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882594993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:15,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:15,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:25:15,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73052379] [2025-03-16 20:25:15,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:15,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:25:15,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:15,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:25:15,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:25:15,642 INFO L87 Difference]: Start difference. First operand 1569 states and 2923 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:15,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:15,686 INFO L93 Difference]: Finished difference Result 1609 states and 2985 transitions. [2025-03-16 20:25:15,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:25:15,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-16 20:25:15,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:15,692 INFO L225 Difference]: With dead ends: 1609 [2025-03-16 20:25:15,692 INFO L226 Difference]: Without dead ends: 1569 [2025-03-16 20:25:15,692 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:25:15,693 INFO L435 NwaCegarLoop]: 1547 mSDtfsCounter, 0 mSDsluCounter, 3067 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4614 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:15,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4614 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:15,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2025-03-16 20:25:15,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2025-03-16 20:25:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1567 states have (on average 1.8506700701978303) internal successors, (2900), 1568 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states 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:25:15,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2900 transitions. [2025-03-16 20:25:15,724 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2900 transitions. Word has length 19 [2025-03-16 20:25:15,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:15,724 INFO L471 AbstractCegarLoop]: Abstraction has 1569 states and 2900 transitions. [2025-03-16 20:25:15,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:15,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2900 transitions. [2025-03-16 20:25:15,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 20:25:15,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:15,726 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:15,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:25:15,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:15,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:15,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1633251230, now seen corresponding path program 1 times [2025-03-16 20:25:15,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:15,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432097090] [2025-03-16 20:25:15,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:15,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:15,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 20:25:15,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 20:25:15,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:15,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:15,856 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:25:15,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:15,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432097090] [2025-03-16 20:25:15,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432097090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:15,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:15,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:15,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143891297] [2025-03-16 20:25:15,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:15,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:15,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:15,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:15,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:15,860 INFO L87 Difference]: Start difference. First operand 1569 states and 2900 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:15,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:15,975 INFO L93 Difference]: Finished difference Result 1865 states and 3372 transitions. [2025-03-16 20:25:15,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:25:15,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-16 20:25:15,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:15,985 INFO L225 Difference]: With dead ends: 1865 [2025-03-16 20:25:15,986 INFO L226 Difference]: Without dead ends: 1828 [2025-03-16 20:25:15,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 20:25:15,988 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 6359 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6359 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:15,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6359 Valid, 1993 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:25:15,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2025-03-16 20:25:16,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1604. [2025-03-16 20:25:16,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1602 states have (on average 1.8451935081148565) internal successors, (2956), 1603 states have internal predecessors, (2956), 0 states have call successors, (0), 0 states 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:25:16,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2956 transitions. [2025-03-16 20:25:16,017 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2956 transitions. Word has length 41 [2025-03-16 20:25:16,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:16,018 INFO L471 AbstractCegarLoop]: Abstraction has 1604 states and 2956 transitions. [2025-03-16 20:25:16,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:16,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2956 transitions. [2025-03-16 20:25:16,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 20:25:16,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:16,020 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:16,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:25:16,020 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:16,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:16,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1854186780, now seen corresponding path program 1 times [2025-03-16 20:25:16,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:16,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961772021] [2025-03-16 20:25:16,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:16,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:16,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 20:25:16,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 20:25:16,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:16,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:16,257 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:25:16,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:16,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961772021] [2025-03-16 20:25:16,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961772021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:16,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:16,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:16,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13095475] [2025-03-16 20:25:16,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:16,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:16,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:16,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:16,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:16,260 INFO L87 Difference]: Start difference. First operand 1604 states and 2956 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:16,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:16,354 INFO L93 Difference]: Finished difference Result 1678 states and 3072 transitions. [2025-03-16 20:25:16,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:25:16,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-16 20:25:16,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:16,360 INFO L225 Difference]: With dead ends: 1678 [2025-03-16 20:25:16,360 INFO L226 Difference]: Without dead ends: 1606 [2025-03-16 20:25:16,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:25:16,363 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 1491 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:16,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 1741 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:16,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-03-16 20:25:16,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1604. [2025-03-16 20:25:16,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1602 states have (on average 1.844569288389513) internal successors, (2955), 1603 states have internal predecessors, (2955), 0 states have call successors, (0), 0 states 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:25:16,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2955 transitions. [2025-03-16 20:25:16,391 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2955 transitions. Word has length 43 [2025-03-16 20:25:16,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:16,391 INFO L471 AbstractCegarLoop]: Abstraction has 1604 states and 2955 transitions. [2025-03-16 20:25:16,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:16,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2955 transitions. [2025-03-16 20:25:16,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 20:25:16,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:16,395 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:16,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:25:16,395 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:16,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:16,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1855229465, now seen corresponding path program 1 times [2025-03-16 20:25:16,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:16,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495958789] [2025-03-16 20:25:16,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:16,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:16,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 20:25:16,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 20:25:16,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:16,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:16,466 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:25:16,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:16,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495958789] [2025-03-16 20:25:16,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495958789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:16,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:16,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:16,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949425315] [2025-03-16 20:25:16,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:16,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:16,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:16,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:16,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:16,468 INFO L87 Difference]: Start difference. First operand 1604 states and 2955 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:16,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:16,497 INFO L93 Difference]: Finished difference Result 1737 states and 3164 transitions. [2025-03-16 20:25:16,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:16,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-16 20:25:16,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:16,503 INFO L225 Difference]: With dead ends: 1737 [2025-03-16 20:25:16,503 INFO L226 Difference]: Without dead ends: 1665 [2025-03-16 20:25:16,504 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:25:16,504 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:16,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1573 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:16,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2025-03-16 20:25:16,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1661. [2025-03-16 20:25:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1659 states have (on average 1.833634719710669) internal successors, (3042), 1660 states have internal predecessors, (3042), 0 states have call successors, (0), 0 states 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:25:16,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 3042 transitions. [2025-03-16 20:25:16,532 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 3042 transitions. Word has length 43 [2025-03-16 20:25:16,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:16,532 INFO L471 AbstractCegarLoop]: Abstraction has 1661 states and 3042 transitions. [2025-03-16 20:25:16,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:16,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 3042 transitions. [2025-03-16 20:25:16,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 20:25:16,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:16,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:16,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:25:16,537 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:16,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:16,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1644230272, now seen corresponding path program 1 times [2025-03-16 20:25:16,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:16,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415975635] [2025-03-16 20:25:16,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:16,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:16,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 20:25:16,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 20:25:16,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:16,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:16,700 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:25:16,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:16,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415975635] [2025-03-16 20:25:16,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415975635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:16,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:16,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:25:16,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002031130] [2025-03-16 20:25:16,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:16,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:25:16,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:16,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:25:16,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:25:16,701 INFO L87 Difference]: Start difference. First operand 1661 states and 3042 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:16,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:16,731 INFO L93 Difference]: Finished difference Result 1667 states and 3049 transitions. [2025-03-16 20:25:16,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:25:16,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-03-16 20:25:16,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:16,738 INFO L225 Difference]: With dead ends: 1667 [2025-03-16 20:25:16,738 INFO L226 Difference]: Without dead ends: 1665 [2025-03-16 20:25:16,738 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:25:16,739 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 0 mSDsluCounter, 3038 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4561 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:16,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4561 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:16,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2025-03-16 20:25:16,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1665. [2025-03-16 20:25:16,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1663 states have (on average 1.831028262176789) internal successors, (3045), 1664 states have internal predecessors, (3045), 0 states have call successors, (0), 0 states 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:25:16,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 3045 transitions. [2025-03-16 20:25:16,768 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 3045 transitions. Word has length 44 [2025-03-16 20:25:16,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:16,768 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 3045 transitions. [2025-03-16 20:25:16,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:16,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 3045 transitions. [2025-03-16 20:25:16,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:25:16,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:16,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:16,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:25:16,769 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:16,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:16,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2138271558, now seen corresponding path program 1 times [2025-03-16 20:25:16,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:16,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996362689] [2025-03-16 20:25:16,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:16,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:16,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:25:16,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:25:16,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:16,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:16,804 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:25:16,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:16,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996362689] [2025-03-16 20:25:16,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996362689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:16,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:16,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:16,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431036511] [2025-03-16 20:25:16,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:16,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:16,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:16,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:16,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:16,805 INFO L87 Difference]: Start difference. First operand 1665 states and 3045 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:16,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:16,828 INFO L93 Difference]: Finished difference Result 1915 states and 3425 transitions. [2025-03-16 20:25:16,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:16,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-16 20:25:16,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:16,833 INFO L225 Difference]: With dead ends: 1915 [2025-03-16 20:25:16,833 INFO L226 Difference]: Without dead ends: 1782 [2025-03-16 20:25:16,834 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:25:16,835 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 1483 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 1619 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:25:16,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 1619 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:16,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2025-03-16 20:25:16,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1780. [2025-03-16 20:25:16,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1778 states have (on average 1.8087739032620922) internal successors, (3216), 1779 states have internal predecessors, (3216), 0 states have call successors, (0), 0 states 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:25:16,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 3216 transitions. [2025-03-16 20:25:16,862 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 3216 transitions. Word has length 45 [2025-03-16 20:25:16,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:16,862 INFO L471 AbstractCegarLoop]: Abstraction has 1780 states and 3216 transitions. [2025-03-16 20:25:16,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:16,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 3216 transitions. [2025-03-16 20:25:16,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:25:16,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:16,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:16,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:25:16,864 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:16,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:16,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1588482630, now seen corresponding path program 1 times [2025-03-16 20:25:16,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:16,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607297269] [2025-03-16 20:25:16,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:16,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:16,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:25:16,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:25:16,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:16,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:16,916 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:25:16,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:16,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607297269] [2025-03-16 20:25:16,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607297269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:16,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:16,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:16,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176651228] [2025-03-16 20:25:16,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:16,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:16,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:16,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:16,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:16,917 INFO L87 Difference]: Start difference. First operand 1780 states and 3216 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:16,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:16,943 INFO L93 Difference]: Finished difference Result 2244 states and 3910 transitions. [2025-03-16 20:25:16,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:16,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-16 20:25:16,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:16,949 INFO L225 Difference]: With dead ends: 2244 [2025-03-16 20:25:16,950 INFO L226 Difference]: Without dead ends: 1996 [2025-03-16 20:25:16,951 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:25:16,951 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 1481 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1481 SdHoareTripleChecker+Valid, 1621 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:25:16,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1481 Valid, 1621 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:16,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2025-03-16 20:25:16,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1994. [2025-03-16 20:25:16,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1994 states, 1992 states have (on average 1.7700803212851406) internal successors, (3526), 1993 states have internal predecessors, (3526), 0 states have call successors, (0), 0 states 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:25:16,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 3526 transitions. [2025-03-16 20:25:16,987 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 3526 transitions. Word has length 45 [2025-03-16 20:25:16,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:16,987 INFO L471 AbstractCegarLoop]: Abstraction has 1994 states and 3526 transitions. [2025-03-16 20:25:16,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:16,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 3526 transitions. [2025-03-16 20:25:16,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-16 20:25:16,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:16,988 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:16,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:25:16,988 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:16,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:16,988 INFO L85 PathProgramCache]: Analyzing trace with hash -2090513338, now seen corresponding path program 1 times [2025-03-16 20:25:16,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:16,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301254135] [2025-03-16 20:25:16,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:16,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:16,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-16 20:25:17,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-16 20:25:17,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:17,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:17,037 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:25:17,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:17,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301254135] [2025-03-16 20:25:17,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301254135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:17,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:17,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:17,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641853310] [2025-03-16 20:25:17,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:17,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:17,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:17,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:17,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:17,038 INFO L87 Difference]: Start difference. First operand 1994 states and 3526 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:17,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:17,066 INFO L93 Difference]: Finished difference Result 2854 states and 4784 transitions. [2025-03-16 20:25:17,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:17,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-16 20:25:17,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:17,074 INFO L225 Difference]: With dead ends: 2854 [2025-03-16 20:25:17,074 INFO L226 Difference]: Without dead ends: 2392 [2025-03-16 20:25:17,076 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:25:17,076 INFO L435 NwaCegarLoop]: 1561 mSDtfsCounter, 1485 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:17,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 1625 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:17,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2392 states. [2025-03-16 20:25:17,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2392 to 2390. [2025-03-16 20:25:17,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2390 states, 2388 states have (on average 1.7093802345058626) internal successors, (4082), 2389 states have internal predecessors, (4082), 0 states have call successors, (0), 0 states 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:25:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 4082 transitions. [2025-03-16 20:25:17,116 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 4082 transitions. Word has length 45 [2025-03-16 20:25:17,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:17,117 INFO L471 AbstractCegarLoop]: Abstraction has 2390 states and 4082 transitions. [2025-03-16 20:25:17,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:17,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 4082 transitions. [2025-03-16 20:25:17,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 20:25:17,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:17,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:17,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:25:17,118 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:17,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:17,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1194131558, now seen corresponding path program 1 times [2025-03-16 20:25:17,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:17,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750713191] [2025-03-16 20:25:17,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:17,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:17,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 20:25:17,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 20:25:17,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:17,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:17,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:17,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750713191] [2025-03-16 20:25:17,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750713191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:17,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:17,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:17,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278717063] [2025-03-16 20:25:17,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:17,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:17,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:17,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:17,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:17,155 INFO L87 Difference]: Start difference. First operand 2390 states and 4082 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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:25:17,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:17,186 INFO L93 Difference]: Finished difference Result 3293 states and 5416 transitions. [2025-03-16 20:25:17,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:17,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-03-16 20:25:17,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:17,194 INFO L225 Difference]: With dead ends: 3293 [2025-03-16 20:25:17,194 INFO L226 Difference]: Without dead ends: 2794 [2025-03-16 20:25:17,195 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:25:17,196 INFO L435 NwaCegarLoop]: 1566 mSDtfsCounter, 1484 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:17,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1626 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:17,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2794 states. [2025-03-16 20:25:17,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2794 to 2792. [2025-03-16 20:25:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2792 states, 2790 states have (on average 1.6673835125448029) internal successors, (4652), 2791 states have internal predecessors, (4652), 0 states have call successors, (0), 0 states 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:25:17,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2792 states and 4652 transitions. [2025-03-16 20:25:17,242 INFO L78 Accepts]: Start accepts. Automaton has 2792 states and 4652 transitions. Word has length 47 [2025-03-16 20:25:17,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:17,242 INFO L471 AbstractCegarLoop]: Abstraction has 2792 states and 4652 transitions. [2025-03-16 20:25:17,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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:25:17,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 4652 transitions. [2025-03-16 20:25:17,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:25:17,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:17,243 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:17,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:25:17,243 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:17,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:17,244 INFO L85 PathProgramCache]: Analyzing trace with hash 96347508, now seen corresponding path program 1 times [2025-03-16 20:25:17,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:17,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608099017] [2025-03-16 20:25:17,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:17,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:17,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:25:17,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:25:17,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:17,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:17,337 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:25:17,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:17,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608099017] [2025-03-16 20:25:17,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608099017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:17,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:17,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:17,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657429956] [2025-03-16 20:25:17,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:17,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:17,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:17,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:17,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:17,339 INFO L87 Difference]: Start difference. First operand 2792 states and 4652 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:17,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:17,461 INFO L93 Difference]: Finished difference Result 8098 states and 12265 transitions. [2025-03-16 20:25:17,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:25:17,462 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 20:25:17,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:17,487 INFO L225 Difference]: With dead ends: 8098 [2025-03-16 20:25:17,487 INFO L226 Difference]: Without dead ends: 6840 [2025-03-16 20:25:17,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:25:17,492 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 4693 mSDsluCounter, 1713 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4693 SdHoareTripleChecker+Valid, 3288 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:17,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4693 Valid, 3288 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:17,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6840 states. [2025-03-16 20:25:17,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6840 to 4048. [2025-03-16 20:25:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4048 states, 4046 states have (on average 1.5907068709836876) internal successors, (6436), 4047 states have internal predecessors, (6436), 0 states have call successors, (0), 0 states 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:25:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4048 states to 4048 states and 6436 transitions. [2025-03-16 20:25:17,638 INFO L78 Accepts]: Start accepts. Automaton has 4048 states and 6436 transitions. Word has length 61 [2025-03-16 20:25:17,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:17,638 INFO L471 AbstractCegarLoop]: Abstraction has 4048 states and 6436 transitions. [2025-03-16 20:25:17,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:17,638 INFO L276 IsEmpty]: Start isEmpty. Operand 4048 states and 6436 transitions. [2025-03-16 20:25:17,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:25:17,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:17,640 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:17,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:25:17,640 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:17,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:17,641 INFO L85 PathProgramCache]: Analyzing trace with hash -453441420, now seen corresponding path program 1 times [2025-03-16 20:25:17,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:17,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314823853] [2025-03-16 20:25:17,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:17,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:17,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:25:17,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:25:17,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:17,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:17,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:25:17,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:17,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314823853] [2025-03-16 20:25:17,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314823853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:17,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:17,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:17,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144841361] [2025-03-16 20:25:17,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:17,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:17,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:17,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:17,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:17,845 INFO L87 Difference]: Start difference. First operand 4048 states and 6436 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:18,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:18,021 INFO L93 Difference]: Finished difference Result 9354 states and 14049 transitions. [2025-03-16 20:25:18,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:25:18,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 20:25:18,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:18,035 INFO L225 Difference]: With dead ends: 9354 [2025-03-16 20:25:18,035 INFO L226 Difference]: Without dead ends: 8096 [2025-03-16 20:25:18,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:25:18,040 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 4683 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4683 SdHoareTripleChecker+Valid, 3310 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:18,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4683 Valid, 3310 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:25:18,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8096 states. [2025-03-16 20:25:18,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8096 to 5936. [2025-03-16 20:25:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5936 states, 5934 states have (on average 1.5321873946747557) internal successors, (9092), 5935 states have internal predecessors, (9092), 0 states have call successors, (0), 0 states 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:25:18,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5936 states to 5936 states and 9092 transitions. [2025-03-16 20:25:18,159 INFO L78 Accepts]: Start accepts. Automaton has 5936 states and 9092 transitions. Word has length 61 [2025-03-16 20:25:18,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:18,160 INFO L471 AbstractCegarLoop]: Abstraction has 5936 states and 9092 transitions. [2025-03-16 20:25:18,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:18,160 INFO L276 IsEmpty]: Start isEmpty. Operand 5936 states and 9092 transitions. [2025-03-16 20:25:18,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 20:25:18,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:18,161 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:18,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:25:18,161 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:18,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:18,162 INFO L85 PathProgramCache]: Analyzing trace with hash 162529908, now seen corresponding path program 1 times [2025-03-16 20:25:18,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:18,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467836596] [2025-03-16 20:25:18,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:18,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:18,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 20:25:18,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 20:25:18,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:18,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:18,298 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:25:18,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:18,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467836596] [2025-03-16 20:25:18,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467836596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:18,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:18,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:18,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016788259] [2025-03-16 20:25:18,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:18,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:18,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:18,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:18,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:18,300 INFO L87 Difference]: Start difference. First operand 5936 states and 9092 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:18,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:18,449 INFO L93 Difference]: Finished difference Result 10610 states and 15833 transitions. [2025-03-16 20:25:18,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:25:18,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-16 20:25:18,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:18,464 INFO L225 Difference]: With dead ends: 10610 [2025-03-16 20:25:18,464 INFO L226 Difference]: Without dead ends: 9352 [2025-03-16 20:25:18,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:25:18,469 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 4651 mSDsluCounter, 1777 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4651 SdHoareTripleChecker+Valid, 3354 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:18,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4651 Valid, 3354 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:18,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9352 states. [2025-03-16 20:25:18,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9352 to 7192. [2025-03-16 20:25:18,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7192 states, 7190 states have (on average 1.5126564673157163) internal successors, (10876), 7191 states have internal predecessors, (10876), 0 states have call successors, (0), 0 states 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:25:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7192 states to 7192 states and 10876 transitions. [2025-03-16 20:25:18,602 INFO L78 Accepts]: Start accepts. Automaton has 7192 states and 10876 transitions. Word has length 61 [2025-03-16 20:25:18,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:18,603 INFO L471 AbstractCegarLoop]: Abstraction has 7192 states and 10876 transitions. [2025-03-16 20:25:18,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 7192 states and 10876 transitions. [2025-03-16 20:25:18,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 20:25:18,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:18,605 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:18,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:25:18,605 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:18,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:18,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1862143114, now seen corresponding path program 1 times [2025-03-16 20:25:18,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:18,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523196032] [2025-03-16 20:25:18,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:18,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:18,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 20:25:18,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 20:25:18,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:18,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:18,679 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:18,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:18,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523196032] [2025-03-16 20:25:18,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523196032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:18,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:18,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:18,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813608004] [2025-03-16 20:25:18,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:18,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:18,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:18,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:18,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:18,680 INFO L87 Difference]: Start difference. First operand 7192 states and 10876 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:18,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:18,760 INFO L93 Difference]: Finished difference Result 11245 states and 16728 transitions. [2025-03-16 20:25:18,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:18,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 20:25:18,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:18,769 INFO L225 Difference]: With dead ends: 11245 [2025-03-16 20:25:18,769 INFO L226 Difference]: Without dead ends: 5587 [2025-03-16 20:25:18,773 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:25:18,774 INFO L435 NwaCegarLoop]: 1557 mSDtfsCounter, 42 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3067 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:25:18,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3067 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:18,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5587 states. [2025-03-16 20:25:18,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5587 to 5585. [2025-03-16 20:25:18,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5585 states, 5583 states have (on average 1.5441518896650546) internal successors, (8621), 5584 states have internal predecessors, (8621), 0 states have call successors, (0), 0 states 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:25:18,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5585 states to 5585 states and 8621 transitions. [2025-03-16 20:25:18,859 INFO L78 Accepts]: Start accepts. Automaton has 5585 states and 8621 transitions. Word has length 63 [2025-03-16 20:25:18,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:18,859 INFO L471 AbstractCegarLoop]: Abstraction has 5585 states and 8621 transitions. [2025-03-16 20:25:18,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:18,860 INFO L276 IsEmpty]: Start isEmpty. Operand 5585 states and 8621 transitions. [2025-03-16 20:25:18,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 20:25:18,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:18,860 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:18,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:25:18,861 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:18,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:18,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1705173780, now seen corresponding path program 1 times [2025-03-16 20:25:18,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:18,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027666316] [2025-03-16 20:25:18,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:18,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:18,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 20:25:18,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 20:25:18,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:18,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:25:18,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:18,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027666316] [2025-03-16 20:25:18,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027666316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:18,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:18,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:25:18,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586109017] [2025-03-16 20:25:18,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:18,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:25:18,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:18,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:25:18,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:25:18,952 INFO L87 Difference]: Start difference. First operand 5585 states and 8621 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:19,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:19,072 INFO L93 Difference]: Finished difference Result 9179 states and 13810 transitions. [2025-03-16 20:25:19,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:25:19,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-16 20:25:19,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:19,085 INFO L225 Difference]: With dead ends: 9179 [2025-03-16 20:25:19,085 INFO L226 Difference]: Without dead ends: 8281 [2025-03-16 20:25:19,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 20:25:19,090 INFO L435 NwaCegarLoop]: 1572 mSDtfsCounter, 4657 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4657 SdHoareTripleChecker+Valid, 3311 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:19,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4657 Valid, 3311 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:19,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8281 states. [2025-03-16 20:25:19,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8281 to 6481. [2025-03-16 20:25:19,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6481 states, 6479 states have (on average 1.5281679271492514) internal successors, (9901), 6480 states have internal predecessors, (9901), 0 states have call successors, (0), 0 states 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:25:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6481 states to 6481 states and 9901 transitions. [2025-03-16 20:25:19,285 INFO L78 Accepts]: Start accepts. Automaton has 6481 states and 9901 transitions. Word has length 63 [2025-03-16 20:25:19,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:19,286 INFO L471 AbstractCegarLoop]: Abstraction has 6481 states and 9901 transitions. [2025-03-16 20:25:19,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:19,286 INFO L276 IsEmpty]: Start isEmpty. Operand 6481 states and 9901 transitions. [2025-03-16 20:25:19,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 20:25:19,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:19,288 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:19,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:25:19,288 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:19,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:19,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1410201656, now seen corresponding path program 1 times [2025-03-16 20:25:19,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:19,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656450849] [2025-03-16 20:25:19,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:19,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:19,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 20:25:19,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 20:25:19,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:19,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:19,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:19,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656450849] [2025-03-16 20:25:19,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656450849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:19,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:19,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:19,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285807284] [2025-03-16 20:25:19,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:19,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:19,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:19,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:19,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:19,386 INFO L87 Difference]: Start difference. First operand 6481 states and 9901 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:19,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:19,481 INFO L93 Difference]: Finished difference Result 8949 states and 13423 transitions. [2025-03-16 20:25:19,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:19,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-16 20:25:19,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:19,493 INFO L225 Difference]: With dead ends: 8949 [2025-03-16 20:25:19,497 INFO L226 Difference]: Without dead ends: 4019 [2025-03-16 20:25:19,507 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:25:19,511 INFO L435 NwaCegarLoop]: 1550 mSDtfsCounter, 37 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3052 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:25:19,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3052 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:19,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4019 states. [2025-03-16 20:25:19,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4019 to 4017. [2025-03-16 20:25:19,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4017 states, 4015 states have (on average 1.5783312577833126) internal successors, (6337), 4016 states have internal predecessors, (6337), 0 states have call successors, (0), 0 states 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:25:19,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 6337 transitions. [2025-03-16 20:25:19,574 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 6337 transitions. Word has length 64 [2025-03-16 20:25:19,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:19,574 INFO L471 AbstractCegarLoop]: Abstraction has 4017 states and 6337 transitions. [2025-03-16 20:25:19,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:19,575 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 6337 transitions. [2025-03-16 20:25:19,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:25:19,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:19,576 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:19,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:25:19,576 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:19,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:19,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2134590337, now seen corresponding path program 1 times [2025-03-16 20:25:19,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:19,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5043514] [2025-03-16 20:25:19,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:19,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:19,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:25:19,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:25:19,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:19,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:19,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:19,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5043514] [2025-03-16 20:25:19,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5043514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:19,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:19,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:19,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023436676] [2025-03-16 20:25:19,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:19,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:19,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:19,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:19,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:19,656 INFO L87 Difference]: Start difference. First operand 4017 states and 6337 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:19,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:19,685 INFO L93 Difference]: Finished difference Result 5253 states and 8077 transitions. [2025-03-16 20:25:19,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:19,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-16 20:25:19,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:19,690 INFO L225 Difference]: With dead ends: 5253 [2025-03-16 20:25:19,690 INFO L226 Difference]: Without dead ends: 2787 [2025-03-16 20:25:19,692 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:25:19,693 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 34 mSDsluCounter, 1494 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3037 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:25:19,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3037 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:19,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2787 states. [2025-03-16 20:25:19,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2787 to 2785. [2025-03-16 20:25:19,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2785 states, 2783 states have (on average 1.6446280991735538) internal successors, (4577), 2784 states have internal predecessors, (4577), 0 states have call successors, (0), 0 states 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:25:19,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 4577 transitions. [2025-03-16 20:25:19,740 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 4577 transitions. Word has length 66 [2025-03-16 20:25:19,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:19,740 INFO L471 AbstractCegarLoop]: Abstraction has 2785 states and 4577 transitions. [2025-03-16 20:25:19,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 4577 transitions. [2025-03-16 20:25:19,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 20:25:19,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:19,741 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:19,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:25:19,741 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:19,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:19,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1210827322, now seen corresponding path program 1 times [2025-03-16 20:25:19,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:19,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78290021] [2025-03-16 20:25:19,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:19,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:19,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 20:25:19,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 20:25:19,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:19,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:19,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:19,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78290021] [2025-03-16 20:25:19,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78290021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:25:19,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:25:19,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:25:19,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894396077] [2025-03-16 20:25:19,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:25:19,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:25:19,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:19,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:25:19,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:25:19,804 INFO L87 Difference]: Start difference. First operand 2785 states and 4577 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:19,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:19,825 INFO L93 Difference]: Finished difference Result 3405 states and 5437 transitions. [2025-03-16 20:25:19,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:25:19,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-16 20:25:19,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:19,829 INFO L225 Difference]: With dead ends: 3405 [2025-03-16 20:25:19,830 INFO L226 Difference]: Without dead ends: 2171 [2025-03-16 20:25:19,831 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:25:19,831 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 31 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3022 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:25:19,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3022 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:25:19,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2025-03-16 20:25:19,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 2169. [2025-03-16 20:25:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2167 states have (on average 1.711121365943701) internal successors, (3708), 2168 states have internal predecessors, (3708), 0 states have call successors, (0), 0 states 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:25:19,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3708 transitions. [2025-03-16 20:25:19,857 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3708 transitions. Word has length 68 [2025-03-16 20:25:19,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:19,858 INFO L471 AbstractCegarLoop]: Abstraction has 2169 states and 3708 transitions. [2025-03-16 20:25:19,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:19,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3708 transitions. [2025-03-16 20:25:19,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 20:25:19,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:19,858 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:19,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:25:19,859 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:19,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:19,859 INFO L85 PathProgramCache]: Analyzing trace with hash 301011955, now seen corresponding path program 1 times [2025-03-16 20:25:19,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:19,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109177578] [2025-03-16 20:25:19,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:19,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:19,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 20:25:19,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 20:25:19,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:19,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:21,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:21,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109177578] [2025-03-16 20:25:21,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109177578] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:25:21,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853955176] [2025-03-16 20:25:21,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:21,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:21,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:25:21,017 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:25:21,023 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:25:21,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 20:25:21,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 20:25:21,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:21,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:21,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 20:25:21,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:25:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:21,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:25:21,556 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:21,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853955176] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:25:21,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:25:21,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 21 [2025-03-16 20:25:21,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844204099] [2025-03-16 20:25:21,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:25:21,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:25:21,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:21,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:25:21,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:25:21,558 INFO L87 Difference]: Start difference. First operand 2169 states and 3708 transitions. Second operand has 21 states, 21 states have (on average 9.523809523809524) internal successors, (200), 21 states have internal predecessors, (200), 0 states have call successors, (0), 0 states 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:25:24,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:24,359 INFO L93 Difference]: Finished difference Result 7921 states and 11452 transitions. [2025-03-16 20:25:24,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-16 20:25:24,359 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.523809523809524) internal successors, (200), 21 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-16 20:25:24,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:24,369 INFO L225 Difference]: With dead ends: 7921 [2025-03-16 20:25:24,369 INFO L226 Difference]: Without dead ends: 7229 [2025-03-16 20:25:24,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2691 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1278, Invalid=6912, Unknown=0, NotChecked=0, Total=8190 [2025-03-16 20:25:24,374 INFO L435 NwaCegarLoop]: 1511 mSDtfsCounter, 14751 mSDsluCounter, 7991 mSDsCounter, 0 mSdLazyCounter, 1904 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14751 SdHoareTripleChecker+Valid, 9502 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:24,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14751 Valid, 9502 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1904 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 20:25:24,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7229 states. [2025-03-16 20:25:24,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7229 to 6775. [2025-03-16 20:25:24,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6775 states, 6773 states have (on average 1.4411634430828288) internal successors, (9761), 6774 states have internal predecessors, (9761), 0 states have call successors, (0), 0 states 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:25:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6775 states to 6775 states and 9761 transitions. [2025-03-16 20:25:24,603 INFO L78 Accepts]: Start accepts. Automaton has 6775 states and 9761 transitions. Word has length 70 [2025-03-16 20:25:24,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:24,607 INFO L471 AbstractCegarLoop]: Abstraction has 6775 states and 9761 transitions. [2025-03-16 20:25:24,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.523809523809524) internal successors, (200), 21 states have internal predecessors, (200), 0 states have call successors, (0), 0 states 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:25:24,607 INFO L276 IsEmpty]: Start isEmpty. Operand 6775 states and 9761 transitions. [2025-03-16 20:25:24,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:25:24,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:24,608 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:24,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 20:25:24,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:24,809 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:24,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:24,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1576910278, now seen corresponding path program 1 times [2025-03-16 20:25:24,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:24,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039732179] [2025-03-16 20:25:24,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:24,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:24,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:25:24,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:25:24,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:24,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:25,052 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:25,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:25,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039732179] [2025-03-16 20:25:25,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039732179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:25:25,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660843374] [2025-03-16 20:25:25,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:25,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:25,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:25:25,055 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:25:25,057 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:25:25,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:25:25,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:25:25,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:25,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:25,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-16 20:25:25,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:25:26,677 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:26,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:25:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:25:29,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660843374] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:25:29,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:25:29,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 19] total 43 [2025-03-16 20:25:29,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084158118] [2025-03-16 20:25:29,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:25:29,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-16 20:25:29,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:29,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-16 20:25:29,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1582, Unknown=0, NotChecked=0, Total=1892 [2025-03-16 20:25:29,101 INFO L87 Difference]: Start difference. First operand 6775 states and 9761 transitions. Second operand has 44 states, 44 states have (on average 4.25) internal successors, (187), 43 states have internal predecessors, (187), 0 states have call successors, (0), 0 states 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:25:30,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:30,522 INFO L93 Difference]: Finished difference Result 12231 states and 16859 transitions. [2025-03-16 20:25:30,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-16 20:25:30,523 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 4.25) internal successors, (187), 43 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-16 20:25:30,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:30,535 INFO L225 Difference]: With dead ends: 12231 [2025-03-16 20:25:30,535 INFO L226 Difference]: Without dead ends: 7073 [2025-03-16 20:25:30,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1072, Invalid=3620, Unknown=0, NotChecked=0, Total=4692 [2025-03-16 20:25:30,544 INFO L435 NwaCegarLoop]: 1489 mSDtfsCounter, 19861 mSDsluCounter, 12166 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19861 SdHoareTripleChecker+Valid, 13655 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:30,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19861 Valid, 13655 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:25:30,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7073 states. [2025-03-16 20:25:30,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7073 to 6183. [2025-03-16 20:25:30,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6183 states, 6181 states have (on average 1.435528231677722) internal successors, (8873), 6182 states have internal predecessors, (8873), 0 states have call successors, (0), 0 states 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:25:30,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6183 states to 6183 states and 8873 transitions. [2025-03-16 20:25:30,715 INFO L78 Accepts]: Start accepts. Automaton has 6183 states and 8873 transitions. Word has length 71 [2025-03-16 20:25:30,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:30,715 INFO L471 AbstractCegarLoop]: Abstraction has 6183 states and 8873 transitions. [2025-03-16 20:25:30,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.25) internal successors, (187), 43 states have internal predecessors, (187), 0 states have call successors, (0), 0 states 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:25:30,716 INFO L276 IsEmpty]: Start isEmpty. Operand 6183 states and 8873 transitions. [2025-03-16 20:25:30,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 20:25:30,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:30,717 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:30,724 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:25:30,922 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,SelfDestructingSolverStorable19 [2025-03-16 20:25:30,923 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:30,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:30,923 INFO L85 PathProgramCache]: Analyzing trace with hash 677677382, now seen corresponding path program 1 times [2025-03-16 20:25:30,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:30,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191984452] [2025-03-16 20:25:30,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:30,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:30,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:25:30,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:25:30,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:30,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:31,318 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:25:31,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:31,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191984452] [2025-03-16 20:25:31,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191984452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:25:31,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340153328] [2025-03-16 20:25:31,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:31,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:31,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:25:31,321 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:25:31,322 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:25:31,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 20:25:31,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 20:25:31,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:31,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:31,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 20:25:31,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:25:31,713 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:25:31,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:25:32,152 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:25:32,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340153328] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:25:32,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:25:32,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2025-03-16 20:25:32,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193115677] [2025-03-16 20:25:32,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:25:32,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-16 20:25:32,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:32,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-16 20:25:32,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2025-03-16 20:25:32,154 INFO L87 Difference]: Start difference. First operand 6183 states and 8873 transitions. Second operand has 29 states, 29 states have (on average 6.379310344827586) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 states 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:25:33,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:33,326 INFO L93 Difference]: Finished difference Result 20263 states and 27209 transitions. [2025-03-16 20:25:33,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-16 20:25:33,327 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.379310344827586) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-16 20:25:33,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:33,345 INFO L225 Difference]: With dead ends: 20263 [2025-03-16 20:25:33,345 INFO L226 Difference]: Without dead ends: 15673 [2025-03-16 20:25:33,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=538, Invalid=2114, Unknown=0, NotChecked=0, Total=2652 [2025-03-16 20:25:33,350 INFO L435 NwaCegarLoop]: 1517 mSDtfsCounter, 21652 mSDsluCounter, 7843 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21652 SdHoareTripleChecker+Valid, 9360 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:33,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21652 Valid, 9360 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:25:33,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15673 states. [2025-03-16 20:25:33,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15673 to 15597. [2025-03-16 20:25:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15597 states, 15595 states have (on average 1.3404296248797691) internal successors, (20904), 15596 states have internal predecessors, (20904), 0 states have call successors, (0), 0 states 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:25:33,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15597 states to 15597 states and 20904 transitions. [2025-03-16 20:25:33,993 INFO L78 Accepts]: Start accepts. Automaton has 15597 states and 20904 transitions. Word has length 71 [2025-03-16 20:25:33,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:33,993 INFO L471 AbstractCegarLoop]: Abstraction has 15597 states and 20904 transitions. [2025-03-16 20:25:33,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.379310344827586) internal successors, (185), 28 states have internal predecessors, (185), 0 states have call successors, (0), 0 states 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:25:33,993 INFO L276 IsEmpty]: Start isEmpty. Operand 15597 states and 20904 transitions. [2025-03-16 20:25:33,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 20:25:33,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:33,994 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:34,001 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:25:34,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:34,199 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:34,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:34,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1854252322, now seen corresponding path program 1 times [2025-03-16 20:25:34,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:34,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306462687] [2025-03-16 20:25:34,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:34,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:34,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 20:25:34,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 20:25:34,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:34,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:34,408 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:25:34,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:34,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306462687] [2025-03-16 20:25:34,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306462687] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:25:34,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224623213] [2025-03-16 20:25:34,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:34,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:34,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:25:34,411 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:25:34,412 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:25:34,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 20:25:34,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 20:25:34,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:34,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:34,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-16 20:25:34,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:25:34,979 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:25:34,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:25:35,651 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:25:35,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224623213] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:25:35,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:25:35,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 32 [2025-03-16 20:25:35,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881493090] [2025-03-16 20:25:35,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:25:35,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-16 20:25:35,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:35,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-16 20:25:35,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2025-03-16 20:25:35,653 INFO L87 Difference]: Start difference. First operand 15597 states and 20904 transitions. Second operand has 32 states, 32 states have (on average 5.84375) internal successors, (187), 32 states have internal predecessors, (187), 0 states have call successors, (0), 0 states 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:25:37,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:25:37,920 INFO L93 Difference]: Finished difference Result 36563 states and 47880 transitions. [2025-03-16 20:25:37,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-16 20:25:37,924 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.84375) internal successors, (187), 32 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-03-16 20:25:37,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:25:37,953 INFO L225 Difference]: With dead ends: 36563 [2025-03-16 20:25:37,953 INFO L226 Difference]: Without dead ends: 23119 [2025-03-16 20:25:37,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=879, Invalid=3951, Unknown=0, NotChecked=0, Total=4830 [2025-03-16 20:25:37,966 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 16141 mSDsluCounter, 15713 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16141 SdHoareTripleChecker+Valid, 17235 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:25:37,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16141 Valid, 17235 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:25:37,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23119 states. [2025-03-16 20:25:38,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23119 to 14675. [2025-03-16 20:25:38,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14675 states, 14673 states have (on average 1.329584951952566) internal successors, (19509), 14674 states have internal predecessors, (19509), 0 states have call successors, (0), 0 states 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:25:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14675 states to 14675 states and 19509 transitions. [2025-03-16 20:25:38,565 INFO L78 Accepts]: Start accepts. Automaton has 14675 states and 19509 transitions. Word has length 72 [2025-03-16 20:25:38,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:25:38,565 INFO L471 AbstractCegarLoop]: Abstraction has 14675 states and 19509 transitions. [2025-03-16 20:25:38,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.84375) internal successors, (187), 32 states have internal predecessors, (187), 0 states have call successors, (0), 0 states 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:25:38,566 INFO L276 IsEmpty]: Start isEmpty. Operand 14675 states and 19509 transitions. [2025-03-16 20:25:38,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 20:25:38,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:25:38,567 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:25:38,574 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:25:38,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:38,767 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:25:38,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:25:38,768 INFO L85 PathProgramCache]: Analyzing trace with hash -416617920, now seen corresponding path program 1 times [2025-03-16 20:25:38,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:25:38,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500027880] [2025-03-16 20:25:38,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:38,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:25:38,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:25:38,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:25:38,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:38,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:39,287 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:25:39,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:25:39,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500027880] [2025-03-16 20:25:39,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500027880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:25:39,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734207791] [2025-03-16 20:25:39,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:25:39,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:25:39,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:25:39,290 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:25:39,292 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:25:39,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 20:25:39,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 20:25:39,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:25:39,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:25:39,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-16 20:25:39,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:25:42,339 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:25:42,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:25:43,720 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:25:43,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734207791] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:25:43,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:25:43,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20, 17] total 43 [2025-03-16 20:25:43,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139887838] [2025-03-16 20:25:43,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:25:43,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-16 20:25:43,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:25:43,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-16 20:25:43,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1570, Unknown=0, NotChecked=0, Total=1806 [2025-03-16 20:25:43,722 INFO L87 Difference]: Start difference. First operand 14675 states and 19509 transitions. Second operand has 43 states, 43 states have (on average 4.372093023255814) internal successors, (188), 43 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:25:49,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 20:25:51,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 20:25:56,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 20:26:04,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 20:26:09,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 20:26:14,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 20:26:24,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0]