./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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.4_overflow.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 cbe797ede424f1ab8a64d91092275cecbbdb84c9d61e688c522ae0087e29fe1c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:48:34,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:48:34,428 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:48:34,435 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:48:34,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:48:34,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:48:34,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:48:34,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:48:34,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:48:34,467 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:48:34,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:48:34,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:48:34,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:48:34,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:48:34,468 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:48:34,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:48:34,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:48:34,469 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:48:34,469 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:48:34,469 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:48:34,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:48:34,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:48:34,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:48:34,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:48:34,470 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:48:34,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:48:34,470 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:48:34,470 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:48:34,470 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:48:34,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:48:34,470 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:48:34,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:48:34,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:48:34,470 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:48:34,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:48:34,470 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:48:34,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:48:34,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:48:34,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:48:34,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:48:34,471 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:48:34,471 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:48:34,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:48:34,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:48:34,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:48:34,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:48:34,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:48:34,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:48:34,471 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 -> cbe797ede424f1ab8a64d91092275cecbbdb84c9d61e688c522ae0087e29fe1c [2025-01-09 05:48:34,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:48:34,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:48:34,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:48:34,894 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:48:34,894 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:48:34,895 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-01-09 05:48:36,231 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e4360fbf/472d11873e164492870651a734979d93/FLAG6b004a117 [2025-01-09 05:48:36,685 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:48:36,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-01-09 05:48:36,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e4360fbf/472d11873e164492870651a734979d93/FLAG6b004a117 [2025-01-09 05:48:36,734 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e4360fbf/472d11873e164492870651a734979d93 [2025-01-09 05:48:36,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:48:36,738 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:48:36,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:48:36,741 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:48:36,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:48:36,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:48:36" (1/1) ... [2025-01-09 05:48:36,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31f9c13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:48:36, skipping insertion in model container [2025-01-09 05:48:36,746 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:48:36" (1/1) ... [2025-01-09 05:48:36,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:48:37,138 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.4_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[8786,8799] [2025-01-09 05:48:37,208 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.4_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[15722,15735] [2025-01-09 05:48:37,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:48:37,722 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:48:37,748 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.4_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[8786,8799] [2025-01-09 05:48:37,756 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.4_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[15722,15735] [2025-01-09 05:48:38,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:48:38,114 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:48:38,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:48:38 WrapperNode [2025-01-09 05:48:38,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:48:38,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:48:38,119 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:48:38,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:48:38,125 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:48:38" (1/1) ... [2025-01-09 05:48:38,194 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:48:38" (1/1) ... [2025-01-09 05:48:38,484 INFO L138 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5031 [2025-01-09 05:48:38,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:48:38,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:48:38,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:48:38,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:48:38,494 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:48:38" (1/1) ... [2025-01-09 05:48:38,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:48:38" (1/1) ... [2025-01-09 05:48:38,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:48:38" (1/1) ... [2025-01-09 05:48:38,699 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:48:38,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:48:38" (1/1) ... [2025-01-09 05:48:38,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:48:38" (1/1) ... [2025-01-09 05:48:38,841 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:48:38" (1/1) ... [2025-01-09 05:48:38,865 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:48:38" (1/1) ... [2025-01-09 05:48:38,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:48:38" (1/1) ... [2025-01-09 05:48:38,939 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:48:38" (1/1) ... [2025-01-09 05:48:38,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:48:38" (1/1) ... [2025-01-09 05:48:39,028 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:48:39,030 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:48:39,031 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:48:39,031 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:48:39,032 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:48:38" (1/1) ... [2025-01-09 05:48:39,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:48:39,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:48:39,061 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:48:39,065 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:48:39,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:48:39,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:48:39,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:48:39,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:48:39,191 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:48:39,193 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:48:43,668 INFO L? ?]: Removed 739 outVars from TransFormulas that were not future-live. [2025-01-09 05:48:43,669 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:48:43,701 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:48:43,702 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 05:48:43,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:48:43 BoogieIcfgContainer [2025-01-09 05:48:43,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:48:43,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:48:43,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:48:43,712 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:48:43,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:48:36" (1/3) ... [2025-01-09 05:48:43,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2c8e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:48:43, skipping insertion in model container [2025-01-09 05:48:43,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:48:38" (2/3) ... [2025-01-09 05:48:43,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2c8e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:48:43, skipping insertion in model container [2025-01-09 05:48:43,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:48:43" (3/3) ... [2025-01-09 05:48:43,714 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-01-09 05:48:43,727 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:48:43,730 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c that has 1 procedures, 884 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:48:43,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:48:43,823 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;@52929cea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:48:43,823 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:48:43,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 884 states, 881 states have (on average 1.9046538024971622) internal successors, (1678), 883 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:43,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 05:48:43,839 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:43,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:43,840 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:43,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:43,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1605999950, now seen corresponding path program 1 times [2025-01-09 05:48:43,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:43,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019734938] [2025-01-09 05:48:43,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:43,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:43,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 05:48:43,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 05:48:43,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:43,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:44,074 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:48:44,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:44,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019734938] [2025-01-09 05:48:44,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019734938] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:48:44,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:48:44,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:48:44,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614038671] [2025-01-09 05:48:44,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:48:44,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 05:48:44,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:44,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 05:48:44,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:48:44,105 INFO L87 Difference]: Start difference. First operand has 884 states, 881 states have (on average 1.9046538024971622) internal successors, (1678), 883 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:44,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:44,181 INFO L93 Difference]: Finished difference Result 1738 states and 3301 transitions. [2025-01-09 05:48:44,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 05:48:44,183 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-09 05:48:44,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:44,200 INFO L225 Difference]: With dead ends: 1738 [2025-01-09 05:48:44,201 INFO L226 Difference]: Without dead ends: 819 [2025-01-09 05:48:44,208 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:48:44,210 INFO L435 NwaCegarLoop]: 1612 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:44,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1612 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:48:44,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-01-09 05:48:44,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2025-01-09 05:48:44,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 817 states have (on average 1.894736842105263) internal successors, (1548), 818 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:44,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1548 transitions. [2025-01-09 05:48:44,291 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1548 transitions. Word has length 22 [2025-01-09 05:48:44,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:44,292 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1548 transitions. [2025-01-09 05:48:44,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:44,293 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1548 transitions. [2025-01-09 05:48:44,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 05:48:44,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:44,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:44,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:48:44,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:44,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:44,297 INFO L85 PathProgramCache]: Analyzing trace with hash 584931596, now seen corresponding path program 1 times [2025-01-09 05:48:44,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:44,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750487871] [2025-01-09 05:48:44,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:44,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:44,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 05:48:44,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 05:48:44,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:44,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:44,538 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:48:44,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:44,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750487871] [2025-01-09 05:48:44,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750487871] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:48:44,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:48:44,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:48:44,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714161434] [2025-01-09 05:48:44,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:48:44,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:48:44,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:44,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:48:44,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:48:44,542 INFO L87 Difference]: Start difference. First operand 819 states and 1548 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:44,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:44,644 INFO L93 Difference]: Finished difference Result 859 states and 1609 transitions. [2025-01-09 05:48:44,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:48:44,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-01-09 05:48:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:44,649 INFO L225 Difference]: With dead ends: 859 [2025-01-09 05:48:44,649 INFO L226 Difference]: Without dead ends: 819 [2025-01-09 05:48:44,649 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:48:44,651 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 0 mSDsluCounter, 4610 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6156 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:44,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6156 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:48:44,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-01-09 05:48:44,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2025-01-09 05:48:44,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 817 states have (on average 1.8665850673194615) internal successors, (1525), 818 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1525 transitions. [2025-01-09 05:48:44,681 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1525 transitions. Word has length 22 [2025-01-09 05:48:44,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:44,682 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1525 transitions. [2025-01-09 05:48:44,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:44,682 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1525 transitions. [2025-01-09 05:48:44,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 05:48:44,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:44,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:44,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:48:44,685 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:44,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:44,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1015331463, now seen corresponding path program 1 times [2025-01-09 05:48:44,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:44,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799548754] [2025-01-09 05:48:44,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:44,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:44,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 05:48:44,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 05:48:44,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:44,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:44,902 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:48:44,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:44,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799548754] [2025-01-09 05:48:44,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799548754] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:48:44,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:48:44,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:48:44,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073769012] [2025-01-09 05:48:44,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:48:44,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:48:44,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:44,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:48:44,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:48:44,904 INFO L87 Difference]: Start difference. First operand 819 states and 1525 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:45,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:45,133 INFO L93 Difference]: Finished difference Result 1107 states and 1981 transitions. [2025-01-09 05:48:45,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:48:45,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-01-09 05:48:45,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:45,139 INFO L225 Difference]: With dead ends: 1107 [2025-01-09 05:48:45,139 INFO L226 Difference]: Without dead ends: 1071 [2025-01-09 05:48:45,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:48:45,141 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 6217 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6217 SdHoareTripleChecker+Valid, 2309 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:45,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6217 Valid, 2309 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:48:45,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-01-09 05:48:45,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 853. [2025-01-09 05:48:45,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 851 states have (on average 1.8554641598119859) internal successors, (1579), 852 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1579 transitions. [2025-01-09 05:48:45,174 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1579 transitions. Word has length 44 [2025-01-09 05:48:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:45,174 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1579 transitions. [2025-01-09 05:48:45,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:45,175 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1579 transitions. [2025-01-09 05:48:45,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 05:48:45,177 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:45,178 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:45,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:48:45,178 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:45,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:45,179 INFO L85 PathProgramCache]: Analyzing trace with hash -639739561, now seen corresponding path program 1 times [2025-01-09 05:48:45,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:45,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594717654] [2025-01-09 05:48:45,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:45,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:45,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 05:48:45,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 05:48:45,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:45,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:45,307 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:48:45,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:45,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594717654] [2025-01-09 05:48:45,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594717654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:48:45,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:48:45,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:48:45,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978748339] [2025-01-09 05:48:45,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:48:45,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:48:45,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:45,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:48:45,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:48:45,309 INFO L87 Difference]: Start difference. First operand 853 states and 1579 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:45,354 INFO L93 Difference]: Finished difference Result 982 states and 1782 transitions. [2025-01-09 05:48:45,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:48:45,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-01-09 05:48:45,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:45,360 INFO L225 Difference]: With dead ends: 982 [2025-01-09 05:48:45,361 INFO L226 Difference]: Without dead ends: 912 [2025-01-09 05:48:45,361 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:48:45,362 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:45,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1575 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:48:45,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-01-09 05:48:45,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 910. [2025-01-09 05:48:45,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 908 states have (on average 1.8359030837004404) internal successors, (1667), 909 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:45,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1667 transitions. [2025-01-09 05:48:45,397 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1667 transitions. Word has length 46 [2025-01-09 05:48:45,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:45,398 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1667 transitions. [2025-01-09 05:48:45,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:45,398 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1667 transitions. [2025-01-09 05:48:45,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 05:48:45,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:45,401 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:45,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:48:45,402 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:45,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:45,402 INFO L85 PathProgramCache]: Analyzing trace with hash -573246049, now seen corresponding path program 1 times [2025-01-09 05:48:45,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:45,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961288287] [2025-01-09 05:48:45,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:45,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:45,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 05:48:45,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 05:48:45,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:45,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:45,749 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:48:45,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:45,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961288287] [2025-01-09 05:48:45,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961288287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:48:45,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:48:45,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:48:45,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150356684] [2025-01-09 05:48:45,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:48:45,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:48:45,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:45,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:48:45,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:48:45,752 INFO L87 Difference]: Start difference. First operand 910 states and 1667 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:45,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:45,878 INFO L93 Difference]: Finished difference Result 1039 states and 1867 transitions. [2025-01-09 05:48:45,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:48:45,878 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-01-09 05:48:45,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:45,883 INFO L225 Difference]: With dead ends: 1039 [2025-01-09 05:48:45,883 INFO L226 Difference]: Without dead ends: 912 [2025-01-09 05:48:45,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 05:48:45,884 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 2968 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2968 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:45,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2968 Valid, 1681 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:48:45,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-01-09 05:48:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 910. [2025-01-09 05:48:45,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 908 states have (on average 1.8337004405286343) internal successors, (1665), 909 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1665 transitions. [2025-01-09 05:48:45,910 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1665 transitions. Word has length 46 [2025-01-09 05:48:45,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:45,910 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1665 transitions. [2025-01-09 05:48:45,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:45,911 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1665 transitions. [2025-01-09 05:48:45,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 05:48:45,912 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:45,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:45,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:48:45,912 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:45,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:45,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1005481493, now seen corresponding path program 1 times [2025-01-09 05:48:45,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:45,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76533592] [2025-01-09 05:48:45,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:45,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:45,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 05:48:45,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 05:48:45,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:45,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:46,137 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:48:46,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:46,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76533592] [2025-01-09 05:48:46,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76533592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:48:46,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:48:46,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:48:46,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93529256] [2025-01-09 05:48:46,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:48:46,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:48:46,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:46,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:48:46,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:48:46,140 INFO L87 Difference]: Start difference. First operand 910 states and 1665 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:46,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:46,181 INFO L93 Difference]: Finished difference Result 918 states and 1674 transitions. [2025-01-09 05:48:46,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:48:46,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-01-09 05:48:46,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:46,186 INFO L225 Difference]: With dead ends: 918 [2025-01-09 05:48:46,186 INFO L226 Difference]: Without dead ends: 916 [2025-01-09 05:48:46,186 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:48:46,187 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 0 mSDsluCounter, 4557 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6079 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:46,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6079 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:48:46,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2025-01-09 05:48:46,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 916. [2025-01-09 05:48:46,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 914 states have (on average 1.8271334792122538) internal successors, (1670), 915 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:46,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1670 transitions. [2025-01-09 05:48:46,215 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1670 transitions. Word has length 47 [2025-01-09 05:48:46,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:46,217 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1670 transitions. [2025-01-09 05:48:46,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:46,217 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1670 transitions. [2025-01-09 05:48:46,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:48:46,218 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:46,218 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:46,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:48:46,219 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:46,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:46,220 INFO L85 PathProgramCache]: Analyzing trace with hash -467852289, now seen corresponding path program 1 times [2025-01-09 05:48:46,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:46,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544075419] [2025-01-09 05:48:46,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:46,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:46,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:48:46,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:48:46,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:46,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:46,292 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:48:46,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:46,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544075419] [2025-01-09 05:48:46,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544075419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:48:46,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:48:46,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:48:46,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613872549] [2025-01-09 05:48:46,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:48:46,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:48:46,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:46,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:48:46,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:48:46,293 INFO L87 Difference]: Start difference. First operand 916 states and 1670 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:46,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:46,319 INFO L93 Difference]: Finished difference Result 1062 states and 1891 transitions. [2025-01-09 05:48:46,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:48:46,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-01-09 05:48:46,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:46,324 INFO L225 Difference]: With dead ends: 1062 [2025-01-09 05:48:46,324 INFO L226 Difference]: Without dead ends: 986 [2025-01-09 05:48:46,325 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:48:46,325 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 1486 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:46,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1625 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:48:46,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2025-01-09 05:48:46,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2025-01-09 05:48:46,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 982 states have (on average 1.8034623217922607) internal successors, (1771), 983 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:46,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1771 transitions. [2025-01-09 05:48:46,348 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1771 transitions. Word has length 48 [2025-01-09 05:48:46,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:46,348 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1771 transitions. [2025-01-09 05:48:46,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:46,348 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1771 transitions. [2025-01-09 05:48:46,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:48:46,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:46,350 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:46,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:48:46,350 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:46,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:46,350 INFO L85 PathProgramCache]: Analyzing trace with hash 770409727, now seen corresponding path program 1 times [2025-01-09 05:48:46,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:46,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367781638] [2025-01-09 05:48:46,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:46,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:46,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:48:46,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:48:46,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:46,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:46,427 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:48:46,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:46,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367781638] [2025-01-09 05:48:46,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367781638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:48:46,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:48:46,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:48:46,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197058716] [2025-01-09 05:48:46,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:48:46,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:48:46,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:46,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:48:46,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:48:46,429 INFO L87 Difference]: Start difference. First operand 984 states and 1771 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:46,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:46,454 INFO L93 Difference]: Finished difference Result 1358 states and 2331 transitions. [2025-01-09 05:48:46,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:48:46,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-01-09 05:48:46,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:46,461 INFO L225 Difference]: With dead ends: 1358 [2025-01-09 05:48:46,461 INFO L226 Difference]: Without dead ends: 1159 [2025-01-09 05:48:46,461 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:48:46,462 INFO L435 NwaCegarLoop]: 1569 mSDtfsCounter, 1484 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:46,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1631 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:48:46,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-01-09 05:48:46,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1157. [2025-01-09 05:48:46,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1155 states have (on average 1.7515151515151515) internal successors, (2023), 1156 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:46,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 2023 transitions. [2025-01-09 05:48:46,490 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 2023 transitions. Word has length 48 [2025-01-09 05:48:46,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:46,490 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 2023 transitions. [2025-01-09 05:48:46,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:46,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 2023 transitions. [2025-01-09 05:48:46,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:48:46,491 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:46,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:46,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:48:46,492 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:46,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:46,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1445059073, now seen corresponding path program 1 times [2025-01-09 05:48:46,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:46,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259217455] [2025-01-09 05:48:46,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:46,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:46,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:48:46,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:48:46,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:46,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:46,561 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:48:46,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:46,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259217455] [2025-01-09 05:48:46,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259217455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:48:46,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:48:46,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:48:46,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443473292] [2025-01-09 05:48:46,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:48:46,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:48:46,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:46,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:48:46,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:48:46,564 INFO L87 Difference]: Start difference. First operand 1157 states and 2023 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:46,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:46,596 INFO L93 Difference]: Finished difference Result 1853 states and 3045 transitions. [2025-01-09 05:48:46,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:48:46,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-01-09 05:48:46,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:46,604 INFO L225 Difference]: With dead ends: 1853 [2025-01-09 05:48:46,604 INFO L226 Difference]: Without dead ends: 1481 [2025-01-09 05:48:46,605 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:48:46,607 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 1482 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:46,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 1633 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:48:46,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2025-01-09 05:48:46,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1479. [2025-01-09 05:48:46,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 1477 states have (on average 1.6784021665538253) internal successors, (2479), 1478 states have internal predecessors, (2479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:46,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 2479 transitions. [2025-01-09 05:48:46,643 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 2479 transitions. Word has length 48 [2025-01-09 05:48:46,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:46,643 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 2479 transitions. [2025-01-09 05:48:46,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:46,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 2479 transitions. [2025-01-09 05:48:46,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:48:46,643 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:46,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:46,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:48:46,644 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:46,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:46,644 INFO L85 PathProgramCache]: Analyzing trace with hash 335873791, now seen corresponding path program 1 times [2025-01-09 05:48:46,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:46,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819079740] [2025-01-09 05:48:46,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:46,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:46,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:48:46,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:48:46,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:46,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:46,707 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:48:46,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:46,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819079740] [2025-01-09 05:48:46,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819079740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:48:46,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:48:46,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:48:46,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770659874] [2025-01-09 05:48:46,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:48:46,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:48:46,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:46,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:48:46,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:48:46,708 INFO L87 Difference]: Start difference. First operand 1479 states and 2479 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:46,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:46,751 INFO L93 Difference]: Finished difference Result 2771 states and 4329 transitions. [2025-01-09 05:48:46,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:48:46,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-01-09 05:48:46,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:46,759 INFO L225 Difference]: With dead ends: 2771 [2025-01-09 05:48:46,759 INFO L226 Difference]: Without dead ends: 2077 [2025-01-09 05:48:46,760 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:48:46,761 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 1480 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:46,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1635 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:48:46,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2025-01-09 05:48:46,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 2075. [2025-01-09 05:48:46,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2075 states, 2073 states have (on average 1.5894838398456343) internal successors, (3295), 2074 states have internal predecessors, (3295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:46,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 3295 transitions. [2025-01-09 05:48:46,817 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 3295 transitions. Word has length 48 [2025-01-09 05:48:46,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:46,817 INFO L471 AbstractCegarLoop]: Abstraction has 2075 states and 3295 transitions. [2025-01-09 05:48:46,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:46,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 3295 transitions. [2025-01-09 05:48:46,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 05:48:46,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:46,818 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:48:46,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:48:46,819 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:46,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:46,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1120436896, now seen corresponding path program 1 times [2025-01-09 05:48:46,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:46,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263099319] [2025-01-09 05:48:46,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:46,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:46,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 05:48:46,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 05:48:46,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:46,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:46,962 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:48:46,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:46,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263099319] [2025-01-09 05:48:46,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263099319] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:48:46,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:48:46,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:48:46,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150507645] [2025-01-09 05:48:46,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:48:46,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:48:46,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:46,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:48:46,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:48:46,964 INFO L87 Difference]: Start difference. First operand 2075 states and 3295 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:52,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:52,679 INFO L93 Difference]: Finished difference Result 4330 states and 7604 transitions. [2025-01-09 05:48:52,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:48:52,680 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:48:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:52,691 INFO L225 Difference]: With dead ends: 4330 [2025-01-09 05:48:52,691 INFO L226 Difference]: Without dead ends: 3577 [2025-01-09 05:48:52,693 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:48:52,694 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 2371 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5154 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2371 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 6399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 5154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:52,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2371 Valid, 797 Invalid, 6399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 5154 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-01-09 05:48:52,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3577 states. [2025-01-09 05:48:52,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3577 to 3577. [2025-01-09 05:48:52,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3577 states, 3575 states have (on average 1.4744055944055945) internal successors, (5271), 3576 states have internal predecessors, (5271), 0 states have call successors, (0), 0 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:48:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 5271 transitions. [2025-01-09 05:48:52,772 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 5271 transitions. Word has length 60 [2025-01-09 05:48:52,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:52,772 INFO L471 AbstractCegarLoop]: Abstraction has 3577 states and 5271 transitions. [2025-01-09 05:48:52,773 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:48:52,773 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 5271 transitions. [2025-01-09 05:48:52,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:48:52,775 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:52,775 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:52,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:48:52,776 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:52,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:52,776 INFO L85 PathProgramCache]: Analyzing trace with hash -161363137, now seen corresponding path program 1 times [2025-01-09 05:48:52,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:52,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315285158] [2025-01-09 05:48:52,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:52,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:52,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:48:52,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:48:52,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:52,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:48:52,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:52,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315285158] [2025-01-09 05:48:52,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315285158] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:48:52,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:48:52,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:48:52,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993982292] [2025-01-09 05:48:52,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:48:52,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:48:52,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:52,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:48:52,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:48:52,914 INFO L87 Difference]: Start difference. First operand 3577 states and 5271 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:53,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:53,097 INFO L93 Difference]: Finished difference Result 8667 states and 12460 transitions. [2025-01-09 05:48:53,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:48:53,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 05:48:53,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:53,122 INFO L225 Difference]: With dead ends: 8667 [2025-01-09 05:48:53,122 INFO L226 Difference]: Without dead ends: 7737 [2025-01-09 05:48:53,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:48:53,127 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 4645 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4645 SdHoareTripleChecker+Valid, 3389 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:53,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4645 Valid, 3389 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:48:53,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7737 states. [2025-01-09 05:48:53,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7737 to 4689. [2025-01-09 05:48:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4689 states, 4687 states have (on average 1.4557286110518455) internal successors, (6823), 4688 states have internal predecessors, (6823), 0 states have call successors, (0), 0 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:48:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4689 states to 4689 states and 6823 transitions. [2025-01-09 05:48:53,272 INFO L78 Accepts]: Start accepts. Automaton has 4689 states and 6823 transitions. Word has length 65 [2025-01-09 05:48:53,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:53,273 INFO L471 AbstractCegarLoop]: Abstraction has 4689 states and 6823 transitions. [2025-01-09 05:48:53,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:53,273 INFO L276 IsEmpty]: Start isEmpty. Operand 4689 states and 6823 transitions. [2025-01-09 05:48:53,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:48:53,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:53,275 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:53,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:48:53,275 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:53,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:53,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1076898879, now seen corresponding path program 1 times [2025-01-09 05:48:53,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:53,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078658877] [2025-01-09 05:48:53,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:53,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:53,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:48:53,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:48:53,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:53,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:53,393 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 05:48:53,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:53,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078658877] [2025-01-09 05:48:53,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078658877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:48:53,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:48:53,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:48:53,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909659522] [2025-01-09 05:48:53,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:48:53,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:48:53,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:53,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:48:53,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:48:53,395 INFO L87 Difference]: Start difference. First operand 4689 states and 6823 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:53,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:53,593 INFO L93 Difference]: Finished difference Result 9955 states and 14268 transitions. [2025-01-09 05:48:53,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:48:53,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 05:48:53,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:53,628 INFO L225 Difference]: With dead ends: 9955 [2025-01-09 05:48:53,631 INFO L226 Difference]: Without dead ends: 8665 [2025-01-09 05:48:53,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:48:53,637 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 4649 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4649 SdHoareTripleChecker+Valid, 3351 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:53,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4649 Valid, 3351 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:48:53,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8665 states. [2025-01-09 05:48:53,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8665 to 6441. [2025-01-09 05:48:53,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6441 states, 6439 states have (on average 1.4385774188538594) internal successors, (9263), 6440 states have internal predecessors, (9263), 0 states have call successors, (0), 0 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:48:53,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6441 states to 6441 states and 9263 transitions. [2025-01-09 05:48:53,821 INFO L78 Accepts]: Start accepts. Automaton has 6441 states and 9263 transitions. Word has length 65 [2025-01-09 05:48:53,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:53,821 INFO L471 AbstractCegarLoop]: Abstraction has 6441 states and 9263 transitions. [2025-01-09 05:48:53,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:53,821 INFO L276 IsEmpty]: Start isEmpty. Operand 6441 states and 9263 transitions. [2025-01-09 05:48:53,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:48:53,823 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:53,823 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:53,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:48:53,823 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:53,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:53,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1138569921, now seen corresponding path program 1 times [2025-01-09 05:48:53,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:53,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215313676] [2025-01-09 05:48:53,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:53,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:53,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:48:53,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:48:53,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:53,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:53,974 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 05:48:53,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:53,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215313676] [2025-01-09 05:48:53,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215313676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:48:53,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:48:53,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:48:53,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303826451] [2025-01-09 05:48:53,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:48:53,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:48:53,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:53,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:48:53,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:48:53,977 INFO L87 Difference]: Start difference. First operand 6441 states and 9263 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:54,190 INFO L93 Difference]: Finished difference Result 11243 states and 16068 transitions. [2025-01-09 05:48:54,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:48:54,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 05:48:54,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:54,213 INFO L225 Difference]: With dead ends: 11243 [2025-01-09 05:48:54,213 INFO L226 Difference]: Without dead ends: 9953 [2025-01-09 05:48:54,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:48:54,219 INFO L435 NwaCegarLoop]: 1574 mSDtfsCounter, 4669 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4669 SdHoareTripleChecker+Valid, 3349 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:54,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4669 Valid, 3349 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:48:54,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9953 states. [2025-01-09 05:48:54,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9953 to 7729. [2025-01-09 05:48:54,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7729 states, 7727 states have (on average 1.431732884690048) internal successors, (11063), 7728 states have internal predecessors, (11063), 0 states have call successors, (0), 0 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:48:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7729 states to 7729 states and 11063 transitions. [2025-01-09 05:48:54,406 INFO L78 Accepts]: Start accepts. Automaton has 7729 states and 11063 transitions. Word has length 65 [2025-01-09 05:48:54,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:54,406 INFO L471 AbstractCegarLoop]: Abstraction has 7729 states and 11063 transitions. [2025-01-09 05:48:54,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:54,407 INFO L276 IsEmpty]: Start isEmpty. Operand 7729 states and 11063 transitions. [2025-01-09 05:48:54,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:48:54,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:54,409 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:54,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:48:54,409 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:54,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:54,410 INFO L85 PathProgramCache]: Analyzing trace with hash 642362943, now seen corresponding path program 1 times [2025-01-09 05:48:54,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:54,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687013168] [2025-01-09 05:48:54,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:54,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:54,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:48:54,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:48:54,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:54,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:54,523 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 05:48:54,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:54,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687013168] [2025-01-09 05:48:54,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687013168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:48:54,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:48:54,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:48:54,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410193396] [2025-01-09 05:48:54,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:48:54,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:48:54,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:54,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:48:54,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:48:54,525 INFO L87 Difference]: Start difference. First operand 7729 states and 11063 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:54,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:54,741 INFO L93 Difference]: Finished difference Result 12531 states and 17868 transitions. [2025-01-09 05:48:54,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:48:54,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-01-09 05:48:54,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:54,765 INFO L225 Difference]: With dead ends: 12531 [2025-01-09 05:48:54,766 INFO L226 Difference]: Without dead ends: 11241 [2025-01-09 05:48:54,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:48:54,772 INFO L435 NwaCegarLoop]: 1573 mSDtfsCounter, 4661 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4661 SdHoareTripleChecker+Valid, 3359 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:54,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4661 Valid, 3359 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:48:54,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11241 states. [2025-01-09 05:48:54,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11241 to 9017. [2025-01-09 05:48:54,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9017 states, 9015 states have (on average 1.4268441486411536) internal successors, (12863), 9016 states have internal predecessors, (12863), 0 states have call successors, (0), 0 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:48:54,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9017 states to 9017 states and 12863 transitions. [2025-01-09 05:48:54,974 INFO L78 Accepts]: Start accepts. Automaton has 9017 states and 12863 transitions. Word has length 65 [2025-01-09 05:48:54,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:54,975 INFO L471 AbstractCegarLoop]: Abstraction has 9017 states and 12863 transitions. [2025-01-09 05:48:54,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:54,975 INFO L276 IsEmpty]: Start isEmpty. Operand 9017 states and 12863 transitions. [2025-01-09 05:48:54,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 05:48:54,977 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:54,977 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:54,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:48:54,977 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:54,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:54,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1093101628, now seen corresponding path program 1 times [2025-01-09 05:48:54,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:54,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995271168] [2025-01-09 05:48:54,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:54,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:54,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 05:48:55,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 05:48:55,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:55,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:55,076 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:55,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:55,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995271168] [2025-01-09 05:48:55,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995271168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:48:55,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:48:55,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:48:55,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063183955] [2025-01-09 05:48:55,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:48:55,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:48:55,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:55,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:48:55,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:48:55,078 INFO L87 Difference]: Start difference. First operand 9017 states and 12863 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:55,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:55,252 INFO L93 Difference]: Finished difference Result 15749 states and 22281 transitions. [2025-01-09 05:48:55,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:48:55,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-01-09 05:48:55,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:55,272 INFO L225 Difference]: With dead ends: 15749 [2025-01-09 05:48:55,272 INFO L226 Difference]: Without dead ends: 9019 [2025-01-09 05:48:55,280 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:48:55,282 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 37 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3064 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:55,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3064 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:48:55,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9019 states. [2025-01-09 05:48:55,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9019 to 9017. [2025-01-09 05:48:55,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9017 states, 9015 states have (on average 1.4130892956184138) internal successors, (12739), 9016 states have internal predecessors, (12739), 0 states have call successors, (0), 0 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:48:55,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9017 states to 9017 states and 12739 transitions. [2025-01-09 05:48:55,470 INFO L78 Accepts]: Start accepts. Automaton has 9017 states and 12739 transitions. Word has length 66 [2025-01-09 05:48:55,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:55,471 INFO L471 AbstractCegarLoop]: Abstraction has 9017 states and 12739 transitions. [2025-01-09 05:48:55,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:55,471 INFO L276 IsEmpty]: Start isEmpty. Operand 9017 states and 12739 transitions. [2025-01-09 05:48:55,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:48:55,472 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:55,472 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:55,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:48:55,473 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:55,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:55,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1536501417, now seen corresponding path program 1 times [2025-01-09 05:48:55,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:55,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640276869] [2025-01-09 05:48:55,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:55,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:55,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:48:55,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:48:55,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:55,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:55,560 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:55,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:55,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640276869] [2025-01-09 05:48:55,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640276869] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:48:55,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:48:55,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:48:55,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864834292] [2025-01-09 05:48:55,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:48:55,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:48:55,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:55,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:48:55,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:48:55,562 INFO L87 Difference]: Start difference. First operand 9017 states and 12739 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:48:55,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:55,630 INFO L93 Difference]: Finished difference Result 11590 states and 16323 transitions. [2025-01-09 05:48:55,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:48:55,630 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:48:55,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:55,641 INFO L225 Difference]: With dead ends: 11590 [2025-01-09 05:48:55,642 INFO L226 Difference]: Without dead ends: 4860 [2025-01-09 05:48:55,649 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:48:55,650 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 31 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3061 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:55,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3061 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:48:55,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4860 states. [2025-01-09 05:48:55,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4860 to 4852. [2025-01-09 05:48:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4852 states, 4850 states have (on average 1.438762886597938) internal successors, (6978), 4851 states have internal predecessors, (6978), 0 states have call successors, (0), 0 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:48:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4852 states to 4852 states and 6978 transitions. [2025-01-09 05:48:55,731 INFO L78 Accepts]: Start accepts. Automaton has 4852 states and 6978 transitions. Word has length 67 [2025-01-09 05:48:55,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:55,732 INFO L471 AbstractCegarLoop]: Abstraction has 4852 states and 6978 transitions. [2025-01-09 05:48:55,732 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:48:55,732 INFO L276 IsEmpty]: Start isEmpty. Operand 4852 states and 6978 transitions. [2025-01-09 05:48:55,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 05:48:55,733 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:55,733 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:55,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 05:48:55,733 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:55,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:55,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1693309582, now seen corresponding path program 1 times [2025-01-09 05:48:55,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:55,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9764256] [2025-01-09 05:48:55,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:55,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:55,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 05:48:55,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 05:48:55,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:55,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:55,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:55,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9764256] [2025-01-09 05:48:55,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9764256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:48:55,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:48:55,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:48:55,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997837060] [2025-01-09 05:48:55,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:48:55,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:48:55,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:55,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:48:55,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:48:55,834 INFO L87 Difference]: Start difference. First operand 4852 states and 6978 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:55,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:55,876 INFO L93 Difference]: Finished difference Result 6132 states and 8740 transitions. [2025-01-09 05:48:55,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:48:55,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-01-09 05:48:55,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:55,884 INFO L225 Difference]: With dead ends: 6132 [2025-01-09 05:48:55,885 INFO L226 Difference]: Without dead ends: 3578 [2025-01-09 05:48:55,888 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:48:55,888 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 33 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3040 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:55,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3040 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:48:55,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3578 states. [2025-01-09 05:48:55,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3578 to 3576. [2025-01-09 05:48:55,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3576 states, 3574 states have (on average 1.4538332400671516) internal successors, (5196), 3575 states have internal predecessors, (5196), 0 states have call successors, (0), 0 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:48:55,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3576 states to 3576 states and 5196 transitions. [2025-01-09 05:48:55,938 INFO L78 Accepts]: Start accepts. Automaton has 3576 states and 5196 transitions. Word has length 68 [2025-01-09 05:48:55,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:55,939 INFO L471 AbstractCegarLoop]: Abstraction has 3576 states and 5196 transitions. [2025-01-09 05:48:55,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:55,939 INFO L276 IsEmpty]: Start isEmpty. Operand 3576 states and 5196 transitions. [2025-01-09 05:48:55,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 05:48:55,940 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:55,940 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:55,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 05:48:55,941 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:55,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:55,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2022357856, now seen corresponding path program 1 times [2025-01-09 05:48:55,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:55,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105459986] [2025-01-09 05:48:55,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:55,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:55,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 05:48:55,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 05:48:55,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:55,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:56,022 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:56,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:56,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105459986] [2025-01-09 05:48:56,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105459986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:48:56,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:48:56,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:48:56,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206016589] [2025-01-09 05:48:56,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:48:56,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:48:56,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:56,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:48:56,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:48:56,024 INFO L87 Difference]: Start difference. First operand 3576 states and 5196 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:56,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:48:56,054 INFO L93 Difference]: Finished difference Result 4218 states and 6067 transitions. [2025-01-09 05:48:56,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:48:56,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-01-09 05:48:56,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:48:56,061 INFO L225 Difference]: With dead ends: 4218 [2025-01-09 05:48:56,061 INFO L226 Difference]: Without dead ends: 2940 [2025-01-09 05:48:56,063 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:48:56,064 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 30 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3025 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:48:56,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3025 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:48:56,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2025-01-09 05:48:56,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2938. [2025-01-09 05:48:56,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2938 states, 2936 states have (on average 1.4700272479564032) internal successors, (4316), 2937 states have internal predecessors, (4316), 0 states have call successors, (0), 0 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:48:56,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2938 states and 4316 transitions. [2025-01-09 05:48:56,106 INFO L78 Accepts]: Start accepts. Automaton has 2938 states and 4316 transitions. Word has length 70 [2025-01-09 05:48:56,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:48:56,106 INFO L471 AbstractCegarLoop]: Abstraction has 2938 states and 4316 transitions. [2025-01-09 05:48:56,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:48:56,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2938 states and 4316 transitions. [2025-01-09 05:48:56,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 05:48:56,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:48:56,107 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:48:56,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 05:48:56,108 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:48:56,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:48:56,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1521538382, now seen corresponding path program 1 times [2025-01-09 05:48:56,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:48:56,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279139295] [2025-01-09 05:48:56,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:56,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:48:56,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 05:48:56,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 05:48:56,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:56,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:57,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:48:57,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279139295] [2025-01-09 05:48:57,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279139295] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:48:57,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734132855] [2025-01-09 05:48:57,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:48:57,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:48:57,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:48:57,673 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:48:57,675 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:48:57,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 05:48:57,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 05:48:57,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:48:57,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:48:57,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 05:48:57,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:48:58,137 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:58,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:48:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:48:58,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734132855] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:48:58,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:48:58,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 22 [2025-01-09 05:48:58,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999828989] [2025-01-09 05:48:58,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:48:58,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 05:48:58,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:48:58,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 05:48:58,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2025-01-09 05:48:58,442 INFO L87 Difference]: Start difference. First operand 2938 states and 4316 transitions. Second operand has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 22 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:49:03,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:03,399 INFO L93 Difference]: Finished difference Result 8619 states and 11757 transitions. [2025-01-09 05:49:03,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-01-09 05:49:03,399 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 22 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-01-09 05:49:03,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:03,415 INFO L225 Difference]: With dead ends: 8619 [2025-01-09 05:49:03,415 INFO L226 Difference]: Without dead ends: 7905 [2025-01-09 05:49:03,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4135 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1855, Invalid=9487, Unknown=0, NotChecked=0, Total=11342 [2025-01-09 05:49:03,422 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 19869 mSDsluCounter, 7779 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19869 SdHoareTripleChecker+Valid, 9292 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:49:03,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19869 Valid, 9292 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 05:49:03,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7905 states. [2025-01-09 05:49:03,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7905 to 7233. [2025-01-09 05:49:03,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7233 states, 7231 states have (on average 1.3616373945512377) internal successors, (9846), 7232 states have internal predecessors, (9846), 0 states have call successors, (0), 0 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:49:03,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7233 states to 7233 states and 9846 transitions. [2025-01-09 05:49:03,581 INFO L78 Accepts]: Start accepts. Automaton has 7233 states and 9846 transitions. Word has length 72 [2025-01-09 05:49:03,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:03,581 INFO L471 AbstractCegarLoop]: Abstraction has 7233 states and 9846 transitions. [2025-01-09 05:49:03,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.227272727272727) internal successors, (203), 22 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:49:03,581 INFO L276 IsEmpty]: Start isEmpty. Operand 7233 states and 9846 transitions. [2025-01-09 05:49:03,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 05:49:03,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:03,583 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:49:03,591 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:49:03,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:49:03,784 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:03,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:03,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1996987923, now seen corresponding path program 1 times [2025-01-09 05:49:03,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:03,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440840037] [2025-01-09 05:49:03,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:03,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:03,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 05:49:03,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 05:49:03,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:03,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:05,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:05,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440840037] [2025-01-09 05:49:05,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440840037] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:49:05,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186699639] [2025-01-09 05:49:05,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:05,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:49:05,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:49:05,290 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:49:05,291 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:49:05,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 05:49:05,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 05:49:05,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:05,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:05,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:49:05,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:49:05,837 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:05,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:49:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:06,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186699639] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:49:06,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:49:06,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2025-01-09 05:49:06,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950366203] [2025-01-09 05:49:06,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:49:06,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 05:49:06,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:06,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 05:49:06,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2025-01-09 05:49:06,459 INFO L87 Difference]: Start difference. First operand 7233 states and 9846 transitions. Second operand has 26 states, 26 states have (on average 6.730769230769231) internal successors, (175), 25 states have internal predecessors, (175), 0 states have call successors, (0), 0 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:49:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:07,061 INFO L93 Difference]: Finished difference Result 17199 states and 22820 transitions. [2025-01-09 05:49:07,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 05:49:07,061 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.730769230769231) internal successors, (175), 25 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-01-09 05:49:07,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:07,091 INFO L225 Difference]: With dead ends: 17199 [2025-01-09 05:49:07,092 INFO L226 Difference]: Without dead ends: 12513 [2025-01-09 05:49:07,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=1045, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 05:49:07,103 INFO L435 NwaCegarLoop]: 1498 mSDtfsCounter, 13875 mSDsluCounter, 4794 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13875 SdHoareTripleChecker+Valid, 6292 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:49:07,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13875 Valid, 6292 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:49:07,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12513 states. [2025-01-09 05:49:07,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12513 to 12373. [2025-01-09 05:49:07,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12373 states, 12371 states have (on average 1.318405949397785) internal successors, (16310), 12372 states have internal predecessors, (16310), 0 states have call successors, (0), 0 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:49:07,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12373 states to 12373 states and 16310 transitions. [2025-01-09 05:49:07,427 INFO L78 Accepts]: Start accepts. Automaton has 12373 states and 16310 transitions. Word has length 73 [2025-01-09 05:49:07,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:07,428 INFO L471 AbstractCegarLoop]: Abstraction has 12373 states and 16310 transitions. [2025-01-09 05:49:07,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.730769230769231) internal successors, (175), 25 states have internal predecessors, (175), 0 states have call successors, (0), 0 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:49:07,428 INFO L276 IsEmpty]: Start isEmpty. Operand 12373 states and 16310 transitions. [2025-01-09 05:49:07,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 05:49:07,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:07,431 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:49:07,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 05:49:07,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:49:07,632 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:07,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:07,633 INFO L85 PathProgramCache]: Analyzing trace with hash 515880979, now seen corresponding path program 1 times [2025-01-09 05:49:07,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:07,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866618772] [2025-01-09 05:49:07,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:07,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:07,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 05:49:07,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 05:49:07,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:07,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:08,000 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:08,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:08,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866618772] [2025-01-09 05:49:08,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866618772] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:49:08,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661511274] [2025-01-09 05:49:08,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:08,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:49:08,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:49:08,004 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:49:08,006 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:49:08,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 05:49:08,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 05:49:08,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:08,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:08,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:49:08,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:49:08,468 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:08,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:49:09,146 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:09,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661511274] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:49:09,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:49:09,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-01-09 05:49:09,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795987204] [2025-01-09 05:49:09,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:49:09,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 05:49:09,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:09,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 05:49:09,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-01-09 05:49:09,147 INFO L87 Difference]: Start difference. First operand 12373 states and 16310 transitions. Second operand has 25 states, 25 states have (on average 8.12) internal successors, (203), 24 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:49:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:10,539 INFO L93 Difference]: Finished difference Result 40107 states and 51995 transitions. [2025-01-09 05:49:10,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 05:49:10,543 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 8.12) internal successors, (203), 24 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-01-09 05:49:10,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:10,587 INFO L225 Difference]: With dead ends: 40107 [2025-01-09 05:49:10,587 INFO L226 Difference]: Without dead ends: 30151 [2025-01-09 05:49:10,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=474, Invalid=1688, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 05:49:10,606 INFO L435 NwaCegarLoop]: 1490 mSDtfsCounter, 19858 mSDsluCounter, 7726 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19858 SdHoareTripleChecker+Valid, 9216 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:49:10,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19858 Valid, 9216 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:49:10,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30151 states. [2025-01-09 05:49:11,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30151 to 29995. [2025-01-09 05:49:11,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29995 states, 29993 states have (on average 1.2808988764044944) internal successors, (38418), 29994 states have internal predecessors, (38418), 0 states have call successors, (0), 0 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:49:11,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29995 states to 29995 states and 38418 transitions. [2025-01-09 05:49:11,715 INFO L78 Accepts]: Start accepts. Automaton has 29995 states and 38418 transitions. Word has length 73 [2025-01-09 05:49:11,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:11,715 INFO L471 AbstractCegarLoop]: Abstraction has 29995 states and 38418 transitions. [2025-01-09 05:49:11,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.12) internal successors, (203), 24 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:49:11,716 INFO L276 IsEmpty]: Start isEmpty. Operand 29995 states and 38418 transitions. [2025-01-09 05:49:11,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 05:49:11,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:11,718 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:49:11,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 05:49:11,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:49:11,922 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:11,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:11,923 INFO L85 PathProgramCache]: Analyzing trace with hash 376725732, now seen corresponding path program 1 times [2025-01-09 05:49:11,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:11,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651013388] [2025-01-09 05:49:11,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:11,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:11,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 05:49:11,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 05:49:11,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:11,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:12,176 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:12,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:12,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651013388] [2025-01-09 05:49:12,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651013388] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:49:12,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638308990] [2025-01-09 05:49:12,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:12,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:49:12,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:49:12,179 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:49:12,181 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:49:12,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 05:49:12,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 05:49:12,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:12,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:12,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 05:49:12,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:49:13,083 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:13,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:49:13,784 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:13,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638308990] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:49:13,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:49:13,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 30 [2025-01-09 05:49:13,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151271421] [2025-01-09 05:49:13,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:49:13,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 05:49:13,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:13,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 05:49:13,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2025-01-09 05:49:13,787 INFO L87 Difference]: Start difference. First operand 29995 states and 38418 transitions. Second operand has 30 states, 30 states have (on average 6.4) internal successors, (192), 30 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:49:14,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:14,868 INFO L93 Difference]: Finished difference Result 57061 states and 72844 transitions. [2025-01-09 05:49:14,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 05:49:14,868 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.4) internal successors, (192), 30 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-01-09 05:49:14,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:14,902 INFO L225 Difference]: With dead ends: 57061 [2025-01-09 05:49:14,903 INFO L226 Difference]: Without dead ends: 31211 [2025-01-09 05:49:14,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=468, Invalid=1512, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 05:49:14,923 INFO L435 NwaCegarLoop]: 1513 mSDtfsCounter, 9297 mSDsluCounter, 9274 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9297 SdHoareTripleChecker+Valid, 10787 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:49:14,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9297 Valid, 10787 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:49:14,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31211 states. [2025-01-09 05:49:16,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31211 to 29935. [2025-01-09 05:49:16,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29935 states, 29933 states have (on average 1.2690007683827214) internal successors, (37985), 29934 states have internal predecessors, (37985), 0 states have call successors, (0), 0 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:49:16,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29935 states to 29935 states and 37985 transitions. [2025-01-09 05:49:16,080 INFO L78 Accepts]: Start accepts. Automaton has 29935 states and 37985 transitions. Word has length 74 [2025-01-09 05:49:16,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:16,081 INFO L471 AbstractCegarLoop]: Abstraction has 29935 states and 37985 transitions. [2025-01-09 05:49:16,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.4) internal successors, (192), 30 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:49:16,081 INFO L276 IsEmpty]: Start isEmpty. Operand 29935 states and 37985 transitions. [2025-01-09 05:49:16,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 05:49:16,082 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:16,083 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:49:16,092 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:49:16,283 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,SelfDestructingSolverStorable22 [2025-01-09 05:49:16,283 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:16,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:16,284 INFO L85 PathProgramCache]: Analyzing trace with hash -368926045, now seen corresponding path program 1 times [2025-01-09 05:49:16,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:16,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626981289] [2025-01-09 05:49:16,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:16,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:16,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:49:16,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:49:16,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:16,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:16,881 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:16,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:16,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626981289] [2025-01-09 05:49:16,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626981289] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:49:16,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129930293] [2025-01-09 05:49:16,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:16,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:49:16,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:49:16,883 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:49:16,884 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:49:16,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:49:16,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:49:16,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:16,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:16,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 05:49:16,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:49:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:19,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:49:20,728 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:20,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129930293] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:49:20,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:49:20,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 17] total 41 [2025-01-09 05:49:20,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333006956] [2025-01-09 05:49:20,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:49:20,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-09 05:49:20,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:20,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-09 05:49:20,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1427, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 05:49:20,731 INFO L87 Difference]: Start difference. First operand 29935 states and 37985 transitions. Second operand has 41 states, 41 states have (on average 4.658536585365853) internal successors, (191), 41 states have internal predecessors, (191), 0 states have call successors, (0), 0 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:49:23,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:23,277 INFO L93 Difference]: Finished difference Result 42965 states and 54275 transitions. [2025-01-09 05:49:23,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 05:49:23,277 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 4.658536585365853) internal successors, (191), 41 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-01-09 05:49:23,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:23,310 INFO L225 Difference]: With dead ends: 42965 [2025-01-09 05:49:23,310 INFO L226 Difference]: Without dead ends: 32963 [2025-01-09 05:49:23,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=819, Invalid=3213, Unknown=0, NotChecked=0, Total=4032 [2025-01-09 05:49:23,318 INFO L435 NwaCegarLoop]: 1500 mSDtfsCounter, 14214 mSDsluCounter, 20926 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14214 SdHoareTripleChecker+Valid, 22426 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:49:23,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14214 Valid, 22426 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:49:23,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32963 states. [2025-01-09 05:49:24,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32963 to 27665. [2025-01-09 05:49:24,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27665 states, 27663 states have (on average 1.2682283194158261) internal successors, (35083), 27664 states have internal predecessors, (35083), 0 states have call successors, (0), 0 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:49:24,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27665 states to 27665 states and 35083 transitions. [2025-01-09 05:49:24,271 INFO L78 Accepts]: Start accepts. Automaton has 27665 states and 35083 transitions. Word has length 75 [2025-01-09 05:49:24,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:24,272 INFO L471 AbstractCegarLoop]: Abstraction has 27665 states and 35083 transitions. [2025-01-09 05:49:24,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.658536585365853) internal successors, (191), 41 states have internal predecessors, (191), 0 states have call successors, (0), 0 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:49:24,272 INFO L276 IsEmpty]: Start isEmpty. Operand 27665 states and 35083 transitions. [2025-01-09 05:49:24,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 05:49:24,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:24,274 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:49:24,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 05:49:24,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-09 05:49:24,479 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:24,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:24,480 INFO L85 PathProgramCache]: Analyzing trace with hash -2123169409, now seen corresponding path program 1 times [2025-01-09 05:49:24,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:24,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448654139] [2025-01-09 05:49:24,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:24,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:24,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:49:24,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:49:24,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:24,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:25,118 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:25,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:25,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448654139] [2025-01-09 05:49:25,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448654139] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:49:25,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240578051] [2025-01-09 05:49:25,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:25,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:49:25,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:49:25,121 INFO L229 MonitoredProcess]: Starting monitored process 7 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:49:25,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 05:49:25,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:49:25,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:49:25,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:25,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:25,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 05:49:25,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:49:25,897 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:25,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:49:26,692 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:26,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240578051] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:49:26,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:49:26,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2025-01-09 05:49:26,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378256900] [2025-01-09 05:49:26,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:49:26,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-09 05:49:26,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:49:26,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-09 05:49:26,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1142, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 05:49:26,695 INFO L87 Difference]: Start difference. First operand 27665 states and 35083 transitions. Second operand has 36 states, 36 states have (on average 5.5) internal successors, (198), 36 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:49:37,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:49:37,065 INFO L93 Difference]: Finished difference Result 75405 states and 95013 transitions. [2025-01-09 05:49:37,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2025-01-09 05:49:37,066 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.5) internal successors, (198), 36 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-01-09 05:49:37,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:49:37,128 INFO L225 Difference]: With dead ends: 75405 [2025-01-09 05:49:37,129 INFO L226 Difference]: Without dead ends: 60723 [2025-01-09 05:49:37,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8669 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=4417, Invalid=19453, Unknown=0, NotChecked=0, Total=23870 [2025-01-09 05:49:37,144 INFO L435 NwaCegarLoop]: 1515 mSDtfsCounter, 19460 mSDsluCounter, 21573 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19460 SdHoareTripleChecker+Valid, 23088 SdHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:49:37,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19460 Valid, 23088 Invalid, 2386 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [93 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 05:49:37,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60723 states. [2025-01-09 05:49:37,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60723 to 22888. [2025-01-09 05:49:37,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22888 states, 22886 states have (on average 1.2674123918552826) internal successors, (29006), 22887 states have internal predecessors, (29006), 0 states have call successors, (0), 0 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:49:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22888 states to 22888 states and 29006 transitions. [2025-01-09 05:49:38,019 INFO L78 Accepts]: Start accepts. Automaton has 22888 states and 29006 transitions. Word has length 75 [2025-01-09 05:49:38,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:49:38,020 INFO L471 AbstractCegarLoop]: Abstraction has 22888 states and 29006 transitions. [2025-01-09 05:49:38,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.5) internal successors, (198), 36 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 05:49:38,020 INFO L276 IsEmpty]: Start isEmpty. Operand 22888 states and 29006 transitions. [2025-01-09 05:49:38,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 05:49:38,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:49:38,021 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] [2025-01-09 05:49:38,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 05:49:38,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-09 05:49:38,223 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:49:38,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:49:38,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1728685026, now seen corresponding path program 1 times [2025-01-09 05:49:38,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:49:38,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264071936] [2025-01-09 05:49:38,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:38,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:49:38,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 05:49:38,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 05:49:38,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:38,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:40,165 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:40,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:49:40,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264071936] [2025-01-09 05:49:40,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264071936] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:49:40,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443204682] [2025-01-09 05:49:40,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:49:40,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:49:40,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:49:40,168 INFO L229 MonitoredProcess]: Starting monitored process 8 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:49:40,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 05:49:40,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 05:49:40,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 05:49:40,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:49:40,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:49:40,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-09 05:49:40,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:49:43,645 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:49:43,645 INFO L312 TraceCheckSpWp]: Computing backward predicates...