./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label05.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 d0915623dd1f4682f183de0ff6ce6338d2670547f36e90f5eb8f63b75b82ebb3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:53:41,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:53:41,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:53:41,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:53:41,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:53:41,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:53:41,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:53:41,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:53:41,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:53:41,124 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:53:41,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:53:41,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:53:41,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:53:41,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:53:41,125 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:53:41,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:53:41,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:53:41,125 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:53:41,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:53:41,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:53:41,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:53:41,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:53:41,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:53:41,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:53:41,126 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:53:41,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:53:41,126 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:53:41,126 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:53:41,126 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:53:41,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:53:41,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:53:41,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:53:41,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:53:41,127 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:53:41,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:53:41,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:53:41,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:53:41,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:53:41,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:53:41,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:53:41,128 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:53:41,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:53:41,128 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:53:41,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:53:41,128 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:53:41,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:53:41,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:53:41,129 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:53:41,129 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-jdk21/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 -> d0915623dd1f4682f183de0ff6ce6338d2670547f36e90f5eb8f63b75b82ebb3 [2025-01-09 05:53:41,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:53:41,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:53:41,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:53:41,354 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:53:41,354 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:53:41,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-01-09 05:53:42,670 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/712b88c50/a43184716fbd459fbb3fed64c1c00250/FLAGec0b0d767 [2025-01-09 05:53:43,193 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:53:43,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-01-09 05:53:43,217 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/712b88c50/a43184716fbd459fbb3fed64c1c00250/FLAGec0b0d767 [2025-01-09 05:53:43,277 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/712b88c50/a43184716fbd459fbb3fed64c1c00250 [2025-01-09 05:53:43,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:53:43,280 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:53:43,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:53:43,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:53:43,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:53:43,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:53:43" (1/1) ... [2025-01-09 05:53:43,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68092524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:43, skipping insertion in model container [2025-01-09 05:53:43,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:53:43" (1/1) ... [2025-01-09 05:53:43,353 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:53:43,670 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label05.c[15547,15560] [2025-01-09 05:53:43,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label05.c[22483,22496] [2025-01-09 05:53:44,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:53:44,160 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:53:44,195 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label05.c[15547,15560] [2025-01-09 05:53:44,202 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label05.c[22483,22496] [2025-01-09 05:53:44,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:53:44,470 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:53:44,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:44 WrapperNode [2025-01-09 05:53:44,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:53:44,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:53:44,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:53:44,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:53:44,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:44" (1/1) ... [2025-01-09 05:53:44,521 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:44" (1/1) ... [2025-01-09 05:53:44,782 INFO L138 Inliner]: procedures = 38, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5152 [2025-01-09 05:53:44,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:53:44,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:53:44,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:53:44,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:53:44,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:44" (1/1) ... [2025-01-09 05:53:44,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:44" (1/1) ... [2025-01-09 05:53:44,817 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:44" (1/1) ... [2025-01-09 05:53:44,970 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-01-09 05:53:44,971 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:44" (1/1) ... [2025-01-09 05:53:44,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:44" (1/1) ... [2025-01-09 05:53:45,039 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:44" (1/1) ... [2025-01-09 05:53:45,057 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:44" (1/1) ... [2025-01-09 05:53:45,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:44" (1/1) ... [2025-01-09 05:53:45,122 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:44" (1/1) ... [2025-01-09 05:53:45,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:44" (1/1) ... [2025-01-09 05:53:45,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:53:45,177 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:53:45,177 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:53:45,177 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:53:45,177 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:44" (1/1) ... [2025-01-09 05:53:45,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:53:45,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:53:45,201 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 05:53:45,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 05:53:45,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:53:45,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:53:45,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:53:45,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:53:45,314 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:53:45,316 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:53:48,756 INFO L? ?]: Removed 749 outVars from TransFormulas that were not future-live. [2025-01-09 05:53:48,756 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:53:48,788 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:53:48,792 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 05:53:48,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:53:48 BoogieIcfgContainer [2025-01-09 05:53:48,792 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:53:48,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:53:48,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:53:48,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:53:48,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:53:43" (1/3) ... [2025-01-09 05:53:48,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56eb09ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:53:48, skipping insertion in model container [2025-01-09 05:53:48,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:53:44" (2/3) ... [2025-01-09 05:53:48,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56eb09ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:53:48, skipping insertion in model container [2025-01-09 05:53:48,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:53:48" (3/3) ... [2025-01-09 05:53:48,800 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-01-09 05:53:48,810 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:53:48,813 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label05.c that has 1 procedures, 915 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:53:48,882 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:53:48,890 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;@5636f154, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:53:48,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:53:48,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 915 states, 912 states have (on average 1.9024122807017543) internal successors, (1735), 914 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:48,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 05:53:48,901 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:48,901 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:53:48,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:48,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:48,905 INFO L85 PathProgramCache]: Analyzing trace with hash 259331945, now seen corresponding path program 1 times [2025-01-09 05:53:48,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:48,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230098237] [2025-01-09 05:53:48,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:48,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:48,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 05:53:48,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 05:53:48,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:48,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:49,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:53:49,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:49,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230098237] [2025-01-09 05:53:49,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230098237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:49,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:49,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:53:49,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691637833] [2025-01-09 05:53:49,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:49,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 05:53:49,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:49,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 05:53:49,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:53:49,119 INFO L87 Difference]: Start difference. First operand has 915 states, 912 states have (on average 1.9024122807017543) internal successors, (1735), 914 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:49,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:49,181 INFO L93 Difference]: Finished difference Result 1783 states and 3381 transitions. [2025-01-09 05:53:49,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 05:53:49,182 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-01-09 05:53:49,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:49,191 INFO L225 Difference]: With dead ends: 1783 [2025-01-09 05:53:49,191 INFO L226 Difference]: Without dead ends: 850 [2025-01-09 05:53:49,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:53:49,197 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:53:49,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1669 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:53:49,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-01-09 05:53:49,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2025-01-09 05:53:49,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 848 states have (on average 1.892688679245283) internal successors, (1605), 849 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:49,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1605 transitions. [2025-01-09 05:53:49,246 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1605 transitions. Word has length 26 [2025-01-09 05:53:49,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:49,246 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1605 transitions. [2025-01-09 05:53:49,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:49,247 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1605 transitions. [2025-01-09 05:53:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 05:53:49,248 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:49,248 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] [2025-01-09 05:53:49,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:53:49,248 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:49,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:49,248 INFO L85 PathProgramCache]: Analyzing trace with hash -558316505, now seen corresponding path program 1 times [2025-01-09 05:53:49,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:49,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979007097] [2025-01-09 05:53:49,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:49,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:49,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 05:53:49,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 05:53:49,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:49,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:53:49,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:49,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979007097] [2025-01-09 05:53:49,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979007097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:49,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:49,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:53:49,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633734034] [2025-01-09 05:53:49,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:49,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:53:49,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:49,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:53:49,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:53:49,495 INFO L87 Difference]: Start difference. First operand 850 states and 1605 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:49,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:49,619 INFO L93 Difference]: Finished difference Result 904 states and 1689 transitions. [2025-01-09 05:53:49,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:53:49,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-01-09 05:53:49,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:49,623 INFO L225 Difference]: With dead ends: 904 [2025-01-09 05:53:49,626 INFO L226 Difference]: Without dead ends: 850 [2025-01-09 05:53:49,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:53:49,628 INFO L435 NwaCegarLoop]: 1603 mSDtfsCounter, 0 mSDsluCounter, 4764 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6367 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:53:49,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6367 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:53:49,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-01-09 05:53:49,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2025-01-09 05:53:49,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 848 states have (on average 1.8455188679245282) internal successors, (1565), 849 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:49,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1565 transitions. [2025-01-09 05:53:49,663 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1565 transitions. Word has length 26 [2025-01-09 05:53:49,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:49,663 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1565 transitions. [2025-01-09 05:53:49,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:49,663 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1565 transitions. [2025-01-09 05:53:49,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 05:53:49,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:49,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:53:49,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:53:49,668 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:49,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:49,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1477044992, now seen corresponding path program 1 times [2025-01-09 05:53:49,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:49,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435568238] [2025-01-09 05:53:49,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:49,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:49,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 05:53:49,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 05:53:49,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:49,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:49,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:53:49,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:49,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435568238] [2025-01-09 05:53:49,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435568238] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:49,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:49,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:53:49,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487695257] [2025-01-09 05:53:49,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:49,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:53:49,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:49,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:53:49,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:53:49,909 INFO L87 Difference]: Start difference. First operand 850 states and 1565 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:55,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:55,421 INFO L93 Difference]: Finished difference Result 3105 states and 5874 transitions. [2025-01-09 05:53:55,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:53:55,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-01-09 05:53:55,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:55,429 INFO L225 Difference]: With dead ends: 3105 [2025-01-09 05:53:55,429 INFO L226 Difference]: Without dead ends: 2352 [2025-01-09 05:53:55,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:53:55,431 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 2433 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2433 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:53:55,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2433 Valid, 837 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-01-09 05:53:55,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2025-01-09 05:53:55,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 2352. [2025-01-09 05:53:55,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2352 states, 2350 states have (on average 1.5706382978723403) internal successors, (3691), 2351 states have internal predecessors, (3691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:55,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 3691 transitions. [2025-01-09 05:53:55,475 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 3691 transitions. Word has length 60 [2025-01-09 05:53:55,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:55,476 INFO L471 AbstractCegarLoop]: Abstraction has 2352 states and 3691 transitions. [2025-01-09 05:53:55,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:55,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 3691 transitions. [2025-01-09 05:53:55,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:53:55,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:55,479 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:53:55,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:53:55,479 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:55,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:55,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1992870259, now seen corresponding path program 1 times [2025-01-09 05:53:55,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:55,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760890374] [2025-01-09 05:53:55,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:55,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:55,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:53:55,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:53:55,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:55,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:55,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:53:55,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:55,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760890374] [2025-01-09 05:53:55,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760890374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:55,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:55,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:53:55,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630371438] [2025-01-09 05:53:55,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:55,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:53:55,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:55,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:53:55,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:53:55,696 INFO L87 Difference]: Start difference. First operand 2352 states and 3691 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:55,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:55,905 INFO L93 Difference]: Finished difference Result 2952 states and 4651 transitions. [2025-01-09 05:53:55,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:53:55,906 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 05:53:55,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:55,915 INFO L225 Difference]: With dead ends: 2952 [2025-01-09 05:53:55,915 INFO L226 Difference]: Without dead ends: 2902 [2025-01-09 05:53:55,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-01-09 05:53:55,916 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 9729 mSDsluCounter, 1968 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9729 SdHoareTripleChecker+Valid, 3527 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:53:55,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9729 Valid, 3527 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:53:55,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2025-01-09 05:53:55,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 2400. [2025-01-09 05:53:55,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2400 states, 2398 states have (on average 1.5713094245204338) internal successors, (3768), 2399 states have internal predecessors, (3768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:55,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3768 transitions. [2025-01-09 05:53:55,955 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3768 transitions. Word has length 65 [2025-01-09 05:53:55,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:55,956 INFO L471 AbstractCegarLoop]: Abstraction has 2400 states and 3768 transitions. [2025-01-09 05:53:55,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:55,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3768 transitions. [2025-01-09 05:53:55,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:53:55,957 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:55,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:53:55,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:53:55,957 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:55,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:55,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1822789277, now seen corresponding path program 1 times [2025-01-09 05:53:55,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:55,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473044821] [2025-01-09 05:53:55,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:55,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:55,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:53:55,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:53:55,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:55,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:53:56,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:56,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473044821] [2025-01-09 05:53:56,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473044821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:56,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:56,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:53:56,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967325401] [2025-01-09 05:53:56,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:56,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:53:56,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:56,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:53:56,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:53:56,023 INFO L87 Difference]: Start difference. First operand 2400 states and 3768 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:56,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:56,051 INFO L93 Difference]: Finished difference Result 2585 states and 4063 transitions. [2025-01-09 05:53:56,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:53:56,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 05:53:56,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:56,058 INFO L225 Difference]: With dead ends: 2585 [2025-01-09 05:53:56,058 INFO L226 Difference]: Without dead ends: 2487 [2025-01-09 05:53:56,059 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-01-09 05:53:56,060 INFO L435 NwaCegarLoop]: 1561 mSDtfsCounter, 1492 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1634 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-01-09 05:53:56,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1492 Valid, 1634 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:53:56,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2025-01-09 05:53:56,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2483. [2025-01-09 05:53:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2483 states, 2481 states have (on average 1.5711406690850465) internal successors, (3898), 2482 states have internal predecessors, (3898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:56,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 3898 transitions. [2025-01-09 05:53:56,096 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 3898 transitions. Word has length 67 [2025-01-09 05:53:56,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:56,096 INFO L471 AbstractCegarLoop]: Abstraction has 2483 states and 3898 transitions. [2025-01-09 05:53:56,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:56,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 3898 transitions. [2025-01-09 05:53:56,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:53:56,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:56,097 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:53:56,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:53:56,097 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:56,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:56,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1756295765, now seen corresponding path program 1 times [2025-01-09 05:53:56,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:56,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704933103] [2025-01-09 05:53:56,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:56,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:56,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:53:56,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:53:56,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:56,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:53:56,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:56,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704933103] [2025-01-09 05:53:56,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704933103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:56,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:56,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:53:56,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726097728] [2025-01-09 05:53:56,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:56,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:53:56,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:56,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:53:56,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:53:56,381 INFO L87 Difference]: Start difference. First operand 2483 states and 3898 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:56,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:56,562 INFO L93 Difference]: Finished difference Result 2666 states and 4186 transitions. [2025-01-09 05:53:56,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:53:56,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-01-09 05:53:56,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:56,570 INFO L225 Difference]: With dead ends: 2666 [2025-01-09 05:53:56,570 INFO L226 Difference]: Without dead ends: 2485 [2025-01-09 05:53:56,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-01-09 05:53:56,571 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 7515 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7515 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:53:56,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7515 Valid, 1941 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:53:56,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2025-01-09 05:53:56,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2483. [2025-01-09 05:53:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2483 states, 2481 states have (on average 1.570334542523176) internal successors, (3896), 2482 states have internal predecessors, (3896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2483 states to 2483 states and 3896 transitions. [2025-01-09 05:53:56,611 INFO L78 Accepts]: Start accepts. Automaton has 2483 states and 3896 transitions. Word has length 67 [2025-01-09 05:53:56,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:56,611 INFO L471 AbstractCegarLoop]: Abstraction has 2483 states and 3896 transitions. [2025-01-09 05:53:56,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:56,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2483 states and 3896 transitions. [2025-01-09 05:53:56,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 05:53:56,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:56,612 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:53:56,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:53:56,612 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:56,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:56,613 INFO L85 PathProgramCache]: Analyzing trace with hash 974683136, now seen corresponding path program 1 times [2025-01-09 05:53:56,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:56,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881718430] [2025-01-09 05:53:56,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:56,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:56,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 05:53:56,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 05:53:56,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:56,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:56,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:53:56,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:56,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881718430] [2025-01-09 05:53:56,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881718430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:56,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:56,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:53:56,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141467192] [2025-01-09 05:53:56,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:56,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:53:56,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:56,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:53:56,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:53:56,769 INFO L87 Difference]: Start difference. First operand 2483 states and 3896 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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-01-09 05:53:56,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:56,797 INFO L93 Difference]: Finished difference Result 2491 states and 3905 transitions. [2025-01-09 05:53:56,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:53:56,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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-01-09 05:53:56,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:56,804 INFO L225 Difference]: With dead ends: 2491 [2025-01-09 05:53:56,804 INFO L226 Difference]: Without dead ends: 2489 [2025-01-09 05:53:56,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:53:56,806 INFO L435 NwaCegarLoop]: 1562 mSDtfsCounter, 0 mSDsluCounter, 4677 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6239 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:53:56,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6239 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:53:56,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2025-01-09 05:53:56,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2489. [2025-01-09 05:53:56,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2489 states, 2487 states have (on average 1.5685564937675915) internal successors, (3901), 2488 states have internal predecessors, (3901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:56,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 3901 transitions. [2025-01-09 05:53:56,842 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 3901 transitions. Word has length 68 [2025-01-09 05:53:56,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:56,842 INFO L471 AbstractCegarLoop]: Abstraction has 2489 states and 3901 transitions. [2025-01-09 05:53:56,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 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-01-09 05:53:56,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 3901 transitions. [2025-01-09 05:53:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:53:56,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:56,844 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:53:56,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:53:56,844 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:56,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:56,844 INFO L85 PathProgramCache]: Analyzing trace with hash 523852843, now seen corresponding path program 1 times [2025-01-09 05:53:56,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:56,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684692193] [2025-01-09 05:53:56,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:56,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:56,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:53:56,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:53:56,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:56,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:53:56,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:56,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684692193] [2025-01-09 05:53:56,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684692193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:56,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:56,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:53:56,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241211634] [2025-01-09 05:53:56,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:56,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:53:56,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:56,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:53:56,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:53:56,901 INFO L87 Difference]: Start difference. First operand 2489 states and 3901 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:56,923 INFO L93 Difference]: Finished difference Result 2847 states and 4453 transitions. [2025-01-09 05:53:56,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:53:56,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 05:53:56,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:56,930 INFO L225 Difference]: With dead ends: 2847 [2025-01-09 05:53:56,931 INFO L226 Difference]: Without dead ends: 2660 [2025-01-09 05:53:56,931 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-01-09 05:53:56,932 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 1507 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1707 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-01-09 05:53:56,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1707 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:53:56,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2025-01-09 05:53:56,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2658. [2025-01-09 05:53:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2658 states, 2656 states have (on average 1.5655120481927711) internal successors, (4158), 2657 states have internal predecessors, (4158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:56,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 4158 transitions. [2025-01-09 05:53:56,972 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 4158 transitions. Word has length 69 [2025-01-09 05:53:56,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:56,972 INFO L471 AbstractCegarLoop]: Abstraction has 2658 states and 4158 transitions. [2025-01-09 05:53:56,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:56,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 4158 transitions. [2025-01-09 05:53:56,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:53:56,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:56,973 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:53:56,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:53:56,974 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:56,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:56,974 INFO L85 PathProgramCache]: Analyzing trace with hash 787709227, now seen corresponding path program 1 times [2025-01-09 05:53:56,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:56,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055404963] [2025-01-09 05:53:56,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:56,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:56,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:53:56,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:53:56,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:56,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:57,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:53:57,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:57,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055404963] [2025-01-09 05:53:57,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055404963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:57,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:57,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:53:57,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543625112] [2025-01-09 05:53:57,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:57,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:53:57,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:57,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:53:57,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:53:57,018 INFO L87 Difference]: Start difference. First operand 2658 states and 4158 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:57,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:57,043 INFO L93 Difference]: Finished difference Result 3338 states and 5196 transitions. [2025-01-09 05:53:57,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:53:57,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 05:53:57,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:57,051 INFO L225 Difference]: With dead ends: 3338 [2025-01-09 05:53:57,052 INFO L226 Difference]: Without dead ends: 2982 [2025-01-09 05:53:57,053 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-01-09 05:53:57,053 INFO L435 NwaCegarLoop]: 1620 mSDtfsCounter, 1505 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1709 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-01-09 05:53:57,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1709 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:53:57,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2025-01-09 05:53:57,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2980. [2025-01-09 05:53:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2980 states, 2978 states have (on average 1.5580926796507724) internal successors, (4640), 2979 states have internal predecessors, (4640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2980 states to 2980 states and 4640 transitions. [2025-01-09 05:53:57,098 INFO L78 Accepts]: Start accepts. Automaton has 2980 states and 4640 transitions. Word has length 69 [2025-01-09 05:53:57,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:57,098 INFO L471 AbstractCegarLoop]: Abstraction has 2980 states and 4640 transitions. [2025-01-09 05:53:57,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:57,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2980 states and 4640 transitions. [2025-01-09 05:53:57,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:53:57,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:57,099 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:53:57,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:53:57,099 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:57,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:57,100 INFO L85 PathProgramCache]: Analyzing trace with hash 2025971243, now seen corresponding path program 1 times [2025-01-09 05:53:57,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:57,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195128181] [2025-01-09 05:53:57,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:57,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:57,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:53:57,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:53:57,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:57,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:53:57,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:57,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195128181] [2025-01-09 05:53:57,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195128181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:57,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:57,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:53:57,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349614412] [2025-01-09 05:53:57,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:57,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:53:57,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:57,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:53:57,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:53:57,142 INFO L87 Difference]: Start difference. First operand 2980 states and 4640 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:57,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:57,171 INFO L93 Difference]: Finished difference Result 4272 states and 6586 transitions. [2025-01-09 05:53:57,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:53:57,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 05:53:57,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:57,181 INFO L225 Difference]: With dead ends: 4272 [2025-01-09 05:53:57,181 INFO L226 Difference]: Without dead ends: 3594 [2025-01-09 05:53:57,182 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-01-09 05:53:57,183 INFO L435 NwaCegarLoop]: 1618 mSDtfsCounter, 1503 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1711 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-01-09 05:53:57,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1711 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:53:57,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2025-01-09 05:53:57,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3592. [2025-01-09 05:53:57,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3592 states, 3590 states have (on average 1.543175487465181) internal successors, (5540), 3591 states have internal predecessors, (5540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:57,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5540 transitions. [2025-01-09 05:53:57,254 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5540 transitions. Word has length 69 [2025-01-09 05:53:57,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:57,255 INFO L471 AbstractCegarLoop]: Abstraction has 3592 states and 5540 transitions. [2025-01-09 05:53:57,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:57,255 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5540 transitions. [2025-01-09 05:53:57,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:53:57,258 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:57,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:53:57,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:53:57,258 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:57,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:57,259 INFO L85 PathProgramCache]: Analyzing trace with hash -189497557, now seen corresponding path program 1 times [2025-01-09 05:53:57,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:57,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401006141] [2025-01-09 05:53:57,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:57,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:57,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:53:57,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:53:57,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:57,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:57,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:53:57,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:57,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401006141] [2025-01-09 05:53:57,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401006141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:57,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:57,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:53:57,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292809521] [2025-01-09 05:53:57,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:57,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:53:57,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:57,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:53:57,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:53:57,306 INFO L87 Difference]: Start difference. First operand 3592 states and 5540 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:57,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:57,401 INFO L93 Difference]: Finished difference Result 6044 states and 9174 transitions. [2025-01-09 05:53:57,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:53:57,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 05:53:57,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:57,408 INFO L225 Difference]: With dead ends: 6044 [2025-01-09 05:53:57,408 INFO L226 Difference]: Without dead ends: 4754 [2025-01-09 05:53:57,409 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-01-09 05:53:57,410 INFO L435 NwaCegarLoop]: 1616 mSDtfsCounter, 1501 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1713 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-01-09 05:53:57,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1713 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:53:57,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4754 states. [2025-01-09 05:53:57,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4754 to 4752. [2025-01-09 05:53:57,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4752 states, 4750 states have (on average 1.5183157894736843) internal successors, (7212), 4751 states have internal predecessors, (7212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:57,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4752 states to 4752 states and 7212 transitions. [2025-01-09 05:53:57,515 INFO L78 Accepts]: Start accepts. Automaton has 4752 states and 7212 transitions. Word has length 69 [2025-01-09 05:53:57,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:57,515 INFO L471 AbstractCegarLoop]: Abstraction has 4752 states and 7212 transitions. [2025-01-09 05:53:57,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:57,516 INFO L276 IsEmpty]: Start isEmpty. Operand 4752 states and 7212 transitions. [2025-01-09 05:53:57,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 05:53:57,516 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:57,516 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:53:57,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:53:57,516 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:57,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:57,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1591435307, now seen corresponding path program 1 times [2025-01-09 05:53:57,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:57,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852135835] [2025-01-09 05:53:57,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:57,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:57,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 05:53:57,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 05:53:57,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:57,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:57,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:53:57,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:57,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852135835] [2025-01-09 05:53:57,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852135835] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:57,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:57,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:53:57,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459399688] [2025-01-09 05:53:57,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:57,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:53:57,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:57,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:53:57,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:53:57,565 INFO L87 Difference]: Start difference. First operand 4752 states and 7212 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:57,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:57,656 INFO L93 Difference]: Finished difference Result 9396 states and 13966 transitions. [2025-01-09 05:53:57,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:53:57,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-01-09 05:53:57,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:57,668 INFO L225 Difference]: With dead ends: 9396 [2025-01-09 05:53:57,668 INFO L226 Difference]: Without dead ends: 6946 [2025-01-09 05:53:57,672 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-01-09 05:53:57,672 INFO L435 NwaCegarLoop]: 1614 mSDtfsCounter, 1499 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1715 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-01-09 05:53:57,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 1715 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:53:57,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2025-01-09 05:53:57,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 6944. [2025-01-09 05:53:57,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6944 states, 6942 states have (on average 1.4837222702391242) internal successors, (10300), 6943 states have internal predecessors, (10300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:57,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6944 states to 6944 states and 10300 transitions. [2025-01-09 05:53:57,800 INFO L78 Accepts]: Start accepts. Automaton has 6944 states and 10300 transitions. Word has length 69 [2025-01-09 05:53:57,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:57,800 INFO L471 AbstractCegarLoop]: Abstraction has 6944 states and 10300 transitions. [2025-01-09 05:53:57,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:57,801 INFO L276 IsEmpty]: Start isEmpty. Operand 6944 states and 10300 transitions. [2025-01-09 05:53:57,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 05:53:57,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:57,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:53:57,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:53:57,802 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:57,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:57,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1172876230, now seen corresponding path program 1 times [2025-01-09 05:53:57,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:57,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380994930] [2025-01-09 05:53:57,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:57,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:57,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 05:53:57,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 05:53:57,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:57,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:57,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:53:57,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:57,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380994930] [2025-01-09 05:53:57,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380994930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:57,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:57,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:53:57,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828603667] [2025-01-09 05:53:57,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:57,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:53:57,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:57,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:53:57,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:53:57,842 INFO L87 Difference]: Start difference. First operand 6944 states and 10300 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:57,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:57,920 INFO L93 Difference]: Finished difference Result 11815 states and 17410 transitions. [2025-01-09 05:53:57,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:53:57,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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-01-09 05:53:57,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:57,936 INFO L225 Difference]: With dead ends: 11815 [2025-01-09 05:53:57,936 INFO L226 Difference]: Without dead ends: 9188 [2025-01-09 05:53:57,941 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-01-09 05:53:57,942 INFO L435 NwaCegarLoop]: 1627 mSDtfsCounter, 1506 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1708 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-01-09 05:53:57,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1708 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:53:57,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9188 states. [2025-01-09 05:53:58,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9188 to 9186. [2025-01-09 05:53:58,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9186 states, 9184 states have (on average 1.4666811846689896) internal successors, (13470), 9185 states have internal predecessors, (13470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:58,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9186 states to 9186 states and 13470 transitions. [2025-01-09 05:53:58,105 INFO L78 Accepts]: Start accepts. Automaton has 9186 states and 13470 transitions. Word has length 71 [2025-01-09 05:53:58,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:58,105 INFO L471 AbstractCegarLoop]: Abstraction has 9186 states and 13470 transitions. [2025-01-09 05:53:58,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:58,105 INFO L276 IsEmpty]: Start isEmpty. Operand 9186 states and 13470 transitions. [2025-01-09 05:53:58,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:53:58,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:58,108 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:53:58,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:53:58,108 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:58,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:58,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1167843191, now seen corresponding path program 1 times [2025-01-09 05:53:58,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:58,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219881623] [2025-01-09 05:53:58,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:58,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:58,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:53:58,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:53:58,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:58,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:58,242 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:53:58,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:58,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219881623] [2025-01-09 05:53:58,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219881623] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:58,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:58,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:53:58,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375310491] [2025-01-09 05:53:58,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:58,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:53:58,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:58,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:53:58,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:53:58,244 INFO L87 Difference]: Start difference. First operand 9186 states and 13470 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:58,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:53:58,828 INFO L93 Difference]: Finished difference Result 51920 states and 74597 transitions. [2025-01-09 05:53:58,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:53:58,829 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 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 90 [2025-01-09 05:53:58,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:53:58,906 INFO L225 Difference]: With dead ends: 51920 [2025-01-09 05:53:58,906 INFO L226 Difference]: Without dead ends: 45038 [2025-01-09 05:53:58,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:53:58,932 INFO L435 NwaCegarLoop]: 1644 mSDtfsCounter, 8053 mSDsluCounter, 2399 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8053 SdHoareTripleChecker+Valid, 4043 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:53:58,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8053 Valid, 4043 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:53:58,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45038 states. [2025-01-09 05:53:59,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45038 to 16066. [2025-01-09 05:53:59,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16066 states, 16064 states have (on average 1.4460906374501992) internal successors, (23230), 16065 states have internal predecessors, (23230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:59,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16066 states to 16066 states and 23230 transitions. [2025-01-09 05:53:59,483 INFO L78 Accepts]: Start accepts. Automaton has 16066 states and 23230 transitions. Word has length 90 [2025-01-09 05:53:59,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:53:59,483 INFO L471 AbstractCegarLoop]: Abstraction has 16066 states and 23230 transitions. [2025-01-09 05:53:59,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:53:59,484 INFO L276 IsEmpty]: Start isEmpty. Operand 16066 states and 23230 transitions. [2025-01-09 05:53:59,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:53:59,486 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:53:59,486 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:53:59,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:53:59,486 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:53:59,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:53:59,487 INFO L85 PathProgramCache]: Analyzing trace with hash -903986807, now seen corresponding path program 1 times [2025-01-09 05:53:59,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:53:59,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721145999] [2025-01-09 05:53:59,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:53:59,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:53:59,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:53:59,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:53:59,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:53:59,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:53:59,611 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 05:53:59,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:53:59,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721145999] [2025-01-09 05:53:59,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721145999] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:53:59,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:53:59,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:53:59,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267206312] [2025-01-09 05:53:59,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:53:59,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:53:59,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:53:59,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:53:59,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:53:59,612 INFO L87 Difference]: Start difference. First operand 16066 states and 23230 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:00,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:00,435 INFO L93 Difference]: Finished difference Result 58800 states and 84357 transitions. [2025-01-09 05:54:00,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:54:00,436 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 90 [2025-01-09 05:54:00,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:00,526 INFO L225 Difference]: With dead ends: 58800 [2025-01-09 05:54:00,527 INFO L226 Difference]: Without dead ends: 51918 [2025-01-09 05:54:00,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:54:00,542 INFO L435 NwaCegarLoop]: 1641 mSDtfsCounter, 8078 mSDsluCounter, 2295 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8078 SdHoareTripleChecker+Valid, 3936 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:00,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8078 Valid, 3936 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:54:00,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51918 states. [2025-01-09 05:54:01,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51918 to 26402. [2025-01-09 05:54:01,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26402 states, 26400 states have (on average 1.431439393939394) internal successors, (37790), 26401 states have internal predecessors, (37790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:01,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26402 states to 26402 states and 37790 transitions. [2025-01-09 05:54:01,410 INFO L78 Accepts]: Start accepts. Automaton has 26402 states and 37790 transitions. Word has length 90 [2025-01-09 05:54:01,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:01,411 INFO L471 AbstractCegarLoop]: Abstraction has 26402 states and 37790 transitions. [2025-01-09 05:54:01,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:01,411 INFO L276 IsEmpty]: Start isEmpty. Operand 26402 states and 37790 transitions. [2025-01-09 05:54:01,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:54:01,416 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:01,416 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:54:01,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:54:01,416 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:01,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:01,417 INFO L85 PathProgramCache]: Analyzing trace with hash 334275209, now seen corresponding path program 1 times [2025-01-09 05:54:01,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:01,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129561397] [2025-01-09 05:54:01,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:01,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:01,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:54:01,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:54:01,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:01,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:01,597 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 05:54:01,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:01,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129561397] [2025-01-09 05:54:01,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129561397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:01,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:01,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:54:01,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304916473] [2025-01-09 05:54:01,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:01,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:54:01,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:01,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:54:01,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:54:01,599 INFO L87 Difference]: Start difference. First operand 26402 states and 37790 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:02,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:02,627 INFO L93 Difference]: Finished difference Result 65680 states and 94117 transitions. [2025-01-09 05:54:02,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:54:02,627 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 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 90 [2025-01-09 05:54:02,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:02,715 INFO L225 Difference]: With dead ends: 65680 [2025-01-09 05:54:02,716 INFO L226 Difference]: Without dead ends: 58798 [2025-01-09 05:54:02,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:54:02,735 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 8119 mSDsluCounter, 2253 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8119 SdHoareTripleChecker+Valid, 3891 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:02,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8119 Valid, 3891 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:54:02,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58798 states. [2025-01-09 05:54:03,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58798 to 33282. [2025-01-09 05:54:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33282 states, 33280 states have (on average 1.4287860576923077) internal successors, (47550), 33281 states have internal predecessors, (47550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:03,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33282 states to 33282 states and 47550 transitions. [2025-01-09 05:54:03,571 INFO L78 Accepts]: Start accepts. Automaton has 33282 states and 47550 transitions. Word has length 90 [2025-01-09 05:54:03,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:03,571 INFO L471 AbstractCegarLoop]: Abstraction has 33282 states and 47550 transitions. [2025-01-09 05:54:03,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:03,571 INFO L276 IsEmpty]: Start isEmpty. Operand 33282 states and 47550 transitions. [2025-01-09 05:54:03,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:54:03,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:03,574 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:54:03,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:54:03,574 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:03,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:03,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1881193591, now seen corresponding path program 1 times [2025-01-09 05:54:03,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:03,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290214710] [2025-01-09 05:54:03,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:03,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:03,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:54:03,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:54:03,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:03,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 05:54:03,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:03,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290214710] [2025-01-09 05:54:03,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290214710] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:03,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:03,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:54:03,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492814022] [2025-01-09 05:54:03,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:03,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:54:03,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:03,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:54:03,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:54:03,702 INFO L87 Difference]: Start difference. First operand 33282 states and 47550 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:04,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:04,783 INFO L93 Difference]: Finished difference Result 72560 states and 103877 transitions. [2025-01-09 05:54:04,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:54:04,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 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 90 [2025-01-09 05:54:04,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:04,865 INFO L225 Difference]: With dead ends: 72560 [2025-01-09 05:54:04,865 INFO L226 Difference]: Without dead ends: 65678 [2025-01-09 05:54:04,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:54:04,882 INFO L435 NwaCegarLoop]: 1635 mSDtfsCounter, 8172 mSDsluCounter, 2260 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8172 SdHoareTripleChecker+Valid, 3895 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:04,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8172 Valid, 3895 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:54:04,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65678 states. [2025-01-09 05:54:06,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65678 to 40162. [2025-01-09 05:54:06,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40162 states, 40160 states have (on average 1.4270418326693226) internal successors, (57310), 40161 states have internal predecessors, (57310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40162 states to 40162 states and 57310 transitions. [2025-01-09 05:54:06,299 INFO L78 Accepts]: Start accepts. Automaton has 40162 states and 57310 transitions. Word has length 90 [2025-01-09 05:54:06,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:06,300 INFO L471 AbstractCegarLoop]: Abstraction has 40162 states and 57310 transitions. [2025-01-09 05:54:06,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:06,300 INFO L276 IsEmpty]: Start isEmpty. Operand 40162 states and 57310 transitions. [2025-01-09 05:54:06,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 05:54:06,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:06,304 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:54:06,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 05:54:06,304 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:06,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:06,305 INFO L85 PathProgramCache]: Analyzing trace with hash -100260727, now seen corresponding path program 1 times [2025-01-09 05:54:06,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:06,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033130780] [2025-01-09 05:54:06,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:06,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:06,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 05:54:06,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 05:54:06,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:06,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:06,444 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 05:54:06,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:06,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033130780] [2025-01-09 05:54:06,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033130780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:06,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:06,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:54:06,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039166957] [2025-01-09 05:54:06,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:06,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:54:06,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:06,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:54:06,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:54:06,446 INFO L87 Difference]: Start difference. First operand 40162 states and 57310 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:08,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:08,040 INFO L93 Difference]: Finished difference Result 79440 states and 113637 transitions. [2025-01-09 05:54:08,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:54:08,041 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 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 90 [2025-01-09 05:54:08,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:08,132 INFO L225 Difference]: With dead ends: 79440 [2025-01-09 05:54:08,133 INFO L226 Difference]: Without dead ends: 72558 [2025-01-09 05:54:08,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:54:08,149 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 8072 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8072 SdHoareTripleChecker+Valid, 3988 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:08,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8072 Valid, 3988 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:54:08,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72558 states. [2025-01-09 05:54:09,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72558 to 47042. [2025-01-09 05:54:09,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47042 states, 47040 states have (on average 1.4258078231292517) internal successors, (67070), 47041 states have internal predecessors, (67070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:09,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47042 states to 47042 states and 67070 transitions. [2025-01-09 05:54:09,330 INFO L78 Accepts]: Start accepts. Automaton has 47042 states and 67070 transitions. Word has length 90 [2025-01-09 05:54:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:09,330 INFO L471 AbstractCegarLoop]: Abstraction has 47042 states and 67070 transitions. [2025-01-09 05:54:09,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:09,331 INFO L276 IsEmpty]: Start isEmpty. Operand 47042 states and 67070 transitions. [2025-01-09 05:54:09,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 05:54:09,334 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:09,335 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:54:09,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 05:54:09,335 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:09,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:09,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1634924353, now seen corresponding path program 1 times [2025-01-09 05:54:09,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:09,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061525833] [2025-01-09 05:54:09,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:09,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:09,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 05:54:09,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 05:54:09,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:09,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:09,412 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:09,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:09,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061525833] [2025-01-09 05:54:09,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061525833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:09,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:09,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:09,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754185854] [2025-01-09 05:54:09,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:09,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:09,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:09,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:09,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:09,413 INFO L87 Difference]: Start difference. First operand 47042 states and 67070 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:09,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:09,886 INFO L93 Difference]: Finished difference Result 78684 states and 112439 transitions. [2025-01-09 05:54:09,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:09,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-01-09 05:54:09,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:09,927 INFO L225 Difference]: With dead ends: 78684 [2025-01-09 05:54:09,927 INFO L226 Difference]: Without dead ends: 33946 [2025-01-09 05:54:09,962 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-01-09 05:54:09,963 INFO L435 NwaCegarLoop]: 1613 mSDtfsCounter, 58 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3163 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-01-09 05:54:09,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3163 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:54:09,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33946 states. [2025-01-09 05:54:10,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33946 to 33944. [2025-01-09 05:54:10,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33944 states, 33942 states have (on average 1.4307937069117906) internal successors, (48564), 33943 states have internal predecessors, (48564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33944 states to 33944 states and 48564 transitions. [2025-01-09 05:54:10,875 INFO L78 Accepts]: Start accepts. Automaton has 33944 states and 48564 transitions. Word has length 92 [2025-01-09 05:54:10,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:10,876 INFO L471 AbstractCegarLoop]: Abstraction has 33944 states and 48564 transitions. [2025-01-09 05:54:10,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:10,876 INFO L276 IsEmpty]: Start isEmpty. Operand 33944 states and 48564 transitions. [2025-01-09 05:54:10,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 05:54:10,886 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:10,886 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:54:10,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 05:54:10,886 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:10,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:10,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1049374556, now seen corresponding path program 1 times [2025-01-09 05:54:10,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:10,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081999289] [2025-01-09 05:54:10,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:10,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:10,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 05:54:10,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 05:54:10,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:10,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:54:11,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:11,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081999289] [2025-01-09 05:54:11,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081999289] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:11,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:11,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 05:54:11,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128072492] [2025-01-09 05:54:11,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:11,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 05:54:11,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:11,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 05:54:11,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:54:11,032 INFO L87 Difference]: Start difference. First operand 33944 states and 48564 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:12,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:12,377 INFO L93 Difference]: Finished difference Result 63142 states and 90427 transitions. [2025-01-09 05:54:12,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:54:12,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 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 92 [2025-01-09 05:54:12,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:12,484 INFO L225 Difference]: With dead ends: 63142 [2025-01-09 05:54:12,485 INFO L226 Difference]: Without dead ends: 58276 [2025-01-09 05:54:12,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:54:12,509 INFO L435 NwaCegarLoop]: 1634 mSDtfsCounter, 8056 mSDsluCounter, 2580 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8056 SdHoareTripleChecker+Valid, 4214 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:12,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8056 Valid, 4214 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:54:12,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58276 states. [2025-01-09 05:54:13,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58276 to 38808. [2025-01-09 05:54:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38808 states, 38806 states have (on average 1.4295727464825028) internal successors, (55476), 38807 states have internal predecessors, (55476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:13,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38808 states to 38808 states and 55476 transitions. [2025-01-09 05:54:13,788 INFO L78 Accepts]: Start accepts. Automaton has 38808 states and 55476 transitions. Word has length 92 [2025-01-09 05:54:13,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:13,789 INFO L471 AbstractCegarLoop]: Abstraction has 38808 states and 55476 transitions. [2025-01-09 05:54:13,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:13,789 INFO L276 IsEmpty]: Start isEmpty. Operand 38808 states and 55476 transitions. [2025-01-09 05:54:13,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 05:54:13,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:13,795 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:54:13,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 05:54:13,796 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:13,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:13,796 INFO L85 PathProgramCache]: Analyzing trace with hash 73439256, now seen corresponding path program 1 times [2025-01-09 05:54:13,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:13,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146560923] [2025-01-09 05:54:13,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:13,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:13,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 05:54:13,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 05:54:13,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:13,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:13,875 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:13,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:13,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146560923] [2025-01-09 05:54:13,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146560923] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:13,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:13,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:13,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697777192] [2025-01-09 05:54:13,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:13,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:13,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:13,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:13,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:13,877 INFO L87 Difference]: Start difference. First operand 38808 states and 55476 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:14,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:14,192 INFO L93 Difference]: Finished difference Result 57052 states and 81398 transitions. [2025-01-09 05:54:14,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:14,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-01-09 05:54:14,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:14,221 INFO L225 Difference]: With dead ends: 57052 [2025-01-09 05:54:14,222 INFO L226 Difference]: Without dead ends: 20570 [2025-01-09 05:54:14,246 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-01-09 05:54:14,248 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 53 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3148 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-01-09 05:54:14,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3148 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:54:14,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20570 states. [2025-01-09 05:54:14,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20570 to 20568. [2025-01-09 05:54:14,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20568 states, 20566 states have (on average 1.4254594962559564) internal successors, (29316), 20567 states have internal predecessors, (29316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:14,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20568 states to 20568 states and 29316 transitions. [2025-01-09 05:54:14,635 INFO L78 Accepts]: Start accepts. Automaton has 20568 states and 29316 transitions. Word has length 93 [2025-01-09 05:54:14,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:14,635 INFO L471 AbstractCegarLoop]: Abstraction has 20568 states and 29316 transitions. [2025-01-09 05:54:14,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:14,635 INFO L276 IsEmpty]: Start isEmpty. Operand 20568 states and 29316 transitions. [2025-01-09 05:54:14,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 05:54:14,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:14,637 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:54:14,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 05:54:14,638 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:14,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:14,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1541447286, now seen corresponding path program 1 times [2025-01-09 05:54:14,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:14,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379382019] [2025-01-09 05:54:14,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:14,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:14,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 05:54:14,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 05:54:14,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:14,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:14,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:14,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379382019] [2025-01-09 05:54:14,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379382019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:14,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:14,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:14,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802674860] [2025-01-09 05:54:14,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:14,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:14,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:14,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:14,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:14,694 INFO L87 Difference]: Start difference. First operand 20568 states and 29316 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:14,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:14,856 INFO L93 Difference]: Finished difference Result 29692 states and 42158 transitions. [2025-01-09 05:54:14,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:14,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-01-09 05:54:14,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:14,870 INFO L225 Difference]: With dead ends: 29692 [2025-01-09 05:54:14,870 INFO L226 Difference]: Without dead ends: 11450 [2025-01-09 05:54:14,883 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-01-09 05:54:14,885 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 50 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3133 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-01-09 05:54:14,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3133 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:54:14,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11450 states. [2025-01-09 05:54:15,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11450 to 11448. [2025-01-09 05:54:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11448 states, 11446 states have (on average 1.4289708195002622) internal successors, (16356), 11447 states have internal predecessors, (16356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11448 states to 11448 states and 16356 transitions. [2025-01-09 05:54:15,084 INFO L78 Accepts]: Start accepts. Automaton has 11448 states and 16356 transitions. Word has length 95 [2025-01-09 05:54:15,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:15,084 INFO L471 AbstractCegarLoop]: Abstraction has 11448 states and 16356 transitions. [2025-01-09 05:54:15,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 11448 states and 16356 transitions. [2025-01-09 05:54:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 05:54:15,085 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:15,085 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:54:15,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 05:54:15,086 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:15,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:15,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1705365884, now seen corresponding path program 1 times [2025-01-09 05:54:15,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:15,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745743801] [2025-01-09 05:54:15,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:15,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:15,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 05:54:15,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 05:54:15,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:15,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:15,140 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:15,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:15,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745743801] [2025-01-09 05:54:15,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745743801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:15,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:15,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:15,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165807797] [2025-01-09 05:54:15,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:15,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:15,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:15,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:15,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:15,142 INFO L87 Difference]: Start difference. First operand 11448 states and 16356 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:15,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:15,261 INFO L93 Difference]: Finished difference Result 16012 states and 22718 transitions. [2025-01-09 05:54:15,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:15,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-01-09 05:54:15,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:15,270 INFO L225 Difference]: With dead ends: 16012 [2025-01-09 05:54:15,270 INFO L226 Difference]: Without dead ends: 6890 [2025-01-09 05:54:15,277 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-01-09 05:54:15,277 INFO L435 NwaCegarLoop]: 1592 mSDtfsCounter, 47 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3118 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-01-09 05:54:15,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:54:15,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6890 states. [2025-01-09 05:54:15,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6890 to 6888. [2025-01-09 05:54:15,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6888 states, 6886 states have (on average 1.4429276793494046) internal successors, (9936), 6887 states have internal predecessors, (9936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:15,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6888 states to 6888 states and 9936 transitions. [2025-01-09 05:54:15,548 INFO L78 Accepts]: Start accepts. Automaton has 6888 states and 9936 transitions. Word has length 97 [2025-01-09 05:54:15,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:15,548 INFO L471 AbstractCegarLoop]: Abstraction has 6888 states and 9936 transitions. [2025-01-09 05:54:15,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 6888 states and 9936 transitions. [2025-01-09 05:54:15,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 05:54:15,549 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:15,549 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:54:15,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 05:54:15,549 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:15,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:15,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1668745198, now seen corresponding path program 1 times [2025-01-09 05:54:15,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:15,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168688951] [2025-01-09 05:54:15,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:15,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:15,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 05:54:15,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 05:54:15,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:15,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:15,607 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:15,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:15,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168688951] [2025-01-09 05:54:15,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168688951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:15,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:15,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:15,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671777935] [2025-01-09 05:54:15,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:15,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:15,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:15,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:15,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:15,609 INFO L87 Difference]: Start difference. First operand 6888 states and 9936 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:15,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:15,662 INFO L93 Difference]: Finished difference Result 9172 states and 13088 transitions. [2025-01-09 05:54:15,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:15,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-01-09 05:54:15,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:15,668 INFO L225 Difference]: With dead ends: 9172 [2025-01-09 05:54:15,668 INFO L226 Difference]: Without dead ends: 4610 [2025-01-09 05:54:15,671 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-01-09 05:54:15,672 INFO L435 NwaCegarLoop]: 1585 mSDtfsCounter, 44 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 3103 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-01-09 05:54:15,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 3103 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:54:15,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2025-01-09 05:54:15,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 4608. [2025-01-09 05:54:15,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4608 states, 4606 states have (on average 1.4667824576639166) internal successors, (6756), 4607 states have internal predecessors, (6756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:15,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4608 states to 4608 states and 6756 transitions. [2025-01-09 05:54:15,735 INFO L78 Accepts]: Start accepts. Automaton has 4608 states and 6756 transitions. Word has length 99 [2025-01-09 05:54:15,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:15,735 INFO L471 AbstractCegarLoop]: Abstraction has 4608 states and 6756 transitions. [2025-01-09 05:54:15,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:15,735 INFO L276 IsEmpty]: Start isEmpty. Operand 4608 states and 6756 transitions. [2025-01-09 05:54:15,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 05:54:15,736 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:15,736 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:54:15,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 05:54:15,736 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:15,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:15,736 INFO L85 PathProgramCache]: Analyzing trace with hash -109173536, now seen corresponding path program 1 times [2025-01-09 05:54:15,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:15,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106870328] [2025-01-09 05:54:15,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:15,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:15,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 05:54:15,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 05:54:15,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:15,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:15,801 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:15,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:15,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106870328] [2025-01-09 05:54:15,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106870328] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:54:15,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:54:15,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:54:15,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025440622] [2025-01-09 05:54:15,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:54:15,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:54:15,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:15,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:54:15,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:54:15,803 INFO L87 Difference]: Start difference. First operand 4608 states and 6756 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:15,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:15,836 INFO L93 Difference]: Finished difference Result 5752 states and 8318 transitions. [2025-01-09 05:54:15,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:54:15,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-01-09 05:54:15,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:15,841 INFO L225 Difference]: With dead ends: 5752 [2025-01-09 05:54:15,841 INFO L226 Difference]: Without dead ends: 3470 [2025-01-09 05:54:15,843 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-01-09 05:54:15,844 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 41 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3088 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-01-09 05:54:15,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3088 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:54:15,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3470 states. [2025-01-09 05:54:15,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3470 to 3468. [2025-01-09 05:54:15,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3468 states, 3466 states have (on average 1.494806693594922) internal successors, (5181), 3467 states have internal predecessors, (5181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:15,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3468 states to 3468 states and 5181 transitions. [2025-01-09 05:54:15,885 INFO L78 Accepts]: Start accepts. Automaton has 3468 states and 5181 transitions. Word has length 101 [2025-01-09 05:54:15,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:15,885 INFO L471 AbstractCegarLoop]: Abstraction has 3468 states and 5181 transitions. [2025-01-09 05:54:15,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:15,885 INFO L276 IsEmpty]: Start isEmpty. Operand 3468 states and 5181 transitions. [2025-01-09 05:54:15,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 05:54:15,886 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:15,886 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:54:15,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 05:54:15,886 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:15,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:15,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1223800750, now seen corresponding path program 1 times [2025-01-09 05:54:15,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:15,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027387104] [2025-01-09 05:54:15,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:15,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:15,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 05:54:15,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 05:54:15,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:15,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:16,425 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:16,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:16,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027387104] [2025-01-09 05:54:16,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027387104] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:54:16,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493697574] [2025-01-09 05:54:16,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:16,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:54:16,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:54:16,429 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:54:16,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 05:54:16,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 05:54:16,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 05:54:16,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:16,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:16,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 05:54:16,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:54:17,067 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:17,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:54:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:18,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493697574] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:54:18,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:54:18,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2025-01-09 05:54:18,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729826620] [2025-01-09 05:54:18,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:54:18,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 05:54:18,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:18,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 05:54:18,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2025-01-09 05:54:18,192 INFO L87 Difference]: Start difference. First operand 3468 states and 5181 transitions. Second operand has 29 states, 29 states have (on average 9.551724137931034) internal successors, (277), 28 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:20,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:20,817 INFO L93 Difference]: Finished difference Result 9272 states and 13153 transitions. [2025-01-09 05:54:20,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-01-09 05:54:20,818 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.551724137931034) internal successors, (277), 28 states have internal predecessors, (277), 0 states have call successors, (0), 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 103 [2025-01-09 05:54:20,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:20,827 INFO L225 Difference]: With dead ends: 9272 [2025-01-09 05:54:20,827 INFO L226 Difference]: Without dead ends: 8130 [2025-01-09 05:54:20,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=947, Invalid=4023, Unknown=0, NotChecked=0, Total=4970 [2025-01-09 05:54:20,831 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 21314 mSDsluCounter, 8058 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21314 SdHoareTripleChecker+Valid, 9567 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:20,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21314 Valid, 9567 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1061 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:54:20,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8130 states. [2025-01-09 05:54:20,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8130 to 8028. [2025-01-09 05:54:20,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8028 states, 8026 states have (on average 1.4043109892848242) internal successors, (11271), 8027 states have internal predecessors, (11271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:20,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8028 states to 8028 states and 11271 transitions. [2025-01-09 05:54:20,964 INFO L78 Accepts]: Start accepts. Automaton has 8028 states and 11271 transitions. Word has length 103 [2025-01-09 05:54:20,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:20,964 INFO L471 AbstractCegarLoop]: Abstraction has 8028 states and 11271 transitions. [2025-01-09 05:54:20,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.551724137931034) internal successors, (277), 28 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:20,964 INFO L276 IsEmpty]: Start isEmpty. Operand 8028 states and 11271 transitions. [2025-01-09 05:54:20,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:54:20,966 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:20,966 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:54:20,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 05:54:21,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-09 05:54:21,167 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:21,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:21,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1381289964, now seen corresponding path program 1 times [2025-01-09 05:54:21,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:21,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315343036] [2025-01-09 05:54:21,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:21,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:21,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:54:21,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:54:21,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:21,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:22,663 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:22,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:22,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315343036] [2025-01-09 05:54:22,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315343036] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:54:22,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487675617] [2025-01-09 05:54:22,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:22,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:54:22,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:54:22,670 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:54:22,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 05:54:22,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 05:54:22,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 05:54:22,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:22,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:22,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 05:54:22,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:54:24,156 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:24,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:54:26,569 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:26,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487675617] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:54:26,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:54:26,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 16] total 39 [2025-01-09 05:54:26,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301169931] [2025-01-09 05:54:26,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:54:26,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 05:54:26,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:26,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 05:54:26,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1287, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 05:54:26,571 INFO L87 Difference]: Start difference. First operand 8028 states and 11271 transitions. Second operand has 39 states, 39 states have (on average 7.0256410256410255) internal successors, (274), 39 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:35,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:35,891 INFO L93 Difference]: Finished difference Result 43894 states and 59229 transitions. [2025-01-09 05:54:35,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-01-09 05:54:35,891 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.0256410256410255) internal successors, (274), 39 states have internal predecessors, (274), 0 states have call successors, (0), 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 104 [2025-01-09 05:54:35,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:35,929 INFO L225 Difference]: With dead ends: 43894 [2025-01-09 05:54:35,930 INFO L226 Difference]: Without dead ends: 38192 [2025-01-09 05:54:35,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4087 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=2316, Invalid=10794, Unknown=0, NotChecked=0, Total=13110 [2025-01-09 05:54:35,944 INFO L435 NwaCegarLoop]: 1511 mSDtfsCounter, 30016 mSDsluCounter, 14224 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30016 SdHoareTripleChecker+Valid, 15735 SdHoareTripleChecker+Invalid, 1818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:35,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30016 Valid, 15735 Invalid, 1818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1723 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 05:54:35,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38192 states. [2025-01-09 05:54:36,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38192 to 26794. [2025-01-09 05:54:36,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26794 states, 26792 states have (on average 1.3468572708271125) internal successors, (36085), 26793 states have internal predecessors, (36085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26794 states to 26794 states and 36085 transitions. [2025-01-09 05:54:36,692 INFO L78 Accepts]: Start accepts. Automaton has 26794 states and 36085 transitions. Word has length 104 [2025-01-09 05:54:36,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:36,692 INFO L471 AbstractCegarLoop]: Abstraction has 26794 states and 36085 transitions. [2025-01-09 05:54:36,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.0256410256410255) internal successors, (274), 39 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:36,692 INFO L276 IsEmpty]: Start isEmpty. Operand 26794 states and 36085 transitions. [2025-01-09 05:54:36,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 05:54:36,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:36,694 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:54:36,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 05:54:36,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-01-09 05:54:36,895 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:36,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:36,895 INFO L85 PathProgramCache]: Analyzing trace with hash -258056508, now seen corresponding path program 1 times [2025-01-09 05:54:36,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:36,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195393339] [2025-01-09 05:54:36,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:36,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:36,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 05:54:36,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 05:54:36,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:36,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:37,455 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:37,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:37,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195393339] [2025-01-09 05:54:37,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195393339] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:54:37,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852015516] [2025-01-09 05:54:37,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:37,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:54:37,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:54:37,458 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:54:37,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 05:54:37,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 05:54:37,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 05:54:37,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:37,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:37,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 05:54:37,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:54:38,043 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:38,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:54:38,854 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:38,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852015516] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:54:38,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:54:38,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 31 [2025-01-09 05:54:38,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081390007] [2025-01-09 05:54:38,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:54:38,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 05:54:38,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:38,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 05:54:38,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2025-01-09 05:54:38,858 INFO L87 Difference]: Start difference. First operand 26794 states and 36085 transitions. Second operand has 31 states, 31 states have (on average 9.387096774193548) internal successors, (291), 31 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:41,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:41,459 INFO L93 Difference]: Finished difference Result 78896 states and 105591 transitions. [2025-01-09 05:54:41,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-01-09 05:54:41,460 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 9.387096774193548) internal successors, (291), 31 states have internal predecessors, (291), 0 states have call successors, (0), 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 105 [2025-01-09 05:54:41,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:41,524 INFO L225 Difference]: With dead ends: 78896 [2025-01-09 05:54:41,525 INFO L226 Difference]: Without dead ends: 54564 [2025-01-09 05:54:41,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1014, Invalid=4098, Unknown=0, NotChecked=0, Total=5112 [2025-01-09 05:54:41,559 INFO L435 NwaCegarLoop]: 1534 mSDtfsCounter, 23905 mSDsluCounter, 9886 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23905 SdHoareTripleChecker+Valid, 11420 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:41,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23905 Valid, 11420 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1337 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:54:41,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54564 states. [2025-01-09 05:54:42,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54564 to 47104. [2025-01-09 05:54:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47104 states, 47102 states have (on average 1.3131714152265297) internal successors, (61853), 47103 states have internal predecessors, (61853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:42,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47104 states to 47104 states and 61853 transitions. [2025-01-09 05:54:42,961 INFO L78 Accepts]: Start accepts. Automaton has 47104 states and 61853 transitions. Word has length 105 [2025-01-09 05:54:42,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:42,961 INFO L471 AbstractCegarLoop]: Abstraction has 47104 states and 61853 transitions. [2025-01-09 05:54:42,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 9.387096774193548) internal successors, (291), 31 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:42,962 INFO L276 IsEmpty]: Start isEmpty. Operand 47104 states and 61853 transitions. [2025-01-09 05:54:42,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 05:54:42,964 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:42,965 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:54:42,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 05:54:43,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:54:43,167 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:43,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:43,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1316853708, now seen corresponding path program 1 times [2025-01-09 05:54:43,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:43,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934408466] [2025-01-09 05:54:43,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:43,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:43,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 05:54:43,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 05:54:43,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:43,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:43,435 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:43,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:43,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934408466] [2025-01-09 05:54:43,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934408466] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:54:43,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425013062] [2025-01-09 05:54:43,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:43,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:54:43,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:54:43,438 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:54:43,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 05:54:43,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 05:54:43,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 05:54:43,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:43,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:43,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 05:54:43,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:54:44,110 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:44,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:54:45,081 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:45,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425013062] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:54:45,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:54:45,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 30 [2025-01-09 05:54:45,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230128533] [2025-01-09 05:54:45,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:54:45,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 05:54:45,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:54:45,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 05:54:45,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2025-01-09 05:54:45,083 INFO L87 Difference]: Start difference. First operand 47104 states and 61853 transitions. Second operand has 30 states, 30 states have (on average 9.7) internal successors, (291), 30 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:46,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:54:46,664 INFO L93 Difference]: Finished difference Result 93318 states and 122224 transitions. [2025-01-09 05:54:46,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 05:54:46,664 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 9.7) internal successors, (291), 30 states have internal predecessors, (291), 0 states have call successors, (0), 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 107 [2025-01-09 05:54:46,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:54:46,713 INFO L225 Difference]: With dead ends: 93318 [2025-01-09 05:54:46,713 INFO L226 Difference]: Without dead ends: 48548 [2025-01-09 05:54:46,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=472, Invalid=1508, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 05:54:46,735 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 13797 mSDsluCounter, 6698 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13797 SdHoareTripleChecker+Valid, 8241 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:54:46,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13797 Valid, 8241 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:54:46,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48548 states. [2025-01-09 05:54:47,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48548 to 42784. [2025-01-09 05:54:47,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42784 states, 42782 states have (on average 1.3111355242859146) internal successors, (56093), 42783 states have internal predecessors, (56093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:47,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42784 states to 42784 states and 56093 transitions. [2025-01-09 05:54:47,940 INFO L78 Accepts]: Start accepts. Automaton has 42784 states and 56093 transitions. Word has length 107 [2025-01-09 05:54:47,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:54:47,941 INFO L471 AbstractCegarLoop]: Abstraction has 42784 states and 56093 transitions. [2025-01-09 05:54:47,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 9.7) internal successors, (291), 30 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:54:47,941 INFO L276 IsEmpty]: Start isEmpty. Operand 42784 states and 56093 transitions. [2025-01-09 05:54:47,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 05:54:47,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:54:47,944 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:54:47,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 05:54:48,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-09 05:54:48,145 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:54:48,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:54:48,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1330280972, now seen corresponding path program 1 times [2025-01-09 05:54:48,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:54:48,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886202091] [2025-01-09 05:54:48,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:48,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:54:48,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 05:54:48,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 05:54:48,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:48,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:48,926 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:48,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:54:48,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886202091] [2025-01-09 05:54:48,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886202091] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:54:48,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983368843] [2025-01-09 05:54:48,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:54:48,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:54:48,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:54:48,931 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:54:48,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 05:54:48,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 05:54:49,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 05:54:49,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:54:49,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:54:49,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-01-09 05:54:49,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:54:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:54:58,241 INFO L312 TraceCheckSpWp]: Computing backward predicates...