./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label01.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.ufo.BOUNDED-8.pals+Problem12_label01.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 e88e3e8aba390a13cb5a82d6fb8fb9bb13a0912ffa51b564a97f01b48e1cd0bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:46:00,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:46:00,661 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:46:00,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:46:00,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:46:00,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:46:00,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:46:00,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:46:00,692 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:46:00,692 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:46:00,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:46:00,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:46:00,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:46:00,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:46:00,693 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:46:00,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:46:00,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:46:00,693 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:46:00,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:46:00,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:46:00,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:46:00,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:46:00,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:46:00,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:46:00,694 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:46:00,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:46:00,694 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:46:00,694 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:46:00,694 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:46:00,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:46:00,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:46:00,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:46:00,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:46:00,695 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:46:00,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:46:00,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:46:00,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:46:00,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:46:00,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:46:00,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:46:00,695 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:46:00,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:46:00,695 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:46:00,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:46:00,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:46:00,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:46:00,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:46:00,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:46:00,696 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 -> e88e3e8aba390a13cb5a82d6fb8fb9bb13a0912ffa51b564a97f01b48e1cd0bb [2025-01-09 05:46:00,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:46:00,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:46:00,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:46:00,921 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:46:00,922 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:46:00,923 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label01.c [2025-01-09 05:46:02,168 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/974a03e8d/a4ebe12815ec4f9488bcb2084bc15fd9/FLAGa9ba8e9ad [2025-01-09 05:46:02,665 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:46:02,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label01.c [2025-01-09 05:46:02,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/974a03e8d/a4ebe12815ec4f9488bcb2084bc15fd9/FLAGa9ba8e9ad [2025-01-09 05:46:02,715 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/974a03e8d/a4ebe12815ec4f9488bcb2084bc15fd9 [2025-01-09 05:46:02,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:46:02,719 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:46:02,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:46:02,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:46:02,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:46:02,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:46:02" (1/1) ... [2025-01-09 05:46:02,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70260108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:02, skipping insertion in model container [2025-01-09 05:46:02,729 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:46:02" (1/1) ... [2025-01-09 05:46:02,809 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:46:03,074 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.ufo.BOUNDED-8.pals+Problem12_label01.c[8616,8629] [2025-01-09 05:46:03,121 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.ufo.BOUNDED-8.pals+Problem12_label01.c[14171,14184] [2025-01-09 05:46:03,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:46:03,559 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:46:03,584 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.ufo.BOUNDED-8.pals+Problem12_label01.c[8616,8629] [2025-01-09 05:46:03,593 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.ufo.BOUNDED-8.pals+Problem12_label01.c[14171,14184] [2025-01-09 05:46:03,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:46:03,979 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:46:03,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:03 WrapperNode [2025-01-09 05:46:03,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:46:03,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:46:03,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:46:03,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:46:03,989 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:46:03" (1/1) ... [2025-01-09 05:46:04,026 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:46:03" (1/1) ... [2025-01-09 05:46:04,298 INFO L138 Inliner]: procedures = 34, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 5033 [2025-01-09 05:46:04,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:46:04,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:46:04,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:46:04,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:46:04,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:03" (1/1) ... [2025-01-09 05:46:04,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:03" (1/1) ... [2025-01-09 05:46:04,348 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:03" (1/1) ... [2025-01-09 05:46:04,529 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:46:04,529 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:03" (1/1) ... [2025-01-09 05:46:04,529 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:03" (1/1) ... [2025-01-09 05:46:04,617 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:03" (1/1) ... [2025-01-09 05:46:04,635 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:03" (1/1) ... [2025-01-09 05:46:04,656 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:03" (1/1) ... [2025-01-09 05:46:04,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:03" (1/1) ... [2025-01-09 05:46:04,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:03" (1/1) ... [2025-01-09 05:46:04,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:46:04,751 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:46:04,751 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:46:04,751 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:46:04,752 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:03" (1/1) ... [2025-01-09 05:46:04,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:46:04,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:46:04,781 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:46:04,796 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:46:04,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:46:04,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:46:04,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:46:04,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:46:04,901 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:46:04,902 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:46:08,396 INFO L? ?]: Removed 737 outVars from TransFormulas that were not future-live. [2025-01-09 05:46:08,397 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:46:08,421 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:46:08,422 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 05:46:08,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:46:08 BoogieIcfgContainer [2025-01-09 05:46:08,422 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:46:08,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:46:08,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:46:08,427 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:46:08,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:46:02" (1/3) ... [2025-01-09 05:46:08,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27baf300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:46:08, skipping insertion in model container [2025-01-09 05:46:08,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:46:03" (2/3) ... [2025-01-09 05:46:08,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27baf300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:46:08, skipping insertion in model container [2025-01-09 05:46:08,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:46:08" (3/3) ... [2025-01-09 05:46:08,429 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label01.c [2025-01-09 05:46:08,448 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:46:08,455 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.BOUNDED-8.pals+Problem12_label01.c that has 1 procedures, 884 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-01-09 05:46:08,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:46:08,541 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;@2e25c486, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:46:08,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:46:08,547 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:46:08,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 05:46:08,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:08,552 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:46:08,553 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:08,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:08,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1605999950, now seen corresponding path program 1 times [2025-01-09 05:46:08,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:08,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688474558] [2025-01-09 05:46:08,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:08,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:08,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 05:46:08,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 05:46:08,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:08,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:08,706 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:46:08,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:08,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688474558] [2025-01-09 05:46:08,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688474558] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:08,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:08,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 05:46:08,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458347248] [2025-01-09 05:46:08,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:08,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 05:46:08,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:08,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 05:46:08,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 05:46:08,727 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:46:08,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:08,785 INFO L93 Difference]: Finished difference Result 1739 states and 3302 transitions. [2025-01-09 05:46:08,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 05:46:08,787 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:46:08,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:08,799 INFO L225 Difference]: With dead ends: 1739 [2025-01-09 05:46:08,799 INFO L226 Difference]: Without dead ends: 819 [2025-01-09 05:46:08,803 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:46:08,805 INFO L435 NwaCegarLoop]: 1614 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, 1614 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:46:08,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:46:08,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-01-09 05:46:08,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2025-01-09 05:46:08,852 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:46:08,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1548 transitions. [2025-01-09 05:46:08,858 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1548 transitions. Word has length 22 [2025-01-09 05:46:08,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:08,858 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1548 transitions. [2025-01-09 05:46:08,858 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:46:08,859 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1548 transitions. [2025-01-09 05:46:08,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 05:46:08,859 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:08,859 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:46:08,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:46:08,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:08,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:08,860 INFO L85 PathProgramCache]: Analyzing trace with hash 584931596, now seen corresponding path program 1 times [2025-01-09 05:46:08,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:08,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098682040] [2025-01-09 05:46:08,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:08,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:08,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 05:46:08,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 05:46:08,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:08,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:09,051 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:46:09,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:09,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098682040] [2025-01-09 05:46:09,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098682040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:09,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:09,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:46:09,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387282465] [2025-01-09 05:46:09,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:09,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:46:09,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:09,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:46:09,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:46:09,055 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:46:09,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:09,145 INFO L93 Difference]: Finished difference Result 895 states and 1666 transitions. [2025-01-09 05:46:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:46:09,146 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:46:09,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:09,149 INFO L225 Difference]: With dead ends: 895 [2025-01-09 05:46:09,149 INFO L226 Difference]: Without dead ends: 855 [2025-01-09 05:46:09,150 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:46:09,150 INFO L435 NwaCegarLoop]: 1544 mSDtfsCounter, 56 mSDsluCounter, 4603 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 6147 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:09,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 6147 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:46:09,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-01-09 05:46:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 819. [2025-01-09 05:46:09,168 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:46:09,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1525 transitions. [2025-01-09 05:46:09,171 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1525 transitions. Word has length 22 [2025-01-09 05:46:09,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:09,171 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1525 transitions. [2025-01-09 05:46:09,171 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:46:09,171 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1525 transitions. [2025-01-09 05:46:09,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 05:46:09,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:09,172 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:46:09,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:46:09,172 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:09,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:09,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1015331463, now seen corresponding path program 1 times [2025-01-09 05:46:09,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:09,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040223240] [2025-01-09 05:46:09,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:09,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:09,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 05:46:09,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 05:46:09,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:09,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:09,362 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:46:09,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:09,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040223240] [2025-01-09 05:46:09,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040223240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:09,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:09,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:46:09,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510783040] [2025-01-09 05:46:09,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:09,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:46:09,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:09,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:46:09,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:46:09,365 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:46:09,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:09,534 INFO L93 Difference]: Finished difference Result 1107 states and 1981 transitions. [2025-01-09 05:46:09,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:46:09,535 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:46:09,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:09,539 INFO L225 Difference]: With dead ends: 1107 [2025-01-09 05:46:09,539 INFO L226 Difference]: Without dead ends: 1071 [2025-01-09 05:46:09,540 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:46:09,542 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:46:09,543 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:46:09,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-01-09 05:46:09,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 853. [2025-01-09 05:46:09,564 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:46:09,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1579 transitions. [2025-01-09 05:46:09,568 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1579 transitions. Word has length 44 [2025-01-09 05:46:09,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:09,568 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1579 transitions. [2025-01-09 05:46:09,568 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:46:09,568 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1579 transitions. [2025-01-09 05:46:09,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 05:46:09,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:09,572 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:46:09,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:46:09,573 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:09,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:09,575 INFO L85 PathProgramCache]: Analyzing trace with hash -639739561, now seen corresponding path program 1 times [2025-01-09 05:46:09,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:09,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17151337] [2025-01-09 05:46:09,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:09,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:09,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 05:46:09,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 05:46:09,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:09,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:09,660 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:46:09,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:09,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17151337] [2025-01-09 05:46:09,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17151337] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:09,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:09,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:46:09,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145108788] [2025-01-09 05:46:09,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:09,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:46:09,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:09,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:46:09,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:46:09,661 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:46:09,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:09,689 INFO L93 Difference]: Finished difference Result 982 states and 1782 transitions. [2025-01-09 05:46:09,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:46:09,690 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:46:09,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:09,694 INFO L225 Difference]: With dead ends: 982 [2025-01-09 05:46:09,695 INFO L226 Difference]: Without dead ends: 912 [2025-01-09 05:46:09,695 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:46:09,696 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:46:09,696 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:46:09,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-01-09 05:46:09,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 910. [2025-01-09 05:46:09,725 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:46:09,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1667 transitions. [2025-01-09 05:46:09,728 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1667 transitions. Word has length 46 [2025-01-09 05:46:09,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:09,728 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1667 transitions. [2025-01-09 05:46:09,729 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:46:09,729 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1667 transitions. [2025-01-09 05:46:09,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 05:46:09,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:09,732 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:46:09,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:46:09,732 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:09,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:09,733 INFO L85 PathProgramCache]: Analyzing trace with hash -573246049, now seen corresponding path program 1 times [2025-01-09 05:46:09,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:09,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869898321] [2025-01-09 05:46:09,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:09,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:09,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 05:46:09,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 05:46:09,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:09,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:10,042 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:46:10,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:10,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869898321] [2025-01-09 05:46:10,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869898321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:10,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:10,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:46:10,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532602266] [2025-01-09 05:46:10,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:10,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:46:10,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:10,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:46:10,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:46:10,044 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:46:10,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:10,128 INFO L93 Difference]: Finished difference Result 1039 states and 1867 transitions. [2025-01-09 05:46:10,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:46:10,128 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:46:10,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:10,131 INFO L225 Difference]: With dead ends: 1039 [2025-01-09 05:46:10,132 INFO L226 Difference]: Without dead ends: 912 [2025-01-09 05:46:10,132 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:46:10,132 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 4446 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4446 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:10,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4446 Valid, 1678 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:46:10,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-01-09 05:46:10,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 910. [2025-01-09 05:46:10,145 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:46:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1665 transitions. [2025-01-09 05:46:10,147 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1665 transitions. Word has length 46 [2025-01-09 05:46:10,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:10,147 INFO L471 AbstractCegarLoop]: Abstraction has 910 states and 1665 transitions. [2025-01-09 05:46:10,148 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:46:10,148 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1665 transitions. [2025-01-09 05:46:10,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 05:46:10,148 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:10,148 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:46:10,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:46:10,148 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:10,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:10,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1005481493, now seen corresponding path program 1 times [2025-01-09 05:46:10,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:10,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825656568] [2025-01-09 05:46:10,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:10,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:10,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 05:46:10,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 05:46:10,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:10,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:10,331 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:46:10,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:10,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825656568] [2025-01-09 05:46:10,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825656568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:10,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:10,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:46:10,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902157806] [2025-01-09 05:46:10,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:10,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:46:10,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:10,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:46:10,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:46:10,334 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:46:10,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:10,374 INFO L93 Difference]: Finished difference Result 918 states and 1674 transitions. [2025-01-09 05:46:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:46:10,374 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:46:10,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:10,378 INFO L225 Difference]: With dead ends: 918 [2025-01-09 05:46:10,378 INFO L226 Difference]: Without dead ends: 916 [2025-01-09 05:46:10,378 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:46:10,379 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:46:10,380 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:46:10,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2025-01-09 05:46:10,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 916. [2025-01-09 05:46:10,395 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:46:10,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1670 transitions. [2025-01-09 05:46:10,397 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1670 transitions. Word has length 47 [2025-01-09 05:46:10,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:10,398 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1670 transitions. [2025-01-09 05:46:10,398 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:46:10,399 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1670 transitions. [2025-01-09 05:46:10,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:46:10,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:10,400 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:46:10,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:46:10,400 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:10,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:10,400 INFO L85 PathProgramCache]: Analyzing trace with hash -467852289, now seen corresponding path program 1 times [2025-01-09 05:46:10,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:10,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582843630] [2025-01-09 05:46:10,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:10,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:10,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:46:10,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:46:10,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:10,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:10,453 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:46:10,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:10,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582843630] [2025-01-09 05:46:10,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582843630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:10,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:10,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:46:10,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037725471] [2025-01-09 05:46:10,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:10,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:46:10,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:10,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:46:10,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:46:10,456 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:46:10,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:10,476 INFO L93 Difference]: Finished difference Result 1062 states and 1891 transitions. [2025-01-09 05:46:10,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:46:10,476 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:46:10,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:10,480 INFO L225 Difference]: With dead ends: 1062 [2025-01-09 05:46:10,480 INFO L226 Difference]: Without dead ends: 986 [2025-01-09 05:46:10,481 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:46:10,481 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:46:10,481 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:46:10,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2025-01-09 05:46:10,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2025-01-09 05:46:10,496 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:46:10,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1771 transitions. [2025-01-09 05:46:10,499 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1771 transitions. Word has length 48 [2025-01-09 05:46:10,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:10,500 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1771 transitions. [2025-01-09 05:46:10,500 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:46:10,500 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1771 transitions. [2025-01-09 05:46:10,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:46:10,501 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:10,501 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:46:10,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:46:10,501 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:10,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:10,501 INFO L85 PathProgramCache]: Analyzing trace with hash 770409727, now seen corresponding path program 1 times [2025-01-09 05:46:10,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:10,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767100576] [2025-01-09 05:46:10,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:10,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:10,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:46:10,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:46:10,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:10,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:10,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:46:10,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:10,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767100576] [2025-01-09 05:46:10,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767100576] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:10,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:10,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:46:10,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137521838] [2025-01-09 05:46:10,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:10,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:46:10,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:10,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:46:10,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:46:10,562 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:46:10,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:10,582 INFO L93 Difference]: Finished difference Result 1358 states and 2331 transitions. [2025-01-09 05:46:10,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:46:10,583 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:46:10,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:10,587 INFO L225 Difference]: With dead ends: 1358 [2025-01-09 05:46:10,587 INFO L226 Difference]: Without dead ends: 1159 [2025-01-09 05:46:10,587 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:46:10,588 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:46:10,588 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:46:10,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-01-09 05:46:10,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1157. [2025-01-09 05:46:10,603 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:46:10,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 2023 transitions. [2025-01-09 05:46:10,608 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 2023 transitions. Word has length 48 [2025-01-09 05:46:10,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:10,608 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 2023 transitions. [2025-01-09 05:46:10,610 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:46:10,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 2023 transitions. [2025-01-09 05:46:10,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:46:10,610 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:10,611 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:46:10,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:46:10,611 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:10,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:10,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1445059073, now seen corresponding path program 1 times [2025-01-09 05:46:10,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:10,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824308385] [2025-01-09 05:46:10,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:10,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:10,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:46:10,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:46:10,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:10,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:10,664 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:46:10,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:10,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824308385] [2025-01-09 05:46:10,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824308385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:10,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:10,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:46:10,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528635920] [2025-01-09 05:46:10,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:10,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:46:10,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:10,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:46:10,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:46:10,666 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:46:10,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:10,690 INFO L93 Difference]: Finished difference Result 1853 states and 3045 transitions. [2025-01-09 05:46:10,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:46:10,691 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:46:10,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:10,696 INFO L225 Difference]: With dead ends: 1853 [2025-01-09 05:46:10,696 INFO L226 Difference]: Without dead ends: 1481 [2025-01-09 05:46:10,697 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:46:10,700 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:46:10,700 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:46:10,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2025-01-09 05:46:10,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1479. [2025-01-09 05:46:10,723 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:46:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 2479 transitions. [2025-01-09 05:46:10,727 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 2479 transitions. Word has length 48 [2025-01-09 05:46:10,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:10,728 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 2479 transitions. [2025-01-09 05:46:10,728 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:46:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 2479 transitions. [2025-01-09 05:46:10,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:46:10,729 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:10,729 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:46:10,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:46:10,729 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:10,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:10,729 INFO L85 PathProgramCache]: Analyzing trace with hash 335873791, now seen corresponding path program 1 times [2025-01-09 05:46:10,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:10,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340795464] [2025-01-09 05:46:10,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:10,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:10,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:46:10,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:46:10,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:10,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:10,775 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:46:10,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:10,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340795464] [2025-01-09 05:46:10,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340795464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:10,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:10,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:46:10,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713632312] [2025-01-09 05:46:10,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:10,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:46:10,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:10,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:46:10,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:46:10,778 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:46:10,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:10,807 INFO L93 Difference]: Finished difference Result 2771 states and 4329 transitions. [2025-01-09 05:46:10,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:46:10,807 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:46:10,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:10,813 INFO L225 Difference]: With dead ends: 2771 [2025-01-09 05:46:10,813 INFO L226 Difference]: Without dead ends: 2077 [2025-01-09 05:46:10,816 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:46:10,817 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:46:10,817 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:46:10,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2077 states. [2025-01-09 05:46:10,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2077 to 2075. [2025-01-09 05:46:10,850 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:46:10,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 3295 transitions. [2025-01-09 05:46:10,856 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 3295 transitions. Word has length 48 [2025-01-09 05:46:10,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:10,856 INFO L471 AbstractCegarLoop]: Abstraction has 2075 states and 3295 transitions. [2025-01-09 05:46:10,856 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:46:10,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 3295 transitions. [2025-01-09 05:46:10,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 05:46:10,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:10,857 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:46:10,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:46:10,857 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:10,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:10,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1287880816, now seen corresponding path program 1 times [2025-01-09 05:46:10,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:10,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627218206] [2025-01-09 05:46:10,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:10,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:10,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 05:46:10,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 05:46:10,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:10,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:10,952 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:46:10,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:10,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627218206] [2025-01-09 05:46:10,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627218206] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:10,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:10,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:46:10,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109655756] [2025-01-09 05:46:10,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:10,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:46:10,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:10,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:46:10,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:46:10,953 INFO L87 Difference]: Start difference. First operand 2075 states and 3295 transitions. Second operand has 4 states, 4 states have (on average 12.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:46:15,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:15,737 INFO L93 Difference]: Finished difference Result 4330 states and 7604 transitions. [2025-01-09 05:46:15,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:46:15,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.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:46:15,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:15,749 INFO L225 Difference]: With dead ends: 4330 [2025-01-09 05:46:15,749 INFO L226 Difference]: Without dead ends: 3577 [2025-01-09 05:46:15,750 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:46:15,752 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 2389 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2389 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:15,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2389 Valid, 779 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-01-09 05:46:15,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3577 states. [2025-01-09 05:46:15,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3577 to 3577. [2025-01-09 05:46:15,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3577 states, 3575 states have (on average 1.513006993006993) internal successors, (5409), 3576 states have internal predecessors, (5409), 0 states have call successors, (0), 0 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:46:15,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3577 states to 3577 states and 5409 transitions. [2025-01-09 05:46:15,811 INFO L78 Accepts]: Start accepts. Automaton has 3577 states and 5409 transitions. Word has length 48 [2025-01-09 05:46:15,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:15,811 INFO L471 AbstractCegarLoop]: Abstraction has 3577 states and 5409 transitions. [2025-01-09 05:46:15,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.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:46:15,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3577 states and 5409 transitions. [2025-01-09 05:46:15,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:46:15,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:15,813 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:46:15,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:46:15,813 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:15,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:15,813 INFO L85 PathProgramCache]: Analyzing trace with hash -161363137, now seen corresponding path program 1 times [2025-01-09 05:46:15,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:15,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668801406] [2025-01-09 05:46:15,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:15,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:15,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:46:15,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:46:15,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:15,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:15,920 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:46:15,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:15,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668801406] [2025-01-09 05:46:15,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668801406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:15,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:15,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:46:15,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167743778] [2025-01-09 05:46:15,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:15,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:46:15,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:15,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:46:15,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:46:15,921 INFO L87 Difference]: Start difference. First operand 3577 states and 5409 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:46:16,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:16,045 INFO L93 Difference]: Finished difference Result 8667 states and 12598 transitions. [2025-01-09 05:46:16,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:46:16,046 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:46:16,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:16,068 INFO L225 Difference]: With dead ends: 8667 [2025-01-09 05:46:16,068 INFO L226 Difference]: Without dead ends: 7737 [2025-01-09 05:46:16,072 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:46:16,073 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 4645 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:16,073 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.0s Time] [2025-01-09 05:46:16,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7737 states. [2025-01-09 05:46:16,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7737 to 4689. [2025-01-09 05:46:16,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4689 states, 4687 states have (on average 1.4851717516535097) internal successors, (6961), 4688 states have internal predecessors, (6961), 0 states have call successors, (0), 0 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:46:16,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4689 states to 4689 states and 6961 transitions. [2025-01-09 05:46:16,178 INFO L78 Accepts]: Start accepts. Automaton has 4689 states and 6961 transitions. Word has length 65 [2025-01-09 05:46:16,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:16,178 INFO L471 AbstractCegarLoop]: Abstraction has 4689 states and 6961 transitions. [2025-01-09 05:46:16,178 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:46:16,178 INFO L276 IsEmpty]: Start isEmpty. Operand 4689 states and 6961 transitions. [2025-01-09 05:46:16,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:46:16,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:16,179 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:46:16,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:46:16,180 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:16,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:16,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1076898879, now seen corresponding path program 1 times [2025-01-09 05:46:16,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:16,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41279525] [2025-01-09 05:46:16,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:16,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:16,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:46:16,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:46:16,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:16,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:16,351 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:46:16,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:16,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41279525] [2025-01-09 05:46:16,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41279525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:16,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:16,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:46:16,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217545601] [2025-01-09 05:46:16,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:16,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:46:16,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:16,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:46:16,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:46:16,353 INFO L87 Difference]: Start difference. First operand 4689 states and 6961 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:46:16,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:16,501 INFO L93 Difference]: Finished difference Result 9955 states and 14406 transitions. [2025-01-09 05:46:16,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:46:16,501 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:46:16,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:16,529 INFO L225 Difference]: With dead ends: 9955 [2025-01-09 05:46:16,529 INFO L226 Difference]: Without dead ends: 8665 [2025-01-09 05:46:16,533 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:46:16,533 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 4647 mSDsluCounter, 1790 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4647 SdHoareTripleChecker+Valid, 3366 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:46:16,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4647 Valid, 3366 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:46:16,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8665 states. [2025-01-09 05:46:16,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8665 to 6441. [2025-01-09 05:46:16,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6441 states, 6439 states have (on average 1.4600093182171145) internal successors, (9401), 6440 states have internal predecessors, (9401), 0 states have call successors, (0), 0 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:46:16,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6441 states to 6441 states and 9401 transitions. [2025-01-09 05:46:16,796 INFO L78 Accepts]: Start accepts. Automaton has 6441 states and 9401 transitions. Word has length 65 [2025-01-09 05:46:16,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:16,796 INFO L471 AbstractCegarLoop]: Abstraction has 6441 states and 9401 transitions. [2025-01-09 05:46:16,796 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:46:16,797 INFO L276 IsEmpty]: Start isEmpty. Operand 6441 states and 9401 transitions. [2025-01-09 05:46:16,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:46:16,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:16,798 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:46:16,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 05:46:16,798 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:16,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:16,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1138569921, now seen corresponding path program 1 times [2025-01-09 05:46:16,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:16,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100921590] [2025-01-09 05:46:16,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:16,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:16,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:46:16,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:46:16,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:16,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:16,878 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:46:16,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:16,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100921590] [2025-01-09 05:46:16,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100921590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:16,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:16,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:46:16,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099130564] [2025-01-09 05:46:16,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:16,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:46:16,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:16,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:46:16,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:46:16,880 INFO L87 Difference]: Start difference. First operand 6441 states and 9401 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:46:17,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:17,138 INFO L93 Difference]: Finished difference Result 11243 states and 16206 transitions. [2025-01-09 05:46:17,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:46:17,141 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:46:17,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:17,156 INFO L225 Difference]: With dead ends: 11243 [2025-01-09 05:46:17,157 INFO L226 Difference]: Without dead ends: 9953 [2025-01-09 05:46:17,161 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:46:17,163 INFO L435 NwaCegarLoop]: 1574 mSDtfsCounter, 4671 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4671 SdHoareTripleChecker+Valid, 3336 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:17,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4671 Valid, 3336 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:46:17,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9953 states. [2025-01-09 05:46:17,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9953 to 7729. [2025-01-09 05:46:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7729 states, 7727 states have (on average 1.4495923385531253) internal successors, (11201), 7728 states have internal predecessors, (11201), 0 states have call successors, (0), 0 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:46:17,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7729 states to 7729 states and 11201 transitions. [2025-01-09 05:46:17,313 INFO L78 Accepts]: Start accepts. Automaton has 7729 states and 11201 transitions. Word has length 65 [2025-01-09 05:46:17,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:17,314 INFO L471 AbstractCegarLoop]: Abstraction has 7729 states and 11201 transitions. [2025-01-09 05:46:17,314 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:46:17,314 INFO L276 IsEmpty]: Start isEmpty. Operand 7729 states and 11201 transitions. [2025-01-09 05:46:17,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-01-09 05:46:17,315 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:17,315 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:46:17,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 05:46:17,316 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:17,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:17,316 INFO L85 PathProgramCache]: Analyzing trace with hash 642362943, now seen corresponding path program 1 times [2025-01-09 05:46:17,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:17,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86217922] [2025-01-09 05:46:17,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:17,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:17,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 05:46:17,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 05:46:17,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:17,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:17,402 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:46:17,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:17,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86217922] [2025-01-09 05:46:17,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86217922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:17,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:17,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:46:17,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317171125] [2025-01-09 05:46:17,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:17,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:46:17,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:17,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:46:17,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:46:17,404 INFO L87 Difference]: Start difference. First operand 7729 states and 11201 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:46:17,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:17,675 INFO L93 Difference]: Finished difference Result 12531 states and 18006 transitions. [2025-01-09 05:46:17,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:46:17,676 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:46:17,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:17,693 INFO L225 Difference]: With dead ends: 12531 [2025-01-09 05:46:17,694 INFO L226 Difference]: Without dead ends: 11241 [2025-01-09 05:46:17,699 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:46:17,700 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.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:17,700 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.0s Time] [2025-01-09 05:46:17,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11241 states. [2025-01-09 05:46:17,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11241 to 9017. [2025-01-09 05:46:17,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9017 states, 9015 states have (on average 1.4421519689406546) internal successors, (13001), 9016 states have internal predecessors, (13001), 0 states have call successors, (0), 0 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:46:17,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9017 states to 9017 states and 13001 transitions. [2025-01-09 05:46:17,938 INFO L78 Accepts]: Start accepts. Automaton has 9017 states and 13001 transitions. Word has length 65 [2025-01-09 05:46:17,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:17,939 INFO L471 AbstractCegarLoop]: Abstraction has 9017 states and 13001 transitions. [2025-01-09 05:46:17,940 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:46:17,940 INFO L276 IsEmpty]: Start isEmpty. Operand 9017 states and 13001 transitions. [2025-01-09 05:46:17,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 05:46:17,941 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:17,942 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:46:17,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 05:46:17,942 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:17,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:17,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1093101628, now seen corresponding path program 1 times [2025-01-09 05:46:17,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:17,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427946097] [2025-01-09 05:46:17,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:17,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:17,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 05:46:17,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 05:46:17,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:17,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:18,028 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:46:18,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:18,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427946097] [2025-01-09 05:46:18,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427946097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:18,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:18,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:46:18,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368881494] [2025-01-09 05:46:18,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:18,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:46:18,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:18,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:46:18,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:46:18,031 INFO L87 Difference]: Start difference. First operand 9017 states and 13001 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:46:18,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:18,128 INFO L93 Difference]: Finished difference Result 15749 states and 22419 transitions. [2025-01-09 05:46:18,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:46:18,129 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:46:18,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:18,144 INFO L225 Difference]: With dead ends: 15749 [2025-01-09 05:46:18,144 INFO L226 Difference]: Without dead ends: 9019 [2025-01-09 05:46:18,152 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:46:18,153 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:46:18,154 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:46:18,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9019 states. [2025-01-09 05:46:18,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9019 to 9017. [2025-01-09 05:46:18,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9017 states, 9015 states have (on average 1.4283971159179145) internal successors, (12877), 9016 states have internal predecessors, (12877), 0 states have call successors, (0), 0 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:46:18,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9017 states to 9017 states and 12877 transitions. [2025-01-09 05:46:18,286 INFO L78 Accepts]: Start accepts. Automaton has 9017 states and 12877 transitions. Word has length 66 [2025-01-09 05:46:18,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:18,286 INFO L471 AbstractCegarLoop]: Abstraction has 9017 states and 12877 transitions. [2025-01-09 05:46:18,286 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:46:18,286 INFO L276 IsEmpty]: Start isEmpty. Operand 9017 states and 12877 transitions. [2025-01-09 05:46:18,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 05:46:18,287 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:18,288 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:46:18,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 05:46:18,288 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:18,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:18,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1536501417, now seen corresponding path program 1 times [2025-01-09 05:46:18,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:18,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329122550] [2025-01-09 05:46:18,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:18,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:18,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 05:46:18,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 05:46:18,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:18,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:18,357 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:46:18,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:18,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329122550] [2025-01-09 05:46:18,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329122550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:18,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:18,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:46:18,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569081672] [2025-01-09 05:46:18,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:18,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:46:18,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:18,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:46:18,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:46:18,358 INFO L87 Difference]: Start difference. First operand 9017 states and 12877 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:46:18,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:18,406 INFO L93 Difference]: Finished difference Result 11590 states and 16461 transitions. [2025-01-09 05:46:18,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:46:18,407 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:46:18,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:18,414 INFO L225 Difference]: With dead ends: 11590 [2025-01-09 05:46:18,415 INFO L226 Difference]: Without dead ends: 4860 [2025-01-09 05:46:18,420 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:46:18,421 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:46:18,421 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:46:18,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4860 states. [2025-01-09 05:46:18,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4860 to 4852. [2025-01-09 05:46:18,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4852 states, 4850 states have (on average 1.4672164948453608) internal successors, (7116), 4851 states have internal predecessors, (7116), 0 states have call successors, (0), 0 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:46:18,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4852 states to 4852 states and 7116 transitions. [2025-01-09 05:46:18,481 INFO L78 Accepts]: Start accepts. Automaton has 4852 states and 7116 transitions. Word has length 67 [2025-01-09 05:46:18,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:18,481 INFO L471 AbstractCegarLoop]: Abstraction has 4852 states and 7116 transitions. [2025-01-09 05:46:18,481 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:46:18,481 INFO L276 IsEmpty]: Start isEmpty. Operand 4852 states and 7116 transitions. [2025-01-09 05:46:18,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 05:46:18,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:18,482 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:46:18,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 05:46:18,482 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:18,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:18,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1693309582, now seen corresponding path program 1 times [2025-01-09 05:46:18,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:18,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048769348] [2025-01-09 05:46:18,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:18,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:18,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 05:46:18,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 05:46:18,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:18,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:18,543 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:46:18,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:18,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048769348] [2025-01-09 05:46:18,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048769348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:18,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:18,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:46:18,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707825290] [2025-01-09 05:46:18,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:18,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:46:18,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:18,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:46:18,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:46:18,545 INFO L87 Difference]: Start difference. First operand 4852 states and 7116 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:46:18,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:18,632 INFO L93 Difference]: Finished difference Result 6132 states and 8878 transitions. [2025-01-09 05:46:18,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:46:18,632 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:46:18,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:18,638 INFO L225 Difference]: With dead ends: 6132 [2025-01-09 05:46:18,638 INFO L226 Difference]: Without dead ends: 3578 [2025-01-09 05:46:18,641 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:46:18,642 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:46:18,642 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:46:18,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3578 states. [2025-01-09 05:46:18,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3578 to 3576. [2025-01-09 05:46:18,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3576 states, 3574 states have (on average 1.4924454392837156) internal successors, (5334), 3575 states have internal predecessors, (5334), 0 states have call successors, (0), 0 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:46:18,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3576 states to 3576 states and 5334 transitions. [2025-01-09 05:46:18,683 INFO L78 Accepts]: Start accepts. Automaton has 3576 states and 5334 transitions. Word has length 68 [2025-01-09 05:46:18,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:18,683 INFO L471 AbstractCegarLoop]: Abstraction has 3576 states and 5334 transitions. [2025-01-09 05:46:18,683 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:46:18,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3576 states and 5334 transitions. [2025-01-09 05:46:18,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 05:46:18,684 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:18,684 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:46:18,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 05:46:18,684 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:18,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:18,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2022357856, now seen corresponding path program 1 times [2025-01-09 05:46:18,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:18,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447255339] [2025-01-09 05:46:18,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:18,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:18,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 05:46:18,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 05:46:18,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:18,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:18,749 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:46:18,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:18,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447255339] [2025-01-09 05:46:18,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447255339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:46:18,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:46:18,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:46:18,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427205679] [2025-01-09 05:46:18,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:46:18,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:46:18,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:18,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:46:18,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:46:18,750 INFO L87 Difference]: Start difference. First operand 3576 states and 5334 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:46:18,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:18,774 INFO L93 Difference]: Finished difference Result 4218 states and 6205 transitions. [2025-01-09 05:46:18,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:46:18,774 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:46:18,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:18,780 INFO L225 Difference]: With dead ends: 4218 [2025-01-09 05:46:18,780 INFO L226 Difference]: Without dead ends: 2940 [2025-01-09 05:46:18,782 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:46:18,782 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:46:18,782 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:46:18,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2025-01-09 05:46:18,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2938. [2025-01-09 05:46:18,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2938 states, 2936 states have (on average 1.5170299727520435) internal successors, (4454), 2937 states have internal predecessors, (4454), 0 states have call successors, (0), 0 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:46:18,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2938 states and 4454 transitions. [2025-01-09 05:46:18,812 INFO L78 Accepts]: Start accepts. Automaton has 2938 states and 4454 transitions. Word has length 70 [2025-01-09 05:46:18,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:18,813 INFO L471 AbstractCegarLoop]: Abstraction has 2938 states and 4454 transitions. [2025-01-09 05:46:18,813 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:46:18,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2938 states and 4454 transitions. [2025-01-09 05:46:18,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 05:46:18,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:18,814 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:46:18,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 05:46:18,814 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:18,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:18,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1521538382, now seen corresponding path program 1 times [2025-01-09 05:46:18,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:18,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729071447] [2025-01-09 05:46:18,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:18,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:18,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 05:46:18,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 05:46:18,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:18,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:18,907 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 05:46:18,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:18,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729071447] [2025-01-09 05:46:18,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729071447] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:46:18,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270013366] [2025-01-09 05:46:18,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:18,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:46:18,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:46:18,910 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:46:18,918 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:46:18,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 05:46:19,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 05:46:19,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:19,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:19,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 05:46:19,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:46:19,194 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:46:19,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:46:19,506 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:46:19,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270013366] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:46:19,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:46:19,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 6] total 13 [2025-01-09 05:46:19,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948312250] [2025-01-09 05:46:19,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:46:19,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 05:46:19,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:19,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 05:46:19,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:46:19,508 INFO L87 Difference]: Start difference. First operand 2938 states and 4454 transitions. Second operand has 13 states, 13 states have (on average 15.307692307692308) internal successors, (199), 13 states have internal predecessors, (199), 0 states have call successors, (0), 0 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:46:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:19,734 INFO L93 Difference]: Finished difference Result 5747 states and 8106 transitions. [2025-01-09 05:46:19,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 05:46:19,735 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 15.307692307692308) internal successors, (199), 13 states have internal predecessors, (199), 0 states have call successors, (0), 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:46:19,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:19,742 INFO L225 Difference]: With dead ends: 5747 [2025-01-09 05:46:19,742 INFO L226 Difference]: Without dead ends: 5070 [2025-01-09 05:46:19,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2025-01-09 05:46:19,744 INFO L435 NwaCegarLoop]: 1599 mSDtfsCounter, 4637 mSDsluCounter, 6432 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4637 SdHoareTripleChecker+Valid, 8031 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:19,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4637 Valid, 8031 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:46:19,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5070 states. [2025-01-09 05:46:19,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5070 to 4712. [2025-01-09 05:46:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4712 states, 4710 states have (on average 1.4235668789808917) internal successors, (6705), 4711 states have internal predecessors, (6705), 0 states have call successors, (0), 0 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:46:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4712 states to 4712 states and 6705 transitions. [2025-01-09 05:46:19,811 INFO L78 Accepts]: Start accepts. Automaton has 4712 states and 6705 transitions. Word has length 72 [2025-01-09 05:46:19,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:19,811 INFO L471 AbstractCegarLoop]: Abstraction has 4712 states and 6705 transitions. [2025-01-09 05:46:19,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.307692307692308) internal successors, (199), 13 states have internal predecessors, (199), 0 states have call successors, (0), 0 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:46:19,812 INFO L276 IsEmpty]: Start isEmpty. Operand 4712 states and 6705 transitions. [2025-01-09 05:46:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 05:46:19,812 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:19,812 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] [2025-01-09 05:46:19,822 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:46:20,013 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:46:20,013 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:20,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:20,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1308850337, now seen corresponding path program 1 times [2025-01-09 05:46:20,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:20,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810145560] [2025-01-09 05:46:20,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:20,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:20,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 05:46:20,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 05:46:20,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:20,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:20,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:20,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810145560] [2025-01-09 05:46:20,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810145560] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:46:20,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016559462] [2025-01-09 05:46:20,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:20,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:46:20,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:46:20,363 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:46:20,367 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:46:20,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 05:46:20,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 05:46:20,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:20,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:20,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 05:46:20,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:46:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:20,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:46:21,423 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:46:21,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016559462] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:46:21,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:46:21,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-01-09 05:46:21,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055198928] [2025-01-09 05:46:21,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:46:21,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 05:46:21,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:21,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 05:46:21,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-01-09 05:46:21,426 INFO L87 Difference]: Start difference. First operand 4712 states and 6705 transitions. Second operand has 25 states, 25 states have (on average 7.16) internal successors, (179), 24 states have internal predecessors, (179), 0 states have call successors, (0), 0 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:46:22,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:22,927 INFO L93 Difference]: Finished difference Result 14434 states and 19308 transitions. [2025-01-09 05:46:22,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 05:46:22,928 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 7.16) internal successors, (179), 24 states have internal predecessors, (179), 0 states have call successors, (0), 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:46:22,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:22,946 INFO L225 Difference]: With dead ends: 14434 [2025-01-09 05:46:22,946 INFO L226 Difference]: Without dead ends: 12041 [2025-01-09 05:46:22,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=629, Invalid=2233, Unknown=0, NotChecked=0, Total=2862 [2025-01-09 05:46:22,952 INFO L435 NwaCegarLoop]: 1515 mSDtfsCounter, 23371 mSDsluCounter, 6489 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23371 SdHoareTripleChecker+Valid, 8004 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:22,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23371 Valid, 8004 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:46:22,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12041 states. [2025-01-09 05:46:23,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12041 to 11893. [2025-01-09 05:46:23,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11893 states, 11891 states have (on average 1.3236901858548482) internal successors, (15740), 11892 states have internal predecessors, (15740), 0 states have call successors, (0), 0 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:46:23,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11893 states to 11893 states and 15740 transitions. [2025-01-09 05:46:23,253 INFO L78 Accepts]: Start accepts. Automaton has 11893 states and 15740 transitions. Word has length 73 [2025-01-09 05:46:23,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:23,254 INFO L471 AbstractCegarLoop]: Abstraction has 11893 states and 15740 transitions. [2025-01-09 05:46:23,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.16) internal successors, (179), 24 states have internal predecessors, (179), 0 states have call successors, (0), 0 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:46:23,254 INFO L276 IsEmpty]: Start isEmpty. Operand 11893 states and 15740 transitions. [2025-01-09 05:46:23,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 05:46:23,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:23,255 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:46:23,262 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:46:23,455 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:46:23,456 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:23,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:23,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1730489837, now seen corresponding path program 1 times [2025-01-09 05:46:23,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:23,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122739715] [2025-01-09 05:46:23,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:23,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:23,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 05:46:23,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 05:46:23,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:23,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:23,744 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:46:23,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:23,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122739715] [2025-01-09 05:46:23,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122739715] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:46:23,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524053457] [2025-01-09 05:46:23,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:23,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:46:23,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:46:23,747 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:46:23,748 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:46:23,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 05:46:23,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 05:46:23,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:23,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:23,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 05:46:23,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:46:24,750 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:46:24,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:46:26,132 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:46:26,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524053457] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:46:26,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:46:26,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 32 [2025-01-09 05:46:26,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596705485] [2025-01-09 05:46:26,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:46:26,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 05:46:26,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:26,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 05:46:26,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=858, Unknown=0, NotChecked=0, Total=992 [2025-01-09 05:46:26,138 INFO L87 Difference]: Start difference. First operand 11893 states and 15740 transitions. Second operand has 32 states, 32 states have (on average 6.21875) internal successors, (199), 32 states have internal predecessors, (199), 0 states have call successors, (0), 0 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:46:31,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:31,092 INFO L93 Difference]: Finished difference Result 56685 states and 72916 transitions. [2025-01-09 05:46:31,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-01-09 05:46:31,095 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 6.21875) internal successors, (199), 32 states have internal predecessors, (199), 0 states have call successors, (0), 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:46:31,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:31,159 INFO L225 Difference]: With dead ends: 56685 [2025-01-09 05:46:31,160 INFO L226 Difference]: Without dead ends: 47279 [2025-01-09 05:46:31,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2038 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1461, Invalid=5849, Unknown=0, NotChecked=0, Total=7310 [2025-01-09 05:46:31,179 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 24320 mSDsluCounter, 9454 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24320 SdHoareTripleChecker+Valid, 10963 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:31,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24320 Valid, 10963 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:46:31,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47279 states. [2025-01-09 05:46:32,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47279 to 47123. [2025-01-09 05:46:32,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47123 states, 47121 states have (on average 1.2656565013475944) internal successors, (59639), 47122 states have internal predecessors, (59639), 0 states have call successors, (0), 0 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:46:32,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47123 states to 47123 states and 59639 transitions. [2025-01-09 05:46:32,445 INFO L78 Accepts]: Start accepts. Automaton has 47123 states and 59639 transitions. Word has length 73 [2025-01-09 05:46:32,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:32,446 INFO L471 AbstractCegarLoop]: Abstraction has 47123 states and 59639 transitions. [2025-01-09 05:46:32,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.21875) internal successors, (199), 32 states have internal predecessors, (199), 0 states have call successors, (0), 0 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:46:32,446 INFO L276 IsEmpty]: Start isEmpty. Operand 47123 states and 59639 transitions. [2025-01-09 05:46:32,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 05:46:32,447 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:32,447 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:46:32,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 05:46:32,651 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:46:32,651 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:32,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:32,651 INFO L85 PathProgramCache]: Analyzing trace with hash -368926045, now seen corresponding path program 1 times [2025-01-09 05:46:32,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:32,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038906931] [2025-01-09 05:46:32,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:32,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:32,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:46:32,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:46:32,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:32,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:34,101 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:46:34,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:34,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038906931] [2025-01-09 05:46:34,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038906931] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:46:34,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989583241] [2025-01-09 05:46:34,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:34,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:46:34,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:46:34,107 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:46:34,110 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:46:34,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:46:34,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:46:34,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:34,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:34,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 05:46:34,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:46:34,879 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:46:34,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:46:35,454 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:46:35,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989583241] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:46:35,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:46:35,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-01-09 05:46:35,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321667358] [2025-01-09 05:46:35,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:46:35,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 05:46:35,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:35,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 05:46:35,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 05:46:35,456 INFO L87 Difference]: Start difference. First operand 47123 states and 59639 transitions. Second operand has 33 states, 33 states have (on average 6.151515151515151) internal successors, (203), 33 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:46:41,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:46:41,893 INFO L93 Difference]: Finished difference Result 107547 states and 133943 transitions. [2025-01-09 05:46:41,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-01-09 05:46:41,894 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 6.151515151515151) internal successors, (203), 33 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 75 [2025-01-09 05:46:41,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:46:41,995 INFO L225 Difference]: With dead ends: 107547 [2025-01-09 05:46:41,996 INFO L226 Difference]: Without dead ends: 83751 [2025-01-09 05:46:42,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2138 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1563, Invalid=6269, Unknown=0, NotChecked=0, Total=7832 [2025-01-09 05:46:42,030 INFO L435 NwaCegarLoop]: 1524 mSDtfsCounter, 9024 mSDsluCounter, 27511 mSDsCounter, 0 mSdLazyCounter, 1718 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9024 SdHoareTripleChecker+Valid, 29035 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:46:42,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9024 Valid, 29035 Invalid, 1763 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [45 Valid, 1718 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 05:46:42,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83751 states. [2025-01-09 05:46:44,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83751 to 68285. [2025-01-09 05:46:44,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68285 states, 68283 states have (on average 1.249915791631885) internal successors, (85348), 68284 states have internal predecessors, (85348), 0 states have call successors, (0), 0 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:46:44,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68285 states to 68285 states and 85348 transitions. [2025-01-09 05:46:44,493 INFO L78 Accepts]: Start accepts. Automaton has 68285 states and 85348 transitions. Word has length 75 [2025-01-09 05:46:44,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:46:44,493 INFO L471 AbstractCegarLoop]: Abstraction has 68285 states and 85348 transitions. [2025-01-09 05:46:44,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 6.151515151515151) internal successors, (203), 33 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:46:44,493 INFO L276 IsEmpty]: Start isEmpty. Operand 68285 states and 85348 transitions. [2025-01-09 05:46:44,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 05:46:44,494 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:46:44,495 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:46:44,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 05:46:44,695 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:46:44,696 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:46:44,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:46:44,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1647941027, now seen corresponding path program 1 times [2025-01-09 05:46:44,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:46:44,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470863755] [2025-01-09 05:46:44,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:44,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:46:44,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:46:44,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:46:44,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:44,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:45,289 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:46:45,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:46:45,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470863755] [2025-01-09 05:46:45,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470863755] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:46:45,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212702419] [2025-01-09 05:46:45,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:46:45,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:46:45,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:46:45,291 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:46:45,293 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:46:45,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 05:46:45,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 05:46:45,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:46:45,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:46:45,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-09 05:46:45,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:46:47,327 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:46:47,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:46:50,086 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:46:50,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212702419] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:46:50,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:46:50,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 23, 28] total 60 [2025-01-09 05:46:50,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189416795] [2025-01-09 05:46:50,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:46:50,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-01-09 05:46:50,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:46:50,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-01-09 05:46:50,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=476, Invalid=3064, Unknown=0, NotChecked=0, Total=3540 [2025-01-09 05:46:50,090 INFO L87 Difference]: Start difference. First operand 68285 states and 85348 transitions. Second operand has 60 states, 60 states have (on average 3.316666666666667) internal successors, (199), 60 states have internal predecessors, (199), 0 states have call successors, (0), 0 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:47:11,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:47:11,698 INFO L93 Difference]: Finished difference Result 196523 states and 246671 transitions. [2025-01-09 05:47:11,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2025-01-09 05:47:11,699 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 3.316666666666667) internal successors, (199), 60 states have internal predecessors, (199), 0 states have call successors, (0), 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:47:11,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:47:11,891 INFO L225 Difference]: With dead ends: 196523 [2025-01-09 05:47:11,891 INFO L226 Difference]: Without dead ends: 171043 [2025-01-09 05:47:11,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15755 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=7187, Invalid=32215, Unknown=0, NotChecked=0, Total=39402 [2025-01-09 05:47:11,927 INFO L435 NwaCegarLoop]: 1534 mSDtfsCounter, 27624 mSDsluCounter, 20640 mSDsCounter, 0 mSdLazyCounter, 2635 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27624 SdHoareTripleChecker+Valid, 22174 SdHoareTripleChecker+Invalid, 2839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 2635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 05:47:11,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27624 Valid, 22174 Invalid, 2839 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [204 Valid, 2635 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 05:47:12,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171043 states. [2025-01-09 05:47:14,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171043 to 60881. [2025-01-09 05:47:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60881 states, 60879 states have (on average 1.251564578918839) internal successors, (76194), 60880 states have internal predecessors, (76194), 0 states have call successors, (0), 0 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:47:15,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60881 states to 60881 states and 76194 transitions. [2025-01-09 05:47:15,048 INFO L78 Accepts]: Start accepts. Automaton has 60881 states and 76194 transitions. Word has length 75 [2025-01-09 05:47:15,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:47:15,048 INFO L471 AbstractCegarLoop]: Abstraction has 60881 states and 76194 transitions. [2025-01-09 05:47:15,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 3.316666666666667) internal successors, (199), 60 states have internal predecessors, (199), 0 states have call successors, (0), 0 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:47:15,049 INFO L276 IsEmpty]: Start isEmpty. Operand 60881 states and 76194 transitions. [2025-01-09 05:47:15,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 05:47:15,049 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:47:15,049 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:47:15,056 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:47:15,250 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:47:15,250 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:47:15,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:47:15,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1728685026, now seen corresponding path program 1 times [2025-01-09 05:47:15,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:47:15,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450433276] [2025-01-09 05:47:15,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:15,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:47:15,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 05:47:15,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 05:47:15,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:15,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:16,920 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:47:16,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:47:16,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450433276] [2025-01-09 05:47:16,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450433276] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:47:16,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254295938] [2025-01-09 05:47:16,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:47:16,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:47:16,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:47:16,923 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:47:16,924 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:47:16,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 05:47:17,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 05:47:17,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:47:17,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:47:17,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-01-09 05:47:17,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:47:22,002 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:47:22,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:47:26,706 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:47:26,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254295938] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:47:26,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:47:26,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 31, 24] total 77 [2025-01-09 05:47:26,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430694438] [2025-01-09 05:47:26,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:47:26,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2025-01-09 05:47:26,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:47:26,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2025-01-09 05:47:26,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=5065, Unknown=0, NotChecked=0, Total=5852 [2025-01-09 05:47:26,709 INFO L87 Difference]: Start difference. First operand 60881 states and 76194 transitions. Second operand has 77 states, 77 states have (on average 2.7012987012987013) internal successors, (208), 77 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)