./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.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 34aba2e0444cf7168338399e1c016871ad9a3305ff2dee9e611b86f3cad834b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:39:58,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:39:58,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:39:58,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:39:58,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:39:58,798 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:39:58,799 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:39:58,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:39:58,799 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:39:58,800 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:39:58,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:39:58,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:39:58,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:39:58,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:39:58,800 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:39:58,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:39:58,800 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:39:58,800 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:39:58,801 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:39:58,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:39:58,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:39:58,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:39:58,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:39:58,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:39:58,801 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:39:58,801 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:39:58,801 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:39:58,801 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:39:58,801 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:39:58,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:39:58,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:39:58,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:39:58,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:39:58,802 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:39:58,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:39:58,802 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:39:58,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:39:58,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:39:58,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:39:58,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:39:58,802 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:39:58,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:39:58,803 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:39:58,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:39:58,803 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:39:58,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:39:58,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:39:58,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:39:58,803 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 -> 34aba2e0444cf7168338399e1c016871ad9a3305ff2dee9e611b86f3cad834b5 [2025-01-09 04:39:59,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:39:59,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:39:59,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:39:59,060 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:39:59,060 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:39:59,061 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-01-09 04:40:00,250 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7da0f5fd/3acf85216807449fa4100eda44ebe40e/FLAGbaf10c2d2 [2025-01-09 04:40:00,630 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:40:00,631 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-01-09 04:40:00,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7da0f5fd/3acf85216807449fa4100eda44ebe40e/FLAGbaf10c2d2 [2025-01-09 04:40:00,820 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7da0f5fd/3acf85216807449fa4100eda44ebe40e [2025-01-09 04:40:00,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:40:00,823 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:40:00,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:40:00,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:40:00,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:40:00,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:40:00" (1/1) ... [2025-01-09 04:40:00,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@190caf14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:00, skipping insertion in model container [2025-01-09 04:40:00,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:40:00" (1/1) ... [2025-01-09 04:40:00,870 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:40:01,000 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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8127,8140] [2025-01-09 04:40:01,022 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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14997,15010] [2025-01-09 04:40:01,029 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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17084,17097] [2025-01-09 04:40:01,033 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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18108,18121] [2025-01-09 04:40:01,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:40:01,136 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:40:01,169 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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8127,8140] [2025-01-09 04:40:01,187 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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14997,15010] [2025-01-09 04:40:01,194 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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17084,17097] [2025-01-09 04:40:01,197 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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18108,18121] [2025-01-09 04:40:01,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:40:01,270 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:40:01,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:01 WrapperNode [2025-01-09 04:40:01,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:40:01,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:40:01,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:40:01,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:40:01,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:01" (1/1) ... [2025-01-09 04:40:01,296 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:01" (1/1) ... [2025-01-09 04:40:01,356 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2620 [2025-01-09 04:40:01,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:40:01,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:40:01,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:40:01,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:40:01,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:01" (1/1) ... [2025-01-09 04:40:01,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:01" (1/1) ... [2025-01-09 04:40:01,374 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:01" (1/1) ... [2025-01-09 04:40:01,409 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 04:40:01,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:01" (1/1) ... [2025-01-09 04:40:01,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:01" (1/1) ... [2025-01-09 04:40:01,440 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:01" (1/1) ... [2025-01-09 04:40:01,447 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:01" (1/1) ... [2025-01-09 04:40:01,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:01" (1/1) ... [2025-01-09 04:40:01,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:01" (1/1) ... [2025-01-09 04:40:01,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:01" (1/1) ... [2025-01-09 04:40:01,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:40:01,499 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:40:01,499 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:40:01,499 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:40:01,500 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:01" (1/1) ... [2025-01-09 04:40:01,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:40:01,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:40:01,529 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 04:40:01,532 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 04:40:01,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:40:01,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:40:01,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:40:01,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:40:01,702 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:40:01,703 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:40:02,953 INFO L? ?]: Removed 426 outVars from TransFormulas that were not future-live. [2025-01-09 04:40:02,953 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:40:02,981 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:40:02,981 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:40:02,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:40:02 BoogieIcfgContainer [2025-01-09 04:40:02,981 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:40:02,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:40:02,983 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:40:02,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:40:02,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:40:00" (1/3) ... [2025-01-09 04:40:02,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41161ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:40:02, skipping insertion in model container [2025-01-09 04:40:02,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:40:01" (2/3) ... [2025-01-09 04:40:02,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41161ade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:40:02, skipping insertion in model container [2025-01-09 04:40:02,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:40:02" (3/3) ... [2025-01-09 04:40:02,991 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-01-09 04:40:03,001 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:40:03,005 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 456 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-01-09 04:40:03,066 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:40:03,078 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;@11c64f90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:40:03,079 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 04:40:03,085 INFO L276 IsEmpty]: Start isEmpty. Operand has 456 states, 451 states have (on average 1.8492239467849223) internal successors, (834), 455 states have internal predecessors, (834), 0 states have call successors, (0), 0 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 04:40:03,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 04:40:03,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:03,098 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:03,099 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:03,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:03,103 INFO L85 PathProgramCache]: Analyzing trace with hash 26036561, now seen corresponding path program 1 times [2025-01-09 04:40:03,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:03,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177560997] [2025-01-09 04:40:03,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:03,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:03,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 04:40:03,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 04:40:03,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:03,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:03,496 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 04:40:03,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:03,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177560997] [2025-01-09 04:40:03,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177560997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:03,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:03,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:40:03,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573930931] [2025-01-09 04:40:03,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:03,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:40:03,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:03,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:40:03,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:40:03,525 INFO L87 Difference]: Start difference. First operand has 456 states, 451 states have (on average 1.8492239467849223) internal successors, (834), 455 states have internal predecessors, (834), 0 states have call successors, (0), 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 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 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 04:40:03,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:03,961 INFO L93 Difference]: Finished difference Result 834 states and 1473 transitions. [2025-01-09 04:40:03,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:40:03,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-01-09 04:40:03,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:03,975 INFO L225 Difference]: With dead ends: 834 [2025-01-09 04:40:03,976 INFO L226 Difference]: Without dead ends: 485 [2025-01-09 04:40:03,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:40:03,980 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 2298 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2298 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:03,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2298 Valid, 577 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:40:03,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-01-09 04:40:04,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 479. [2025-01-09 04:40:04,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 475 states have (on average 1.3747368421052633) internal successors, (653), 478 states have internal predecessors, (653), 0 states have call successors, (0), 0 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 04:40:04,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 653 transitions. [2025-01-09 04:40:04,040 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 653 transitions. Word has length 50 [2025-01-09 04:40:04,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:04,041 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 653 transitions. [2025-01-09 04:40:04,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 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 04:40:04,041 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 653 transitions. [2025-01-09 04:40:04,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 04:40:04,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:04,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:04,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:40:04,046 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:04,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:04,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1543870192, now seen corresponding path program 1 times [2025-01-09 04:40:04,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:04,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702047728] [2025-01-09 04:40:04,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:04,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:04,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 04:40:04,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 04:40:04,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:04,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:04,222 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 04:40:04,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:04,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702047728] [2025-01-09 04:40:04,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702047728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:04,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:04,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:04,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353714976] [2025-01-09 04:40:04,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:04,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:04,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:04,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:04,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:04,224 INFO L87 Difference]: Start difference. First operand 479 states and 653 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:04,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:04,257 INFO L93 Difference]: Finished difference Result 940 states and 1338 transitions. [2025-01-09 04:40:04,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:04,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-01-09 04:40:04,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:04,261 INFO L225 Difference]: With dead ends: 940 [2025-01-09 04:40:04,261 INFO L226 Difference]: Without dead ends: 686 [2025-01-09 04:40:04,262 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 04:40:04,263 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 272 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:04,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 860 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:04,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-01-09 04:40:04,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 680. [2025-01-09 04:40:04,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 676 states have (on average 1.4068047337278107) internal successors, (951), 679 states have internal predecessors, (951), 0 states have call successors, (0), 0 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 04:40:04,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 951 transitions. [2025-01-09 04:40:04,280 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 951 transitions. Word has length 51 [2025-01-09 04:40:04,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:04,281 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 951 transitions. [2025-01-09 04:40:04,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:04,281 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 951 transitions. [2025-01-09 04:40:04,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 04:40:04,282 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:04,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:04,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:40:04,283 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:04,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:04,283 INFO L85 PathProgramCache]: Analyzing trace with hash -359372662, now seen corresponding path program 1 times [2025-01-09 04:40:04,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:04,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134536104] [2025-01-09 04:40:04,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:04,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:04,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 04:40:04,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 04:40:04,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:04,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:04,399 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 04:40:04,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:04,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134536104] [2025-01-09 04:40:04,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134536104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:04,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:04,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:04,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121664175] [2025-01-09 04:40:04,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:04,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:04,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:04,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:04,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:04,400 INFO L87 Difference]: Start difference. First operand 680 states and 951 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:04,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:04,502 INFO L93 Difference]: Finished difference Result 1566 states and 2244 transitions. [2025-01-09 04:40:04,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:04,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-01-09 04:40:04,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:04,513 INFO L225 Difference]: With dead ends: 1566 [2025-01-09 04:40:04,513 INFO L226 Difference]: Without dead ends: 1101 [2025-01-09 04:40:04,514 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 04:40:04,515 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 366 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:04,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 936 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:40:04,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2025-01-09 04:40:04,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1091. [2025-01-09 04:40:04,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1091 states, 1087 states have (on average 1.405703771849126) internal successors, (1528), 1090 states have internal predecessors, (1528), 0 states have call successors, (0), 0 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 04:40:04,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1528 transitions. [2025-01-09 04:40:04,567 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1528 transitions. Word has length 51 [2025-01-09 04:40:04,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:04,567 INFO L471 AbstractCegarLoop]: Abstraction has 1091 states and 1528 transitions. [2025-01-09 04:40:04,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:04,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1528 transitions. [2025-01-09 04:40:04,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 04:40:04,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:04,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:04,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:40:04,574 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:04,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:04,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1979749037, now seen corresponding path program 1 times [2025-01-09 04:40:04,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:04,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157184650] [2025-01-09 04:40:04,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:04,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:04,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 04:40:04,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 04:40:04,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:04,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:04,705 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 04:40:04,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:04,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157184650] [2025-01-09 04:40:04,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157184650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:04,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:04,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:04,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379684025] [2025-01-09 04:40:04,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:04,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:04,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:04,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:04,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:04,707 INFO L87 Difference]: Start difference. First operand 1091 states and 1528 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:04,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:04,782 INFO L93 Difference]: Finished difference Result 2383 states and 3421 transitions. [2025-01-09 04:40:04,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:04,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-01-09 04:40:04,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:04,793 INFO L225 Difference]: With dead ends: 2383 [2025-01-09 04:40:04,794 INFO L226 Difference]: Without dead ends: 1722 [2025-01-09 04:40:04,795 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 04:40:04,796 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 265 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:04,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 928 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:40:04,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2025-01-09 04:40:04,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1715. [2025-01-09 04:40:04,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1711 states have (on average 1.4108708357685564) internal successors, (2414), 1714 states have internal predecessors, (2414), 0 states have call successors, (0), 0 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 04:40:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2414 transitions. [2025-01-09 04:40:04,839 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2414 transitions. Word has length 51 [2025-01-09 04:40:04,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:04,839 INFO L471 AbstractCegarLoop]: Abstraction has 1715 states and 2414 transitions. [2025-01-09 04:40:04,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:04,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2414 transitions. [2025-01-09 04:40:04,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 04:40:04,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:04,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:04,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:40:04,842 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:04,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:04,843 INFO L85 PathProgramCache]: Analyzing trace with hash -2124032919, now seen corresponding path program 1 times [2025-01-09 04:40:04,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:04,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570678889] [2025-01-09 04:40:04,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:04,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:04,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 04:40:04,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 04:40:04,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:04,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:04,961 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 04:40:04,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:04,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570678889] [2025-01-09 04:40:04,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570678889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:04,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:04,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:40:04,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808331804] [2025-01-09 04:40:04,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:04,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:40:04,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:04,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:40:04,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:40:04,964 INFO L87 Difference]: Start difference. First operand 1715 states and 2414 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:05,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:05,221 INFO L93 Difference]: Finished difference Result 3784 states and 5391 transitions. [2025-01-09 04:40:05,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:40:05,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-01-09 04:40:05,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:05,228 INFO L225 Difference]: With dead ends: 3784 [2025-01-09 04:40:05,228 INFO L226 Difference]: Without dead ends: 2240 [2025-01-09 04:40:05,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:40:05,233 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 1545 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:05,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1545 Valid, 371 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:40:05,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2025-01-09 04:40:05,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 2226. [2025-01-09 04:40:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2226 states, 2222 states have (on average 1.4185418541854184) internal successors, (3152), 2225 states have internal predecessors, (3152), 0 states have call successors, (0), 0 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 04:40:05,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 3152 transitions. [2025-01-09 04:40:05,280 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 3152 transitions. Word has length 51 [2025-01-09 04:40:05,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:05,280 INFO L471 AbstractCegarLoop]: Abstraction has 2226 states and 3152 transitions. [2025-01-09 04:40:05,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:05,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 3152 transitions. [2025-01-09 04:40:05,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 04:40:05,284 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:05,284 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:05,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:40:05,285 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:05,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:05,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1035105163, now seen corresponding path program 1 times [2025-01-09 04:40:05,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:05,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514537992] [2025-01-09 04:40:05,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:05,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:05,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 04:40:05,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 04:40:05,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:05,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:05,413 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 04:40:05,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:05,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514537992] [2025-01-09 04:40:05,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514537992] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:05,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:05,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:40:05,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258446933] [2025-01-09 04:40:05,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:05,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:40:05,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:05,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:40:05,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:40:05,415 INFO L87 Difference]: Start difference. First operand 2226 states and 3152 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:05,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:05,678 INFO L93 Difference]: Finished difference Result 5039 states and 7185 transitions. [2025-01-09 04:40:05,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:40:05,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-01-09 04:40:05,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:05,686 INFO L225 Difference]: With dead ends: 5039 [2025-01-09 04:40:05,686 INFO L226 Difference]: Without dead ends: 2984 [2025-01-09 04:40:05,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:40:05,688 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 1392 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1392 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:05,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1392 Valid, 340 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:40:05,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2025-01-09 04:40:05,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2965. [2025-01-09 04:40:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2961 states have (on average 1.414724755150287) internal successors, (4189), 2964 states have internal predecessors, (4189), 0 states have call successors, (0), 0 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 04:40:05,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 4189 transitions. [2025-01-09 04:40:05,729 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 4189 transitions. Word has length 52 [2025-01-09 04:40:05,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:05,729 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 4189 transitions. [2025-01-09 04:40:05,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:05,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 4189 transitions. [2025-01-09 04:40:05,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 04:40:05,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:05,731 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:05,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:40:05,731 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:05,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:05,732 INFO L85 PathProgramCache]: Analyzing trace with hash 825819079, now seen corresponding path program 1 times [2025-01-09 04:40:05,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:05,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477264092] [2025-01-09 04:40:05,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:05,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:05,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 04:40:05,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 04:40:05,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:05,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:05,834 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 04:40:05,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:05,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477264092] [2025-01-09 04:40:05,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477264092] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:05,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:05,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:40:05,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883849679] [2025-01-09 04:40:05,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:05,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:40:05,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:05,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:40:05,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:40:05,836 INFO L87 Difference]: Start difference. First operand 2965 states and 4189 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:06,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:06,147 INFO L93 Difference]: Finished difference Result 5848 states and 8347 transitions. [2025-01-09 04:40:06,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:40:06,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-01-09 04:40:06,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:06,159 INFO L225 Difference]: With dead ends: 5848 [2025-01-09 04:40:06,159 INFO L226 Difference]: Without dead ends: 4545 [2025-01-09 04:40:06,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:40:06,162 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 1723 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1723 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:06,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1723 Valid, 588 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:40:06,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4545 states. [2025-01-09 04:40:06,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4545 to 2979. [2025-01-09 04:40:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2979 states, 2975 states have (on average 1.4141176470588235) internal successors, (4207), 2978 states have internal predecessors, (4207), 0 states have call successors, (0), 0 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 04:40:06,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2979 states to 2979 states and 4207 transitions. [2025-01-09 04:40:06,226 INFO L78 Accepts]: Start accepts. Automaton has 2979 states and 4207 transitions. Word has length 53 [2025-01-09 04:40:06,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:06,226 INFO L471 AbstractCegarLoop]: Abstraction has 2979 states and 4207 transitions. [2025-01-09 04:40:06,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2979 states and 4207 transitions. [2025-01-09 04:40:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 04:40:06,228 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:06,228 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:06,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:40:06,229 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:06,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:06,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1519774840, now seen corresponding path program 1 times [2025-01-09 04:40:06,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:06,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039680542] [2025-01-09 04:40:06,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:06,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:06,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 04:40:06,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 04:40:06,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:06,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:06,365 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 04:40:06,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:06,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039680542] [2025-01-09 04:40:06,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039680542] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:06,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:06,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:40:06,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915674629] [2025-01-09 04:40:06,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:06,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:40:06,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:06,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:40:06,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:40:06,366 INFO L87 Difference]: Start difference. First operand 2979 states and 4207 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:06,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:06,815 INFO L93 Difference]: Finished difference Result 6531 states and 9328 transitions. [2025-01-09 04:40:06,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:40:06,816 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-01-09 04:40:06,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:06,842 INFO L225 Difference]: With dead ends: 6531 [2025-01-09 04:40:06,842 INFO L226 Difference]: Without dead ends: 5419 [2025-01-09 04:40:06,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:40:06,846 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 1848 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1848 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:06,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1848 Valid, 623 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:40:06,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5419 states. [2025-01-09 04:40:06,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5419 to 3001. [2025-01-09 04:40:06,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3001 states, 2997 states have (on average 1.4140807474140809) internal successors, (4238), 3000 states have internal predecessors, (4238), 0 states have call successors, (0), 0 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 04:40:06,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3001 states to 3001 states and 4238 transitions. [2025-01-09 04:40:06,909 INFO L78 Accepts]: Start accepts. Automaton has 3001 states and 4238 transitions. Word has length 53 [2025-01-09 04:40:06,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:06,910 INFO L471 AbstractCegarLoop]: Abstraction has 3001 states and 4238 transitions. [2025-01-09 04:40:06,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:06,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3001 states and 4238 transitions. [2025-01-09 04:40:06,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 04:40:06,913 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:06,913 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:06,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:40:06,913 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:06,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:06,914 INFO L85 PathProgramCache]: Analyzing trace with hash -461927258, now seen corresponding path program 1 times [2025-01-09 04:40:06,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:06,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174288077] [2025-01-09 04:40:06,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:06,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:06,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 04:40:06,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 04:40:06,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:06,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:07,053 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 04:40:07,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:07,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174288077] [2025-01-09 04:40:07,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174288077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:07,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:07,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:40:07,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728935706] [2025-01-09 04:40:07,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:07,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:40:07,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:07,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:40:07,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:40:07,055 INFO L87 Difference]: Start difference. First operand 3001 states and 4238 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:07,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:07,408 INFO L93 Difference]: Finished difference Result 7211 states and 10289 transitions. [2025-01-09 04:40:07,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:40:07,408 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-01-09 04:40:07,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:07,423 INFO L225 Difference]: With dead ends: 7211 [2025-01-09 04:40:07,423 INFO L226 Difference]: Without dead ends: 6243 [2025-01-09 04:40:07,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:40:07,426 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 1962 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1962 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:07,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1962 Valid, 635 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:40:07,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6243 states. [2025-01-09 04:40:07,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6243 to 3035. [2025-01-09 04:40:07,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3035 states, 3031 states have (on average 1.4127350709336852) internal successors, (4282), 3034 states have internal predecessors, (4282), 0 states have call successors, (0), 0 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 04:40:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 4282 transitions. [2025-01-09 04:40:07,485 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 4282 transitions. Word has length 53 [2025-01-09 04:40:07,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:07,485 INFO L471 AbstractCegarLoop]: Abstraction has 3035 states and 4282 transitions. [2025-01-09 04:40:07,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:07,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 4282 transitions. [2025-01-09 04:40:07,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 04:40:07,487 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:07,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:07,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:40:07,487 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:07,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:07,488 INFO L85 PathProgramCache]: Analyzing trace with hash -719043471, now seen corresponding path program 1 times [2025-01-09 04:40:07,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:07,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460614241] [2025-01-09 04:40:07,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:07,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:07,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 04:40:07,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 04:40:07,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:07,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:07,772 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 04:40:07,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:07,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460614241] [2025-01-09 04:40:07,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460614241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:07,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:07,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:40:07,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902321331] [2025-01-09 04:40:07,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:07,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:40:07,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:07,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:40:07,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:40:07,774 INFO L87 Difference]: Start difference. First operand 3035 states and 4282 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:08,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:08,169 INFO L93 Difference]: Finished difference Result 6201 states and 8913 transitions. [2025-01-09 04:40:08,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:40:08,170 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-01-09 04:40:08,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:08,184 INFO L225 Difference]: With dead ends: 6201 [2025-01-09 04:40:08,185 INFO L226 Difference]: Without dead ends: 4252 [2025-01-09 04:40:08,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:40:08,190 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 1988 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1988 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:08,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1988 Valid, 776 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:40:08,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4252 states. [2025-01-09 04:40:08,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4252 to 2945. [2025-01-09 04:40:08,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2945 states, 2941 states have (on average 1.4124447466848011) internal successors, (4154), 2944 states have internal predecessors, (4154), 0 states have call successors, (0), 0 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 04:40:08,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2945 states and 4154 transitions. [2025-01-09 04:40:08,255 INFO L78 Accepts]: Start accepts. Automaton has 2945 states and 4154 transitions. Word has length 54 [2025-01-09 04:40:08,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:08,255 INFO L471 AbstractCegarLoop]: Abstraction has 2945 states and 4154 transitions. [2025-01-09 04:40:08,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2945 states and 4154 transitions. [2025-01-09 04:40:08,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 04:40:08,259 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:08,259 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:08,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:40:08,259 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:08,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:08,260 INFO L85 PathProgramCache]: Analyzing trace with hash 465454059, now seen corresponding path program 1 times [2025-01-09 04:40:08,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:08,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28943517] [2025-01-09 04:40:08,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:08,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:08,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 04:40:08,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 04:40:08,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:08,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:08,515 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 04:40:08,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:08,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28943517] [2025-01-09 04:40:08,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28943517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:08,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:08,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:40:08,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717717286] [2025-01-09 04:40:08,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:08,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:40:08,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:08,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:40:08,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:40:08,517 INFO L87 Difference]: Start difference. First operand 2945 states and 4154 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:09,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:09,141 INFO L93 Difference]: Finished difference Result 5898 states and 8420 transitions. [2025-01-09 04:40:09,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:40:09,141 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-01-09 04:40:09,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:09,147 INFO L225 Difference]: With dead ends: 5898 [2025-01-09 04:40:09,147 INFO L226 Difference]: Without dead ends: 4109 [2025-01-09 04:40:09,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-01-09 04:40:09,150 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 1701 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1701 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:09,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1701 Valid, 1209 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:40:09,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4109 states. [2025-01-09 04:40:09,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4109 to 2916. [2025-01-09 04:40:09,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2916 states, 2912 states have (on average 1.4124313186813187) internal successors, (4113), 2915 states have internal predecessors, (4113), 0 states have call successors, (0), 0 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 04:40:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 4113 transitions. [2025-01-09 04:40:09,206 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 4113 transitions. Word has length 54 [2025-01-09 04:40:09,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:09,206 INFO L471 AbstractCegarLoop]: Abstraction has 2916 states and 4113 transitions. [2025-01-09 04:40:09,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:09,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 4113 transitions. [2025-01-09 04:40:09,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 04:40:09,209 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:09,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:09,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:40:09,209 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:09,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:09,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1085167472, now seen corresponding path program 1 times [2025-01-09 04:40:09,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:09,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278238144] [2025-01-09 04:40:09,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:09,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:09,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 04:40:09,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 04:40:09,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:09,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:09,426 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 04:40:09,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:09,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278238144] [2025-01-09 04:40:09,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278238144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:09,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:09,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:40:09,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250291414] [2025-01-09 04:40:09,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:09,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:40:09,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:09,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:40:09,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:40:09,428 INFO L87 Difference]: Start difference. First operand 2916 states and 4113 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:09,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:09,935 INFO L93 Difference]: Finished difference Result 4377 states and 6197 transitions. [2025-01-09 04:40:09,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:40:09,935 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-01-09 04:40:09,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:09,941 INFO L225 Difference]: With dead ends: 4377 [2025-01-09 04:40:09,941 INFO L226 Difference]: Without dead ends: 4372 [2025-01-09 04:40:09,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:40:09,942 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 2062 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2062 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:09,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2062 Valid, 1079 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:40:09,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4372 states. [2025-01-09 04:40:09,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4372 to 2916. [2025-01-09 04:40:09,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2916 states, 2912 states have (on average 1.4117445054945055) internal successors, (4111), 2915 states have internal predecessors, (4111), 0 states have call successors, (0), 0 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 04:40:09,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 4111 transitions. [2025-01-09 04:40:09,981 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 4111 transitions. Word has length 54 [2025-01-09 04:40:09,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:09,981 INFO L471 AbstractCegarLoop]: Abstraction has 2916 states and 4111 transitions. [2025-01-09 04:40:09,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:09,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 4111 transitions. [2025-01-09 04:40:09,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 04:40:09,983 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:09,983 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:09,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:40:09,983 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:09,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:09,984 INFO L85 PathProgramCache]: Analyzing trace with hash -344500623, now seen corresponding path program 1 times [2025-01-09 04:40:09,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:09,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776159530] [2025-01-09 04:40:09,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:09,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:09,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 04:40:10,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 04:40:10,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:10,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:10,064 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 04:40:10,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:10,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776159530] [2025-01-09 04:40:10,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776159530] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:10,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:10,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:10,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797120655] [2025-01-09 04:40:10,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:10,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:10,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:10,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:10,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:10,066 INFO L87 Difference]: Start difference. First operand 2916 states and 4111 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:40:10,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:10,103 INFO L93 Difference]: Finished difference Result 4186 states and 5952 transitions. [2025-01-09 04:40:10,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:10,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-01-09 04:40:10,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:10,107 INFO L225 Difference]: With dead ends: 4186 [2025-01-09 04:40:10,107 INFO L226 Difference]: Without dead ends: 2923 [2025-01-09 04:40:10,108 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 04:40:10,109 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 226 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:10,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 804 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:10,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2025-01-09 04:40:10,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 2916. [2025-01-09 04:40:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2916 states, 2912 states have (on average 1.3980082417582418) internal successors, (4071), 2915 states have internal predecessors, (4071), 0 states have call successors, (0), 0 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 04:40:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 4071 transitions. [2025-01-09 04:40:10,137 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 4071 transitions. Word has length 55 [2025-01-09 04:40:10,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:10,137 INFO L471 AbstractCegarLoop]: Abstraction has 2916 states and 4071 transitions. [2025-01-09 04:40:10,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:40:10,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 4071 transitions. [2025-01-09 04:40:10,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 04:40:10,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:10,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:10,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:40:10,139 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:10,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:10,140 INFO L85 PathProgramCache]: Analyzing trace with hash 29096373, now seen corresponding path program 1 times [2025-01-09 04:40:10,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:10,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829729727] [2025-01-09 04:40:10,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:10,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:10,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 04:40:10,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 04:40:10,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:10,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:10,181 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 04:40:10,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:10,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829729727] [2025-01-09 04:40:10,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829729727] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:10,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:10,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:10,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529427697] [2025-01-09 04:40:10,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:10,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:10,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:10,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:10,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:10,182 INFO L87 Difference]: Start difference. First operand 2916 states and 4071 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:40:10,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:10,206 INFO L93 Difference]: Finished difference Result 4255 states and 5988 transitions. [2025-01-09 04:40:10,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:10,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-01-09 04:40:10,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:10,211 INFO L225 Difference]: With dead ends: 4255 [2025-01-09 04:40:10,211 INFO L226 Difference]: Without dead ends: 2922 [2025-01-09 04:40:10,212 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 04:40:10,213 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 242 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:10,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 805 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:10,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2025-01-09 04:40:10,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2916. [2025-01-09 04:40:10,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2916 states, 2912 states have (on average 1.3856456043956045) internal successors, (4035), 2915 states have internal predecessors, (4035), 0 states have call successors, (0), 0 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 04:40:10,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 4035 transitions. [2025-01-09 04:40:10,238 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 4035 transitions. Word has length 55 [2025-01-09 04:40:10,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:10,238 INFO L471 AbstractCegarLoop]: Abstraction has 2916 states and 4035 transitions. [2025-01-09 04:40:10,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:40:10,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 4035 transitions. [2025-01-09 04:40:10,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 04:40:10,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:10,240 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:10,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:40:10,240 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:10,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:10,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1813019801, now seen corresponding path program 1 times [2025-01-09 04:40:10,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:10,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597300365] [2025-01-09 04:40:10,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:10,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:10,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 04:40:10,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 04:40:10,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:10,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:10,280 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 04:40:10,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:10,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597300365] [2025-01-09 04:40:10,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597300365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:10,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:10,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:10,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391498864] [2025-01-09 04:40:10,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:10,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:10,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:10,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:10,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:10,282 INFO L87 Difference]: Start difference. First operand 2916 states and 4035 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:40:10,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:10,327 INFO L93 Difference]: Finished difference Result 3997 states and 5541 transitions. [2025-01-09 04:40:10,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:10,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-01-09 04:40:10,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:10,336 INFO L225 Difference]: With dead ends: 3997 [2025-01-09 04:40:10,336 INFO L226 Difference]: Without dead ends: 2907 [2025-01-09 04:40:10,338 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 04:40:10,338 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 261 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:10,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 816 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:10,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2025-01-09 04:40:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 2901. [2025-01-09 04:40:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2901 states, 2897 states have (on average 1.3583016914049015) internal successors, (3935), 2900 states have internal predecessors, (3935), 0 states have call successors, (0), 0 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 04:40:10,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2901 states to 2901 states and 3935 transitions. [2025-01-09 04:40:10,366 INFO L78 Accepts]: Start accepts. Automaton has 2901 states and 3935 transitions. Word has length 55 [2025-01-09 04:40:10,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:10,367 INFO L471 AbstractCegarLoop]: Abstraction has 2901 states and 3935 transitions. [2025-01-09 04:40:10,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 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 04:40:10,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2901 states and 3935 transitions. [2025-01-09 04:40:10,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 04:40:10,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:10,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:10,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:40:10,369 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:10,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:10,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1260356730, now seen corresponding path program 1 times [2025-01-09 04:40:10,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:10,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317916412] [2025-01-09 04:40:10,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:10,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:10,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 04:40:10,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 04:40:10,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:10,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:10,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:10,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:10,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317916412] [2025-01-09 04:40:10,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317916412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:10,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:10,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:10,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130360134] [2025-01-09 04:40:10,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:10,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:10,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:10,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:10,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:10,404 INFO L87 Difference]: Start difference. First operand 2901 states and 3935 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:10,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:10,451 INFO L93 Difference]: Finished difference Result 4576 states and 6264 transitions. [2025-01-09 04:40:10,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:10,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-01-09 04:40:10,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:10,455 INFO L225 Difference]: With dead ends: 4576 [2025-01-09 04:40:10,455 INFO L226 Difference]: Without dead ends: 3319 [2025-01-09 04:40:10,457 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 04:40:10,457 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 326 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:10,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 524 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3319 states. [2025-01-09 04:40:10,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3319 to 2719. [2025-01-09 04:40:10,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2719 states, 2715 states have (on average 1.3624309392265193) internal successors, (3699), 2718 states have internal predecessors, (3699), 0 states have call successors, (0), 0 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 04:40:10,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 3699 transitions. [2025-01-09 04:40:10,481 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 3699 transitions. Word has length 56 [2025-01-09 04:40:10,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:10,481 INFO L471 AbstractCegarLoop]: Abstraction has 2719 states and 3699 transitions. [2025-01-09 04:40:10,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:10,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 3699 transitions. [2025-01-09 04:40:10,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 04:40:10,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:10,483 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:10,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:40:10,483 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:10,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:10,484 INFO L85 PathProgramCache]: Analyzing trace with hash -171160754, now seen corresponding path program 1 times [2025-01-09 04:40:10,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:10,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668147145] [2025-01-09 04:40:10,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:10,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:10,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 04:40:10,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 04:40:10,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:10,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:10,517 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 04:40:10,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:10,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668147145] [2025-01-09 04:40:10,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668147145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:10,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:10,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:10,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766617239] [2025-01-09 04:40:10,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:10,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:10,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:10,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:10,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:10,519 INFO L87 Difference]: Start difference. First operand 2719 states and 3699 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 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 04:40:10,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:10,576 INFO L93 Difference]: Finished difference Result 4995 states and 6854 transitions. [2025-01-09 04:40:10,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:10,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-01-09 04:40:10,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:10,580 INFO L225 Difference]: With dead ends: 4995 [2025-01-09 04:40:10,580 INFO L226 Difference]: Without dead ends: 3334 [2025-01-09 04:40:10,582 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 04:40:10,582 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 302 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:10,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 462 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:10,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2025-01-09 04:40:10,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 2583. [2025-01-09 04:40:10,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2583 states, 2579 states have (on average 1.3660333462582397) internal successors, (3523), 2582 states have internal predecessors, (3523), 0 states have call successors, (0), 0 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 04:40:10,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2583 states and 3523 transitions. [2025-01-09 04:40:10,602 INFO L78 Accepts]: Start accepts. Automaton has 2583 states and 3523 transitions. Word has length 57 [2025-01-09 04:40:10,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:10,603 INFO L471 AbstractCegarLoop]: Abstraction has 2583 states and 3523 transitions. [2025-01-09 04:40:10,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 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 04:40:10,603 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 3523 transitions. [2025-01-09 04:40:10,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 04:40:10,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:10,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:10,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:40:10,604 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:10,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:10,605 INFO L85 PathProgramCache]: Analyzing trace with hash -544179575, now seen corresponding path program 1 times [2025-01-09 04:40:10,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:10,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618698993] [2025-01-09 04:40:10,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:10,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:10,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 04:40:10,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 04:40:10,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:10,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:11,603 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 04:40:11,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:11,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618698993] [2025-01-09 04:40:11,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618698993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:11,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:11,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 04:40:11,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009414751] [2025-01-09 04:40:11,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:11,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 04:40:11,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:11,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 04:40:11,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:40:11,605 INFO L87 Difference]: Start difference. First operand 2583 states and 3523 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 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 04:40:13,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:13,281 INFO L93 Difference]: Finished difference Result 3799 states and 5202 transitions. [2025-01-09 04:40:13,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 04:40:13,282 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-01-09 04:40:13,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:13,287 INFO L225 Difference]: With dead ends: 3799 [2025-01-09 04:40:13,287 INFO L226 Difference]: Without dead ends: 3795 [2025-01-09 04:40:13,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=220, Invalid=1040, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 04:40:13,288 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 3319 mSDsluCounter, 3495 mSDsCounter, 0 mSdLazyCounter, 2122 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3319 SdHoareTripleChecker+Valid, 3788 SdHoareTripleChecker+Invalid, 2135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:13,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3319 Valid, 3788 Invalid, 2135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2122 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:40:13,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3795 states. [2025-01-09 04:40:13,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3795 to 2583. [2025-01-09 04:40:13,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2583 states, 2579 states have (on average 1.3656455990694067) internal successors, (3522), 2582 states have internal predecessors, (3522), 0 states have call successors, (0), 0 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 04:40:13,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2583 states and 3522 transitions. [2025-01-09 04:40:13,312 INFO L78 Accepts]: Start accepts. Automaton has 2583 states and 3522 transitions. Word has length 57 [2025-01-09 04:40:13,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:13,312 INFO L471 AbstractCegarLoop]: Abstraction has 2583 states and 3522 transitions. [2025-01-09 04:40:13,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 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 04:40:13,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 3522 transitions. [2025-01-09 04:40:13,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 04:40:13,314 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:13,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:13,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:40:13,314 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:13,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:13,315 INFO L85 PathProgramCache]: Analyzing trace with hash 303331698, now seen corresponding path program 1 times [2025-01-09 04:40:13,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:13,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417453849] [2025-01-09 04:40:13,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:13,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:13,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 04:40:13,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 04:40:13,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:13,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:13,675 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 04:40:13,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:13,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417453849] [2025-01-09 04:40:13,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417453849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:13,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:13,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 04:40:13,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199131347] [2025-01-09 04:40:13,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:13,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 04:40:13,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:13,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 04:40:13,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:40:13,677 INFO L87 Difference]: Start difference. First operand 2583 states and 3522 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 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 04:40:14,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:14,150 INFO L93 Difference]: Finished difference Result 4515 states and 6221 transitions. [2025-01-09 04:40:14,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:40:14,150 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-01-09 04:40:14,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:14,157 INFO L225 Difference]: With dead ends: 4515 [2025-01-09 04:40:14,157 INFO L226 Difference]: Without dead ends: 4149 [2025-01-09 04:40:14,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:40:14,159 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 2285 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2285 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:14,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2285 Valid, 1442 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:40:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4149 states. [2025-01-09 04:40:14,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4149 to 2520. [2025-01-09 04:40:14,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2520 states, 2518 states have (on average 1.368546465448769) internal successors, (3446), 2519 states have internal predecessors, (3446), 0 states have call successors, (0), 0 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 04:40:14,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2520 states and 3446 transitions. [2025-01-09 04:40:14,187 INFO L78 Accepts]: Start accepts. Automaton has 2520 states and 3446 transitions. Word has length 57 [2025-01-09 04:40:14,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:14,188 INFO L471 AbstractCegarLoop]: Abstraction has 2520 states and 3446 transitions. [2025-01-09 04:40:14,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 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 04:40:14,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2520 states and 3446 transitions. [2025-01-09 04:40:14,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 04:40:14,190 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:14,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:14,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:40:14,190 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:14,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:14,191 INFO L85 PathProgramCache]: Analyzing trace with hash 114355337, now seen corresponding path program 1 times [2025-01-09 04:40:14,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:14,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454872019] [2025-01-09 04:40:14,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:14,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:14,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 04:40:14,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 04:40:14,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:14,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:14,827 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 04:40:14,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:14,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454872019] [2025-01-09 04:40:14,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454872019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:14,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:14,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 04:40:14,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50760284] [2025-01-09 04:40:14,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:14,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 04:40:14,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:14,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 04:40:14,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:40:14,828 INFO L87 Difference]: Start difference. First operand 2520 states and 3446 transitions. Second operand has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 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 04:40:15,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:15,629 INFO L93 Difference]: Finished difference Result 3373 states and 4634 transitions. [2025-01-09 04:40:15,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 04:40:15,629 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 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 58 [2025-01-09 04:40:15,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:15,634 INFO L225 Difference]: With dead ends: 3373 [2025-01-09 04:40:15,634 INFO L226 Difference]: Without dead ends: 3247 [2025-01-09 04:40:15,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:40:15,635 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 997 mSDsluCounter, 1984 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 2232 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:15,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [997 Valid, 2232 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:40:15,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2025-01-09 04:40:15,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 2506. [2025-01-09 04:40:15,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2506 states, 2505 states have (on average 1.3688622754491018) internal successors, (3429), 2505 states have internal predecessors, (3429), 0 states have call successors, (0), 0 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 04:40:15,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 3429 transitions. [2025-01-09 04:40:15,660 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 3429 transitions. Word has length 58 [2025-01-09 04:40:15,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:15,660 INFO L471 AbstractCegarLoop]: Abstraction has 2506 states and 3429 transitions. [2025-01-09 04:40:15,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8666666666666667) internal successors, (58), 15 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 04:40:15,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 3429 transitions. [2025-01-09 04:40:15,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 04:40:15,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:15,664 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:15,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:40:15,664 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:15,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:15,664 INFO L85 PathProgramCache]: Analyzing trace with hash 485032383, now seen corresponding path program 1 times [2025-01-09 04:40:15,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:15,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776646672] [2025-01-09 04:40:15,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:15,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:15,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 04:40:15,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 04:40:15,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:15,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:15,734 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 04:40:15,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:15,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776646672] [2025-01-09 04:40:15,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776646672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:15,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:15,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:40:15,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059000656] [2025-01-09 04:40:15,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:15,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:40:15,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:15,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:40:15,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:40:15,737 INFO L87 Difference]: Start difference. First operand 2506 states and 3429 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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 04:40:15,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:15,827 INFO L93 Difference]: Finished difference Result 6084 states and 8543 transitions. [2025-01-09 04:40:15,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:40:15,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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 04:40:15,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:15,834 INFO L225 Difference]: With dead ends: 6084 [2025-01-09 04:40:15,834 INFO L226 Difference]: Without dead ends: 4573 [2025-01-09 04:40:15,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:40:15,837 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 1085 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:15,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 694 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:40:15,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4573 states. [2025-01-09 04:40:15,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4573 to 3910. [2025-01-09 04:40:15,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3910 states, 3909 states have (on average 1.3727295983627525) internal successors, (5366), 3909 states have internal predecessors, (5366), 0 states have call successors, (0), 0 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 04:40:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3910 states to 3910 states and 5366 transitions. [2025-01-09 04:40:15,894 INFO L78 Accepts]: Start accepts. Automaton has 3910 states and 5366 transitions. Word has length 66 [2025-01-09 04:40:15,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:15,894 INFO L471 AbstractCegarLoop]: Abstraction has 3910 states and 5366 transitions. [2025-01-09 04:40:15,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 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 04:40:15,894 INFO L276 IsEmpty]: Start isEmpty. Operand 3910 states and 5366 transitions. [2025-01-09 04:40:15,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 04:40:15,899 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:15,899 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:15,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:40:15,900 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:15,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:15,901 INFO L85 PathProgramCache]: Analyzing trace with hash -656464105, now seen corresponding path program 1 times [2025-01-09 04:40:15,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:15,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957133362] [2025-01-09 04:40:15,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:15,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:15,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 04:40:15,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 04:40:15,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:15,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:15,990 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 04:40:15,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:15,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957133362] [2025-01-09 04:40:15,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957133362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:15,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:15,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:40:15,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064190141] [2025-01-09 04:40:15,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:15,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:40:15,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:15,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:40:15,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:40:15,992 INFO L87 Difference]: Start difference. First operand 3910 states and 5366 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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 04:40:16,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:16,053 INFO L93 Difference]: Finished difference Result 3916 states and 5369 transitions. [2025-01-09 04:40:16,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:40:16,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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 04:40:16,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:16,062 INFO L225 Difference]: With dead ends: 3916 [2025-01-09 04:40:16,062 INFO L226 Difference]: Without dead ends: 3445 [2025-01-09 04:40:16,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:40:16,066 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 799 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:16,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 731 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:16,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3445 states. [2025-01-09 04:40:16,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3445 to 3441. [2025-01-09 04:40:16,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3441 states, 3440 states have (on average 1.3767441860465117) internal successors, (4736), 3440 states have internal predecessors, (4736), 0 states have call successors, (0), 0 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 04:40:16,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3441 states to 3441 states and 4736 transitions. [2025-01-09 04:40:16,103 INFO L78 Accepts]: Start accepts. Automaton has 3441 states and 4736 transitions. Word has length 67 [2025-01-09 04:40:16,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:16,104 INFO L471 AbstractCegarLoop]: Abstraction has 3441 states and 4736 transitions. [2025-01-09 04:40:16,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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 04:40:16,104 INFO L276 IsEmpty]: Start isEmpty. Operand 3441 states and 4736 transitions. [2025-01-09 04:40:16,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 04:40:16,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:16,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:16,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 04:40:16,108 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:16,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:16,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1272488439, now seen corresponding path program 1 times [2025-01-09 04:40:16,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:16,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577270199] [2025-01-09 04:40:16,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:16,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:16,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 04:40:16,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 04:40:16,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:16,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:16,175 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 04:40:16,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:16,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577270199] [2025-01-09 04:40:16,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577270199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:16,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:16,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:16,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823461466] [2025-01-09 04:40:16,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:16,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:16,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:16,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:16,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:16,176 INFO L87 Difference]: Start difference. First operand 3441 states and 4736 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 04:40:16,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:16,211 INFO L93 Difference]: Finished difference Result 8049 states and 11214 transitions. [2025-01-09 04:40:16,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:16,212 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 04:40:16,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:16,219 INFO L225 Difference]: With dead ends: 8049 [2025-01-09 04:40:16,220 INFO L226 Difference]: Without dead ends: 5645 [2025-01-09 04:40:16,222 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 04:40:16,223 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 138 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:16,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 575 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:16,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5645 states. [2025-01-09 04:40:16,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5645 to 5275. [2025-01-09 04:40:16,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5275 states, 5274 states have (on average 1.3830109973454683) internal successors, (7294), 5274 states have internal predecessors, (7294), 0 states have call successors, (0), 0 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 04:40:16,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5275 states to 5275 states and 7294 transitions. [2025-01-09 04:40:16,274 INFO L78 Accepts]: Start accepts. Automaton has 5275 states and 7294 transitions. Word has length 68 [2025-01-09 04:40:16,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:16,274 INFO L471 AbstractCegarLoop]: Abstraction has 5275 states and 7294 transitions. [2025-01-09 04:40:16,275 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 04:40:16,275 INFO L276 IsEmpty]: Start isEmpty. Operand 5275 states and 7294 transitions. [2025-01-09 04:40:16,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:40:16,278 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:16,278 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:16,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 04:40:16,278 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:16,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:16,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1794430615, now seen corresponding path program 1 times [2025-01-09 04:40:16,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:16,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315877101] [2025-01-09 04:40:16,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:16,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:16,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:40:16,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:40:16,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:16,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:16,342 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 04:40:16,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:16,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315877101] [2025-01-09 04:40:16,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315877101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:16,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:16,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:16,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426940078] [2025-01-09 04:40:16,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:16,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:16,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:16,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:16,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:16,344 INFO L87 Difference]: Start difference. First operand 5275 states and 7294 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 04:40:16,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:16,378 INFO L93 Difference]: Finished difference Result 13067 states and 18140 transitions. [2025-01-09 04:40:16,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:16,378 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 04:40:16,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:16,390 INFO L225 Difference]: With dead ends: 13067 [2025-01-09 04:40:16,390 INFO L226 Difference]: Without dead ends: 8577 [2025-01-09 04:40:16,396 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 04:40:16,397 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 134 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:16,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 571 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:16,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8577 states. [2025-01-09 04:40:16,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8577 to 7943. [2025-01-09 04:40:16,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7943 states, 7942 states have (on average 1.3669100982120372) internal successors, (10856), 7942 states have internal predecessors, (10856), 0 states have call successors, (0), 0 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 04:40:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7943 states to 7943 states and 10856 transitions. [2025-01-09 04:40:16,531 INFO L78 Accepts]: Start accepts. Automaton has 7943 states and 10856 transitions. Word has length 70 [2025-01-09 04:40:16,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:16,531 INFO L471 AbstractCegarLoop]: Abstraction has 7943 states and 10856 transitions. [2025-01-09 04:40:16,531 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 04:40:16,531 INFO L276 IsEmpty]: Start isEmpty. Operand 7943 states and 10856 transitions. [2025-01-09 04:40:16,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 04:40:16,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:16,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:16,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 04:40:16,534 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:16,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:16,535 INFO L85 PathProgramCache]: Analyzing trace with hash -530798665, now seen corresponding path program 1 times [2025-01-09 04:40:16,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:16,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733023357] [2025-01-09 04:40:16,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:16,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:16,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 04:40:16,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 04:40:16,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:16,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:16,599 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 04:40:16,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:16,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733023357] [2025-01-09 04:40:16,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733023357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:16,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:16,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:16,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409392655] [2025-01-09 04:40:16,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:16,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:16,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:16,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:16,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:16,602 INFO L87 Difference]: Start difference. First operand 7943 states and 10856 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 04:40:16,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:16,666 INFO L93 Difference]: Finished difference Result 21459 states and 29506 transitions. [2025-01-09 04:40:16,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:16,666 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 04:40:16,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:16,687 INFO L225 Difference]: With dead ends: 21459 [2025-01-09 04:40:16,687 INFO L226 Difference]: Without dead ends: 14301 [2025-01-09 04:40:16,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 04:40:16,697 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 103 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:16,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 552 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:16,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14301 states. [2025-01-09 04:40:16,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14301 to 13083. [2025-01-09 04:40:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13083 states, 13082 states have (on average 1.3640116190184988) internal successors, (17844), 13082 states have internal predecessors, (17844), 0 states have call successors, (0), 0 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 04:40:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13083 states to 13083 states and 17844 transitions. [2025-01-09 04:40:16,831 INFO L78 Accepts]: Start accepts. Automaton has 13083 states and 17844 transitions. Word has length 70 [2025-01-09 04:40:16,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:16,832 INFO L471 AbstractCegarLoop]: Abstraction has 13083 states and 17844 transitions. [2025-01-09 04:40:16,832 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 04:40:16,832 INFO L276 IsEmpty]: Start isEmpty. Operand 13083 states and 17844 transitions. [2025-01-09 04:40:16,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:40:16,834 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:16,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:16,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 04:40:16,834 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:16,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:16,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1176069985, now seen corresponding path program 1 times [2025-01-09 04:40:16,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:16,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869736010] [2025-01-09 04:40:16,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:16,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:16,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:40:16,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:40:16,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:16,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:16,974 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 04:40:16,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:16,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869736010] [2025-01-09 04:40:16,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869736010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:16,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:16,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:40:16,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489810732] [2025-01-09 04:40:16,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:16,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:40:16,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:16,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:40:16,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:40:16,975 INFO L87 Difference]: Start difference. First operand 13083 states and 17844 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 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 04:40:17,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:17,016 INFO L93 Difference]: Finished difference Result 14429 states and 19637 transitions. [2025-01-09 04:40:17,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:40:17,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 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 04:40:17,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:17,035 INFO L225 Difference]: With dead ends: 14429 [2025-01-09 04:40:17,036 INFO L226 Difference]: Without dead ends: 14427 [2025-01-09 04:40:17,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:40:17,039 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 0 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:17,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1375 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:17,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14427 states. [2025-01-09 04:40:17,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14427 to 14427. [2025-01-09 04:40:17,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14427 states, 14426 states have (on average 1.3300984333841674) internal successors, (19188), 14426 states have internal predecessors, (19188), 0 states have call successors, (0), 0 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 04:40:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14427 states to 14427 states and 19188 transitions. [2025-01-09 04:40:17,247 INFO L78 Accepts]: Start accepts. Automaton has 14427 states and 19188 transitions. Word has length 72 [2025-01-09 04:40:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:17,248 INFO L471 AbstractCegarLoop]: Abstraction has 14427 states and 19188 transitions. [2025-01-09 04:40:17,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 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 04:40:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 14427 states and 19188 transitions. [2025-01-09 04:40:17,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 04:40:17,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:17,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:17,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 04:40:17,251 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:17,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:17,252 INFO L85 PathProgramCache]: Analyzing trace with hash 406807320, now seen corresponding path program 1 times [2025-01-09 04:40:17,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:17,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160243286] [2025-01-09 04:40:17,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:17,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:17,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 04:40:17,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 04:40:17,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:17,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:17,291 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 04:40:17,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:17,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160243286] [2025-01-09 04:40:17,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160243286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:17,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:17,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:17,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077769163] [2025-01-09 04:40:17,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:17,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:17,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:17,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:17,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:17,292 INFO L87 Difference]: Start difference. First operand 14427 states and 19188 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 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 04:40:17,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:17,369 INFO L93 Difference]: Finished difference Result 34951 states and 46558 transitions. [2025-01-09 04:40:17,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:17,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 04:40:17,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:17,400 INFO L225 Difference]: With dead ends: 34951 [2025-01-09 04:40:17,400 INFO L226 Difference]: Without dead ends: 21309 [2025-01-09 04:40:17,414 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 04:40:17,415 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 196 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:17,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 406 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:17,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21309 states. [2025-01-09 04:40:17,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21309 to 21083. [2025-01-09 04:40:17,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21083 states, 21082 states have (on average 1.3101223792809031) internal successors, (27620), 21082 states have internal predecessors, (27620), 0 states have call successors, (0), 0 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 04:40:17,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21083 states to 21083 states and 27620 transitions. [2025-01-09 04:40:17,778 INFO L78 Accepts]: Start accepts. Automaton has 21083 states and 27620 transitions. Word has length 73 [2025-01-09 04:40:17,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:17,778 INFO L471 AbstractCegarLoop]: Abstraction has 21083 states and 27620 transitions. [2025-01-09 04:40:17,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 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 04:40:17,778 INFO L276 IsEmpty]: Start isEmpty. Operand 21083 states and 27620 transitions. [2025-01-09 04:40:17,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-09 04:40:17,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:17,781 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:17,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 04:40:17,781 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:17,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:17,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1519050461, now seen corresponding path program 1 times [2025-01-09 04:40:17,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:17,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470753296] [2025-01-09 04:40:17,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:17,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:17,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 04:40:17,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 04:40:17,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:17,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:17,847 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 04:40:17,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:17,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470753296] [2025-01-09 04:40:17,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470753296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:17,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:17,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:40:17,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488056549] [2025-01-09 04:40:17,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:17,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:40:17,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:17,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:40:17,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:40:17,848 INFO L87 Difference]: Start difference. First operand 21083 states and 27620 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 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 04:40:17,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:17,944 INFO L93 Difference]: Finished difference Result 31123 states and 41009 transitions. [2025-01-09 04:40:17,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:40:17,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-01-09 04:40:17,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:17,984 INFO L225 Difference]: With dead ends: 31123 [2025-01-09 04:40:17,984 INFO L226 Difference]: Without dead ends: 26453 [2025-01-09 04:40:17,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:40:17,995 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 664 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:17,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 821 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:18,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26453 states. [2025-01-09 04:40:18,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26453 to 24107. [2025-01-09 04:40:18,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24107 states, 24106 states have (on average 1.3072679001078569) internal successors, (31513), 24106 states have internal predecessors, (31513), 0 states have call successors, (0), 0 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 04:40:18,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24107 states to 24107 states and 31513 transitions. [2025-01-09 04:40:18,222 INFO L78 Accepts]: Start accepts. Automaton has 24107 states and 31513 transitions. Word has length 74 [2025-01-09 04:40:18,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:18,222 INFO L471 AbstractCegarLoop]: Abstraction has 24107 states and 31513 transitions. [2025-01-09 04:40:18,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 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 04:40:18,222 INFO L276 IsEmpty]: Start isEmpty. Operand 24107 states and 31513 transitions. [2025-01-09 04:40:18,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 04:40:18,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:18,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:18,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 04:40:18,225 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:18,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:18,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1077353059, now seen corresponding path program 1 times [2025-01-09 04:40:18,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:18,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776535273] [2025-01-09 04:40:18,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:18,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:18,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 04:40:18,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 04:40:18,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:18,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:18,434 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 04:40:18,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:18,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776535273] [2025-01-09 04:40:18,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776535273] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:18,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:18,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:40:18,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581329668] [2025-01-09 04:40:18,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:18,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:40:18,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:18,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:40:18,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:40:18,436 INFO L87 Difference]: Start difference. First operand 24107 states and 31513 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 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 04:40:18,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:18,557 INFO L93 Difference]: Finished difference Result 32463 states and 42637 transitions. [2025-01-09 04:40:18,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:40:18,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-01-09 04:40:18,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:18,602 INFO L225 Difference]: With dead ends: 32463 [2025-01-09 04:40:18,603 INFO L226 Difference]: Without dead ends: 27889 [2025-01-09 04:40:18,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:40:18,618 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 668 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:18,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 821 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:18,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27889 states. [2025-01-09 04:40:18,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27889 to 27075. [2025-01-09 04:40:18,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27075 states, 27074 states have (on average 1.3047573317574057) internal successors, (35325), 27074 states have internal predecessors, (35325), 0 states have call successors, (0), 0 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 04:40:18,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27075 states to 27075 states and 35325 transitions. [2025-01-09 04:40:18,959 INFO L78 Accepts]: Start accepts. Automaton has 27075 states and 35325 transitions. Word has length 76 [2025-01-09 04:40:18,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:18,959 INFO L471 AbstractCegarLoop]: Abstraction has 27075 states and 35325 transitions. [2025-01-09 04:40:18,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 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 04:40:18,959 INFO L276 IsEmpty]: Start isEmpty. Operand 27075 states and 35325 transitions. [2025-01-09 04:40:18,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 04:40:18,967 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:18,967 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:18,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 04:40:18,968 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:18,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:18,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1899335398, now seen corresponding path program 1 times [2025-01-09 04:40:18,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:18,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146986288] [2025-01-09 04:40:18,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:18,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:18,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 04:40:18,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 04:40:18,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:18,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:19,203 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 04:40:19,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:19,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146986288] [2025-01-09 04:40:19,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146986288] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:19,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:19,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:40:19,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216270481] [2025-01-09 04:40:19,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:19,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:40:19,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:19,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:40:19,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:40:19,205 INFO L87 Difference]: Start difference. First operand 27075 states and 35325 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 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 04:40:19,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:19,755 INFO L93 Difference]: Finished difference Result 52242 states and 67948 transitions. [2025-01-09 04:40:19,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 04:40:19,756 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-01-09 04:40:19,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:19,802 INFO L225 Difference]: With dead ends: 52242 [2025-01-09 04:40:19,802 INFO L226 Difference]: Without dead ends: 34248 [2025-01-09 04:40:19,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:40:19,824 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1168 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:19,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 922 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:40:19,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34248 states. [2025-01-09 04:40:20,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34248 to 26959. [2025-01-09 04:40:20,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26959 states, 26958 states have (on average 1.3050300467393723) internal successors, (35181), 26958 states have internal predecessors, (35181), 0 states have call successors, (0), 0 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 04:40:20,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26959 states to 26959 states and 35181 transitions. [2025-01-09 04:40:20,175 INFO L78 Accepts]: Start accepts. Automaton has 26959 states and 35181 transitions. Word has length 92 [2025-01-09 04:40:20,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:20,176 INFO L471 AbstractCegarLoop]: Abstraction has 26959 states and 35181 transitions. [2025-01-09 04:40:20,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 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 04:40:20,176 INFO L276 IsEmpty]: Start isEmpty. Operand 26959 states and 35181 transitions. [2025-01-09 04:40:20,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 04:40:20,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:20,183 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:40:20,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 04:40:20,183 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:20,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:20,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1332578409, now seen corresponding path program 1 times [2025-01-09 04:40:20,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:20,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197583745] [2025-01-09 04:40:20,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:20,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:20,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 04:40:20,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 04:40:20,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:20,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:20,725 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:20,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:20,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197583745] [2025-01-09 04:40:20,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197583745] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:40:20,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597041007] [2025-01-09 04:40:20,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:20,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:40:20,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:40:20,732 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 04:40:20,736 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 04:40:20,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 04:40:20,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 04:40:20,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:20,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:20,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 04:40:20,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:40:21,078 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:21,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:40:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:21,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597041007] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:40:21,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:40:21,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 19 [2025-01-09 04:40:21,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984795977] [2025-01-09 04:40:21,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:40:21,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 04:40:21,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:21,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 04:40:21,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:40:21,246 INFO L87 Difference]: Start difference. First operand 26959 states and 35181 transitions. Second operand has 19 states, 19 states have (on average 13.894736842105264) internal successors, (264), 19 states have internal predecessors, (264), 0 states have call successors, (0), 0 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 04:40:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:23,422 INFO L93 Difference]: Finished difference Result 132699 states and 171237 transitions. [2025-01-09 04:40:23,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-01-09 04:40:23,423 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 13.894736842105264) internal successors, (264), 19 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-01-09 04:40:23,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:23,572 INFO L225 Difference]: With dead ends: 132699 [2025-01-09 04:40:23,572 INFO L226 Difference]: Without dead ends: 106417 [2025-01-09 04:40:23,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1517 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=969, Invalid=4287, Unknown=0, NotChecked=0, Total=5256 [2025-01-09 04:40:23,622 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 4050 mSDsluCounter, 2161 mSDsCounter, 0 mSdLazyCounter, 2462 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4050 SdHoareTripleChecker+Valid, 2441 SdHoareTripleChecker+Invalid, 2506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:23,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4050 Valid, 2441 Invalid, 2506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2462 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 04:40:23,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106417 states. [2025-01-09 04:40:24,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106417 to 68983. [2025-01-09 04:40:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68983 states, 68982 states have (on average 1.2961787132875242) internal successors, (89413), 68982 states have internal predecessors, (89413), 0 states have call successors, (0), 0 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 04:40:24,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68983 states to 68983 states and 89413 transitions. [2025-01-09 04:40:24,713 INFO L78 Accepts]: Start accepts. Automaton has 68983 states and 89413 transitions. Word has length 92 [2025-01-09 04:40:24,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:24,713 INFO L471 AbstractCegarLoop]: Abstraction has 68983 states and 89413 transitions. [2025-01-09 04:40:24,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.894736842105264) internal successors, (264), 19 states have internal predecessors, (264), 0 states have call successors, (0), 0 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 04:40:24,713 INFO L276 IsEmpty]: Start isEmpty. Operand 68983 states and 89413 transitions. [2025-01-09 04:40:24,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 04:40:24,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:24,724 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:40:24,731 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 04:40:24,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:40:24,928 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:24,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:24,928 INFO L85 PathProgramCache]: Analyzing trace with hash 6796303, now seen corresponding path program 1 times [2025-01-09 04:40:24,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:24,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600528058] [2025-01-09 04:40:24,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:24,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:24,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 04:40:24,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 04:40:24,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:24,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:24,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:24,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600528058] [2025-01-09 04:40:24,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600528058] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:24,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:24,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:40:24,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878726172] [2025-01-09 04:40:24,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:24,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:40:24,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:24,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:40:24,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:40:24,993 INFO L87 Difference]: Start difference. First operand 68983 states and 89413 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 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 04:40:25,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:25,415 INFO L93 Difference]: Finished difference Result 139211 states and 180003 transitions. [2025-01-09 04:40:25,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:40:25,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-01-09 04:40:25,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:25,498 INFO L225 Difference]: With dead ends: 139211 [2025-01-09 04:40:25,499 INFO L226 Difference]: Without dead ends: 71025 [2025-01-09 04:40:25,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:40:25,546 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 504 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:25,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 492 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:40:25,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71025 states. [2025-01-09 04:40:26,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71025 to 66571. [2025-01-09 04:40:26,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66571 states, 66570 states have (on average 1.2732912723449001) internal successors, (84763), 66570 states have internal predecessors, (84763), 0 states have call successors, (0), 0 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 04:40:26,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66571 states to 66571 states and 84763 transitions. [2025-01-09 04:40:26,679 INFO L78 Accepts]: Start accepts. Automaton has 66571 states and 84763 transitions. Word has length 94 [2025-01-09 04:40:26,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:26,679 INFO L471 AbstractCegarLoop]: Abstraction has 66571 states and 84763 transitions. [2025-01-09 04:40:26,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 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 04:40:26,686 INFO L276 IsEmpty]: Start isEmpty. Operand 66571 states and 84763 transitions. [2025-01-09 04:40:26,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 04:40:26,702 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:26,702 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:40:26,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 04:40:26,702 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:26,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:26,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1742609083, now seen corresponding path program 1 times [2025-01-09 04:40:26,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:26,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55459878] [2025-01-09 04:40:26,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:26,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:26,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 04:40:26,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 04:40:26,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:26,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:26,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:26,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55459878] [2025-01-09 04:40:26,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55459878] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:26,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:26,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:40:26,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826352271] [2025-01-09 04:40:26,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:26,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:40:26,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:26,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:40:26,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:40:26,798 INFO L87 Difference]: Start difference. First operand 66571 states and 84763 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 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 04:40:27,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:27,044 INFO L93 Difference]: Finished difference Result 86727 states and 111133 transitions. [2025-01-09 04:40:27,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:40:27,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-01-09 04:40:27,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:27,135 INFO L225 Difference]: With dead ends: 86727 [2025-01-09 04:40:27,135 INFO L226 Difference]: Without dead ends: 76423 [2025-01-09 04:40:27,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:40:27,165 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 596 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:27,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 874 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:27,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76423 states. [2025-01-09 04:40:28,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76423 to 74151. [2025-01-09 04:40:28,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74151 states, 74150 states have (on average 1.2715441672285908) internal successors, (94285), 74150 states have internal predecessors, (94285), 0 states have call successors, (0), 0 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 04:40:28,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74151 states to 74151 states and 94285 transitions. [2025-01-09 04:40:28,571 INFO L78 Accepts]: Start accepts. Automaton has 74151 states and 94285 transitions. Word has length 98 [2025-01-09 04:40:28,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:28,571 INFO L471 AbstractCegarLoop]: Abstraction has 74151 states and 94285 transitions. [2025-01-09 04:40:28,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 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 04:40:28,571 INFO L276 IsEmpty]: Start isEmpty. Operand 74151 states and 94285 transitions. [2025-01-09 04:40:28,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:40:28,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:28,591 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:40:28,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 04:40:28,591 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:28,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:28,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1074075595, now seen corresponding path program 1 times [2025-01-09 04:40:28,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:28,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399163025] [2025-01-09 04:40:28,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:28,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:28,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:40:28,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:40:28,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:28,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:28,628 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 04:40:28,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:28,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399163025] [2025-01-09 04:40:28,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399163025] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:28,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:28,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:28,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99356021] [2025-01-09 04:40:28,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:28,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:28,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:28,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:28,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:28,630 INFO L87 Difference]: Start difference. First operand 74151 states and 94285 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:29,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:29,092 INFO L93 Difference]: Finished difference Result 138917 states and 176808 transitions. [2025-01-09 04:40:29,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:29,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-01-09 04:40:29,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:29,177 INFO L225 Difference]: With dead ends: 138917 [2025-01-09 04:40:29,177 INFO L226 Difference]: Without dead ends: 65563 [2025-01-09 04:40:29,202 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 04:40:29,203 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 208 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:29,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 250 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:40:29,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65563 states. [2025-01-09 04:40:29,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65563 to 64037. [2025-01-09 04:40:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64037 states, 64036 states have (on average 1.253685426947342) internal successors, (80281), 64036 states have internal predecessors, (80281), 0 states have call successors, (0), 0 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 04:40:30,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64037 states to 64037 states and 80281 transitions. [2025-01-09 04:40:30,007 INFO L78 Accepts]: Start accepts. Automaton has 64037 states and 80281 transitions. Word has length 99 [2025-01-09 04:40:30,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:30,008 INFO L471 AbstractCegarLoop]: Abstraction has 64037 states and 80281 transitions. [2025-01-09 04:40:30,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:30,008 INFO L276 IsEmpty]: Start isEmpty. Operand 64037 states and 80281 transitions. [2025-01-09 04:40:30,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 04:40:30,018 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:30,018 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:40:30,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 04:40:30,018 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:30,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:30,019 INFO L85 PathProgramCache]: Analyzing trace with hash 231609904, now seen corresponding path program 1 times [2025-01-09 04:40:30,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:30,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604412097] [2025-01-09 04:40:30,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:30,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:30,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:40:30,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:40:30,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:30,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:30,073 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:30,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:30,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604412097] [2025-01-09 04:40:30,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604412097] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:40:30,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629880713] [2025-01-09 04:40:30,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:30,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:40:30,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:40:30,076 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 04:40:30,077 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 04:40:30,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 04:40:30,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 04:40:30,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:30,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:30,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 04:40:30,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:40:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:30,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:40:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:30,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629880713] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:40:30,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:40:30,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-01-09 04:40:30,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403919458] [2025-01-09 04:40:30,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:40:30,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:40:30,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:30,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:40:30,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:40:30,646 INFO L87 Difference]: Start difference. First operand 64037 states and 80281 transitions. Second operand has 14 states, 14 states have (on average 18.642857142857142) internal successors, (261), 14 states have internal predecessors, (261), 0 states have call successors, (0), 0 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 04:40:31,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:31,409 INFO L93 Difference]: Finished difference Result 143502 states and 179778 transitions. [2025-01-09 04:40:31,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:40:31,410 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.642857142857142) internal successors, (261), 14 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-01-09 04:40:31,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:31,501 INFO L225 Difference]: With dead ends: 143502 [2025-01-09 04:40:31,502 INFO L226 Difference]: Without dead ends: 80153 [2025-01-09 04:40:31,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:40:31,542 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 2122 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2122 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:31,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2122 Valid, 1108 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:40:31,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80153 states. [2025-01-09 04:40:32,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80153 to 67636. [2025-01-09 04:40:32,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67636 states, 67635 states have (on average 1.2336364308420196) internal successors, (83437), 67635 states have internal predecessors, (83437), 0 states have call successors, (0), 0 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 04:40:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67636 states to 67636 states and 83437 transitions. [2025-01-09 04:40:32,231 INFO L78 Accepts]: Start accepts. Automaton has 67636 states and 83437 transitions. Word has length 99 [2025-01-09 04:40:32,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:32,232 INFO L471 AbstractCegarLoop]: Abstraction has 67636 states and 83437 transitions. [2025-01-09 04:40:32,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.642857142857142) internal successors, (261), 14 states have internal predecessors, (261), 0 states have call successors, (0), 0 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 04:40:32,232 INFO L276 IsEmpty]: Start isEmpty. Operand 67636 states and 83437 transitions. [2025-01-09 04:40:32,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 04:40:32,242 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:32,243 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:40:32,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 04:40:32,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:40:32,443 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:32,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:32,444 INFO L85 PathProgramCache]: Analyzing trace with hash 584387519, now seen corresponding path program 1 times [2025-01-09 04:40:32,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:32,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007682160] [2025-01-09 04:40:32,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:32,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:32,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 04:40:32,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 04:40:32,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:32,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:32,566 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:40:32,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:32,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007682160] [2025-01-09 04:40:32,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007682160] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:32,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:32,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:40:32,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572502900] [2025-01-09 04:40:32,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:32,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:40:32,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:32,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:40:32,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:40:32,569 INFO L87 Difference]: Start difference. First operand 67636 states and 83437 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:33,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:33,215 INFO L93 Difference]: Finished difference Result 99124 states and 120948 transitions. [2025-01-09 04:40:33,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:40:33,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2025-01-09 04:40:33,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:33,312 INFO L225 Difference]: With dead ends: 99124 [2025-01-09 04:40:33,312 INFO L226 Difference]: Without dead ends: 86196 [2025-01-09 04:40:33,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-01-09 04:40:33,341 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 1213 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1213 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:33,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1213 Valid, 509 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:40:33,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86196 states. [2025-01-09 04:40:34,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86196 to 67686. [2025-01-09 04:40:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67686 states, 67685 states have (on average 1.2335524857797149) internal successors, (83493), 67685 states have internal predecessors, (83493), 0 states have call successors, (0), 0 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 04:40:34,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67686 states to 67686 states and 83493 transitions. [2025-01-09 04:40:34,334 INFO L78 Accepts]: Start accepts. Automaton has 67686 states and 83493 transitions. Word has length 102 [2025-01-09 04:40:34,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:34,335 INFO L471 AbstractCegarLoop]: Abstraction has 67686 states and 83493 transitions. [2025-01-09 04:40:34,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand 67686 states and 83493 transitions. [2025-01-09 04:40:34,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 04:40:34,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:34,348 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:40:34,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 04:40:34,348 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:34,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:34,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1917669153, now seen corresponding path program 1 times [2025-01-09 04:40:34,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:34,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359520383] [2025-01-09 04:40:34,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:34,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:34,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 04:40:34,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 04:40:34,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:34,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:34,389 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:34,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:34,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359520383] [2025-01-09 04:40:34,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359520383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:34,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:34,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:34,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390145179] [2025-01-09 04:40:34,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:34,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:34,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:34,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:34,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:34,392 INFO L87 Difference]: Start difference. First operand 67686 states and 83493 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 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 04:40:34,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:34,585 INFO L93 Difference]: Finished difference Result 96894 states and 119388 transitions. [2025-01-09 04:40:34,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:34,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2025-01-09 04:40:34,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:34,667 INFO L225 Difference]: With dead ends: 96894 [2025-01-09 04:40:34,668 INFO L226 Difference]: Without dead ends: 77048 [2025-01-09 04:40:34,700 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 04:40:34,700 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 117 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:34,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 599 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:34,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77048 states. [2025-01-09 04:40:35,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77048 to 67686. [2025-01-09 04:40:35,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67686 states, 67685 states have (on average 1.2284701189332938) internal successors, (83149), 67685 states have internal predecessors, (83149), 0 states have call successors, (0), 0 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 04:40:35,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67686 states to 67686 states and 83149 transitions. [2025-01-09 04:40:35,492 INFO L78 Accepts]: Start accepts. Automaton has 67686 states and 83149 transitions. Word has length 102 [2025-01-09 04:40:35,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:35,492 INFO L471 AbstractCegarLoop]: Abstraction has 67686 states and 83149 transitions. [2025-01-09 04:40:35,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 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 04:40:35,493 INFO L276 IsEmpty]: Start isEmpty. Operand 67686 states and 83149 transitions. [2025-01-09 04:40:35,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 04:40:35,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:35,515 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, 1, 1, 1, 1, 1, 1, 1, 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 04:40:35,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 04:40:35,515 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:35,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:35,515 INFO L85 PathProgramCache]: Analyzing trace with hash 739978741, now seen corresponding path program 1 times [2025-01-09 04:40:35,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:35,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283082213] [2025-01-09 04:40:35,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:35,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:35,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:40:35,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:40:35,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:35,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:35,562 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 04:40:35,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:35,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283082213] [2025-01-09 04:40:35,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283082213] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:35,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:35,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:40:35,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20772609] [2025-01-09 04:40:35,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:35,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:40:35,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:35,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:40:35,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:40:35,565 INFO L87 Difference]: Start difference. First operand 67686 states and 83149 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:36,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:36,153 INFO L93 Difference]: Finished difference Result 144808 states and 176890 transitions. [2025-01-09 04:40:36,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:40:36,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-01-09 04:40:36,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:36,279 INFO L225 Difference]: With dead ends: 144808 [2025-01-09 04:40:36,279 INFO L226 Difference]: Without dead ends: 113100 [2025-01-09 04:40:36,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 04:40:36,318 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 155 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:36,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 679 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:40:36,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113100 states. [2025-01-09 04:40:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113100 to 83389. [2025-01-09 04:40:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83389 states, 83388 states have (on average 1.229709310692186) internal successors, (102543), 83388 states have internal predecessors, (102543), 0 states have call successors, (0), 0 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 04:40:37,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83389 states to 83389 states and 102543 transitions. [2025-01-09 04:40:37,470 INFO L78 Accepts]: Start accepts. Automaton has 83389 states and 102543 transitions. Word has length 103 [2025-01-09 04:40:37,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:37,470 INFO L471 AbstractCegarLoop]: Abstraction has 83389 states and 102543 transitions. [2025-01-09 04:40:37,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:40:37,470 INFO L276 IsEmpty]: Start isEmpty. Operand 83389 states and 102543 transitions. [2025-01-09 04:40:37,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 04:40:37,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:37,488 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, 1, 1, 1, 1, 1, 1, 1, 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 04:40:37,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 04:40:37,489 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:37,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:37,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1833657680, now seen corresponding path program 1 times [2025-01-09 04:40:37,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:37,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649133858] [2025-01-09 04:40:37,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:37,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:37,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:40:37,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:40:37,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:37,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:37,542 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:37,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:37,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649133858] [2025-01-09 04:40:37,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649133858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:37,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:37,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:40:37,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550938367] [2025-01-09 04:40:37,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:37,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:40:37,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:37,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:40:37,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:40:37,544 INFO L87 Difference]: Start difference. First operand 83389 states and 102543 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 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 04:40:38,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:38,234 INFO L93 Difference]: Finished difference Result 172768 states and 212330 transitions. [2025-01-09 04:40:38,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:40:38,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-01-09 04:40:38,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:38,362 INFO L225 Difference]: With dead ends: 172768 [2025-01-09 04:40:38,362 INFO L226 Difference]: Without dead ends: 125361 [2025-01-09 04:40:38,396 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 04:40:38,397 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 89 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:38,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 593 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:40:38,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125361 states. [2025-01-09 04:40:39,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125361 to 89691. [2025-01-09 04:40:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89691 states, 89690 states have (on average 1.2218864979373398) internal successors, (109591), 89690 states have internal predecessors, (109591), 0 states have call successors, (0), 0 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 04:40:39,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89691 states to 89691 states and 109591 transitions. [2025-01-09 04:40:39,416 INFO L78 Accepts]: Start accepts. Automaton has 89691 states and 109591 transitions. Word has length 103 [2025-01-09 04:40:39,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:39,417 INFO L471 AbstractCegarLoop]: Abstraction has 89691 states and 109591 transitions. [2025-01-09 04:40:39,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 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 04:40:39,417 INFO L276 IsEmpty]: Start isEmpty. Operand 89691 states and 109591 transitions. [2025-01-09 04:40:39,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 04:40:39,429 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:39,429 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:40:39,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 04:40:39,430 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:39,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:39,431 INFO L85 PathProgramCache]: Analyzing trace with hash -456455511, now seen corresponding path program 1 times [2025-01-09 04:40:39,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:39,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460151175] [2025-01-09 04:40:39,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:39,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:39,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:40:39,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:40:39,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:39,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:40,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:40,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460151175] [2025-01-09 04:40:40,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460151175] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:40:40,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422801439] [2025-01-09 04:40:40,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:40,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:40:40,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:40:40,122 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 04:40:40,125 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 04:40:40,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:40:40,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:40:40,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:40,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:40,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 04:40:40,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:40:41,525 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:41,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:40:42,961 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:42,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422801439] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:40:42,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:40:42,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 16] total 38 [2025-01-09 04:40:42,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986238945] [2025-01-09 04:40:42,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:40:42,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 04:40:42,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:42,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 04:40:42,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1308, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 04:40:42,964 INFO L87 Difference]: Start difference. First operand 89691 states and 109591 transitions. Second operand has 39 states, 39 states have (on average 7.153846153846154) internal successors, (279), 38 states have internal predecessors, (279), 0 states have call successors, (0), 0 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 04:40:47,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:47,809 INFO L93 Difference]: Finished difference Result 263103 states and 319738 transitions. [2025-01-09 04:40:47,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-01-09 04:40:47,809 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.153846153846154) internal successors, (279), 38 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-01-09 04:40:47,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:48,287 INFO L225 Difference]: With dead ends: 263103 [2025-01-09 04:40:48,290 INFO L226 Difference]: Without dead ends: 227055 [2025-01-09 04:40:48,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3787 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2223, Invalid=9333, Unknown=0, NotChecked=0, Total=11556 [2025-01-09 04:40:48,363 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 7202 mSDsluCounter, 4324 mSDsCounter, 0 mSdLazyCounter, 4196 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7202 SdHoareTripleChecker+Valid, 4554 SdHoareTripleChecker+Invalid, 4365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 4196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:48,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7202 Valid, 4554 Invalid, 4365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 4196 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 04:40:48,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227055 states. [2025-01-09 04:40:49,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227055 to 90212. [2025-01-09 04:40:49,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90212 states, 90211 states have (on average 1.221702453137644) internal successors, (110211), 90211 states have internal predecessors, (110211), 0 states have call successors, (0), 0 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 04:40:49,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90212 states to 90212 states and 110211 transitions. [2025-01-09 04:40:49,737 INFO L78 Accepts]: Start accepts. Automaton has 90212 states and 110211 transitions. Word has length 103 [2025-01-09 04:40:49,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:49,737 INFO L471 AbstractCegarLoop]: Abstraction has 90212 states and 110211 transitions. [2025-01-09 04:40:49,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.153846153846154) internal successors, (279), 38 states have internal predecessors, (279), 0 states have call successors, (0), 0 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 04:40:49,737 INFO L276 IsEmpty]: Start isEmpty. Operand 90212 states and 110211 transitions. [2025-01-09 04:40:49,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 04:40:49,750 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:49,750 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:40:49,757 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 04:40:49,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:40:49,955 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:49,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:49,956 INFO L85 PathProgramCache]: Analyzing trace with hash 12009594, now seen corresponding path program 1 times [2025-01-09 04:40:49,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:49,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287944889] [2025-01-09 04:40:49,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:49,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:49,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:40:49,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:40:49,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:49,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:50,011 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:50,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:50,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287944889] [2025-01-09 04:40:50,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287944889] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:40:50,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977180470] [2025-01-09 04:40:50,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:50,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:40:50,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:40:50,015 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 04:40:50,019 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 04:40:50,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:40:50,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:40:50,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:50,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:50,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 04:40:50,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:40:50,393 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:50,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:40:50,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:50,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977180470] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:40:50,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:40:50,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-01-09 04:40:50,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70041273] [2025-01-09 04:40:50,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:40:50,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 04:40:50,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:50,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 04:40:50,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-01-09 04:40:50,679 INFO L87 Difference]: Start difference. First operand 90212 states and 110211 transitions. Second operand has 14 states, 14 states have (on average 20.214285714285715) internal successors, (283), 14 states have internal predecessors, (283), 0 states have call successors, (0), 0 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 04:40:51,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:51,595 INFO L93 Difference]: Finished difference Result 203754 states and 247822 transitions. [2025-01-09 04:40:51,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:40:51,596 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.214285714285715) internal successors, (283), 14 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-01-09 04:40:51,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:51,722 INFO L225 Difference]: With dead ends: 203754 [2025-01-09 04:40:51,722 INFO L226 Difference]: Without dead ends: 114929 [2025-01-09 04:40:51,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:40:51,746 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 2066 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2066 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:51,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2066 Valid, 1044 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:40:51,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114929 states. [2025-01-09 04:40:52,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114929 to 99192. [2025-01-09 04:40:52,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99192 states, 99191 states have (on average 1.2182657700799469) internal successors, (120841), 99191 states have internal predecessors, (120841), 0 states have call successors, (0), 0 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 04:40:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99192 states to 99192 states and 120841 transitions. [2025-01-09 04:40:52,771 INFO L78 Accepts]: Start accepts. Automaton has 99192 states and 120841 transitions. Word has length 103 [2025-01-09 04:40:52,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:52,771 INFO L471 AbstractCegarLoop]: Abstraction has 99192 states and 120841 transitions. [2025-01-09 04:40:52,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.214285714285715) internal successors, (283), 14 states have internal predecessors, (283), 0 states have call successors, (0), 0 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 04:40:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 99192 states and 120841 transitions. [2025-01-09 04:40:52,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 04:40:52,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:52,784 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:40:52,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 04:40:52,985 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,SelfDestructingSolverStorable40 [2025-01-09 04:40:52,985 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:52,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:52,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1298923138, now seen corresponding path program 1 times [2025-01-09 04:40:52,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:52,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963220275] [2025-01-09 04:40:52,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:52,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:52,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:40:53,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:40:53,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:53,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:40:53,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:53,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963220275] [2025-01-09 04:40:53,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963220275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:53,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:40:53,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 04:40:53,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017888516] [2025-01-09 04:40:53,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:53,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 04:40:53,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:53,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 04:40:53,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:40:53,132 INFO L87 Difference]: Start difference. First operand 99192 states and 120841 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 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 04:40:53,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:53,850 INFO L93 Difference]: Finished difference Result 163797 states and 199299 transitions. [2025-01-09 04:40:53,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:40:53,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-01-09 04:40:53,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:53,966 INFO L225 Difference]: With dead ends: 163797 [2025-01-09 04:40:53,966 INFO L226 Difference]: Without dead ends: 99306 [2025-01-09 04:40:54,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:40:54,021 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 1440 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1440 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:54,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1440 Valid, 739 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:40:54,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99306 states. [2025-01-09 04:40:55,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99306 to 99096. [2025-01-09 04:40:55,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99096 states, 99095 states have (on average 1.2183258489328421) internal successors, (120730), 99095 states have internal predecessors, (120730), 0 states have call successors, (0), 0 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 04:40:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99096 states to 99096 states and 120730 transitions. [2025-01-09 04:40:55,195 INFO L78 Accepts]: Start accepts. Automaton has 99096 states and 120730 transitions. Word has length 103 [2025-01-09 04:40:55,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:55,195 INFO L471 AbstractCegarLoop]: Abstraction has 99096 states and 120730 transitions. [2025-01-09 04:40:55,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 8 states have internal predecessors, (98), 0 states have call successors, (0), 0 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 04:40:55,195 INFO L276 IsEmpty]: Start isEmpty. Operand 99096 states and 120730 transitions. [2025-01-09 04:40:55,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 04:40:55,209 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:55,209 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:40:55,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 04:40:55,209 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:55,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:55,210 INFO L85 PathProgramCache]: Analyzing trace with hash 851478806, now seen corresponding path program 1 times [2025-01-09 04:40:55,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:55,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008894485] [2025-01-09 04:40:55,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:55,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:55,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 04:40:55,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 04:40:55,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:55,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:55,601 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:55,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:40:55,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008894485] [2025-01-09 04:40:55,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008894485] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:40:55,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526898492] [2025-01-09 04:40:55,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:55,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:40:55,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:40:55,604 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 04:40:55,605 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 04:40:55,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 04:40:55,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 04:40:55,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:55,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:40:55,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 04:40:55,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:40:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:40:56,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:40:56,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526898492] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:40:56,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:40:56,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2025-01-09 04:40:56,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936801317] [2025-01-09 04:40:56,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:40:56,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 04:40:56,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:40:56,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 04:40:56,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2025-01-09 04:40:56,386 INFO L87 Difference]: Start difference. First operand 99096 states and 120730 transitions. Second operand has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 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 04:40:57,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:40:57,786 INFO L93 Difference]: Finished difference Result 176181 states and 215607 transitions. [2025-01-09 04:40:57,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 04:40:57,786 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-01-09 04:40:57,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:40:57,962 INFO L225 Difference]: With dead ends: 176181 [2025-01-09 04:40:57,962 INFO L226 Difference]: Without dead ends: 158785 [2025-01-09 04:40:58,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=884, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 04:40:58,008 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 794 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1816 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:40:58,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1816 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:40:58,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158785 states. [2025-01-09 04:40:59,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158785 to 119729. [2025-01-09 04:40:59,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119729 states, 119728 states have (on average 1.2209508218628893) internal successors, (146182), 119728 states have internal predecessors, (146182), 0 states have call successors, (0), 0 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 04:40:59,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119729 states to 119729 states and 146182 transitions. [2025-01-09 04:40:59,643 INFO L78 Accepts]: Start accepts. Automaton has 119729 states and 146182 transitions. Word has length 104 [2025-01-09 04:40:59,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:40:59,643 INFO L471 AbstractCegarLoop]: Abstraction has 119729 states and 146182 transitions. [2025-01-09 04:40:59,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 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 04:40:59,644 INFO L276 IsEmpty]: Start isEmpty. Operand 119729 states and 146182 transitions. [2025-01-09 04:40:59,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 04:40:59,658 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:40:59,658 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:40:59,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 04:40:59,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:40:59,859 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:40:59,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:40:59,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1362208024, now seen corresponding path program 1 times [2025-01-09 04:40:59,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:40:59,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253068888] [2025-01-09 04:40:59,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:40:59,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:40:59,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 04:40:59,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 04:40:59,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:40:59,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:41:00,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:00,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253068888] [2025-01-09 04:41:00,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253068888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:00,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:00,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 04:41:00,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246530228] [2025-01-09 04:41:00,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:00,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 04:41:00,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:00,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 04:41:00,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:41:00,025 INFO L87 Difference]: Start difference. First operand 119729 states and 146182 transitions. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 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 04:41:00,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:00,968 INFO L93 Difference]: Finished difference Result 188682 states and 230242 transitions. [2025-01-09 04:41:00,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 04:41:00,969 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-01-09 04:41:00,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:01,178 INFO L225 Difference]: With dead ends: 188682 [2025-01-09 04:41:01,178 INFO L226 Difference]: Without dead ends: 158501 [2025-01-09 04:41:01,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2025-01-09 04:41:01,218 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 1081 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:01,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 1020 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 04:41:01,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158501 states. [2025-01-09 04:41:02,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158501 to 136075. [2025-01-09 04:41:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136075 states, 136074 states have (on average 1.2195202610344371) internal successors, (165945), 136074 states have internal predecessors, (165945), 0 states have call successors, (0), 0 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 04:41:02,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136075 states to 136075 states and 165945 transitions. [2025-01-09 04:41:02,947 INFO L78 Accepts]: Start accepts. Automaton has 136075 states and 165945 transitions. Word has length 104 [2025-01-09 04:41:02,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:02,947 INFO L471 AbstractCegarLoop]: Abstraction has 136075 states and 165945 transitions. [2025-01-09 04:41:02,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 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 04:41:02,947 INFO L276 IsEmpty]: Start isEmpty. Operand 136075 states and 165945 transitions. [2025-01-09 04:41:02,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:41:02,967 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:02,968 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:41:02,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-09 04:41:02,968 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:02,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:02,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1549092557, now seen corresponding path program 1 times [2025-01-09 04:41:02,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:02,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619858698] [2025-01-09 04:41:02,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:02,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:02,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:41:03,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:41:03,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:03,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:41:03,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:03,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619858698] [2025-01-09 04:41:03,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619858698] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:41:03,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916922420] [2025-01-09 04:41:03,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:03,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:41:03,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:41:03,539 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 04:41:03,544 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 04:41:03,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:41:03,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:41:03,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:03,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:03,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 04:41:03,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:41:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:41:05,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:41:06,135 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:41:06,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916922420] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:41:06,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:41:06,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 39 [2025-01-09 04:41:06,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30494456] [2025-01-09 04:41:06,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:41:06,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 04:41:06,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:06,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 04:41:06,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1344, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 04:41:06,137 INFO L87 Difference]: Start difference. First operand 136075 states and 165945 transitions. Second operand has 39 states, 39 states have (on average 7.128205128205129) internal successors, (278), 39 states have internal predecessors, (278), 0 states have call successors, (0), 0 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 04:41:09,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:09,487 INFO L93 Difference]: Finished difference Result 205927 states and 250138 transitions. [2025-01-09 04:41:09,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-01-09 04:41:09,488 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.128205128205129) internal successors, (278), 39 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-01-09 04:41:09,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:09,716 INFO L225 Difference]: With dead ends: 205927 [2025-01-09 04:41:09,716 INFO L226 Difference]: Without dead ends: 192743 [2025-01-09 04:41:09,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 186 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1110, Invalid=5862, Unknown=0, NotChecked=0, Total=6972 [2025-01-09 04:41:09,775 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 3437 mSDsluCounter, 8349 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3437 SdHoareTripleChecker+Valid, 8750 SdHoareTripleChecker+Invalid, 2425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:09,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3437 Valid, 8750 Invalid, 2425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2367 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:41:09,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192743 states. [2025-01-09 04:41:11,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192743 to 136107. [2025-01-09 04:41:11,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136107 states, 136106 states have (on average 1.219468649434999) internal successors, (165977), 136106 states have internal predecessors, (165977), 0 states have call successors, (0), 0 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 04:41:11,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136107 states to 136107 states and 165977 transitions. [2025-01-09 04:41:11,506 INFO L78 Accepts]: Start accepts. Automaton has 136107 states and 165977 transitions. Word has length 105 [2025-01-09 04:41:11,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:11,506 INFO L471 AbstractCegarLoop]: Abstraction has 136107 states and 165977 transitions. [2025-01-09 04:41:11,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.128205128205129) internal successors, (278), 39 states have internal predecessors, (278), 0 states have call successors, (0), 0 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 04:41:11,507 INFO L276 IsEmpty]: Start isEmpty. Operand 136107 states and 165977 transitions. [2025-01-09 04:41:11,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:41:11,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:11,525 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:41:11,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 04:41:11,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-01-09 04:41:11,726 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:11,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:11,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1657592835, now seen corresponding path program 1 times [2025-01-09 04:41:11,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:11,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948327013] [2025-01-09 04:41:11,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:11,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:11,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:41:11,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:41:11,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:11,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:11,789 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:41:11,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:11,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948327013] [2025-01-09 04:41:11,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948327013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:11,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:11,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:41:11,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249581860] [2025-01-09 04:41:11,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:11,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:41:11,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:11,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:41:11,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:41:11,790 INFO L87 Difference]: Start difference. First operand 136107 states and 165977 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 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 04:41:12,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:12,631 INFO L93 Difference]: Finished difference Result 234261 states and 285042 transitions. [2025-01-09 04:41:12,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:41:12,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-01-09 04:41:12,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:12,780 INFO L225 Difference]: With dead ends: 234261 [2025-01-09 04:41:12,781 INFO L226 Difference]: Without dead ends: 99497 [2025-01-09 04:41:12,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:41:12,834 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 137 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:12,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 443 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:41:12,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99497 states. [2025-01-09 04:41:13,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99497 to 99069. [2025-01-09 04:41:14,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99069 states, 99068 states have (on average 1.1929583720272945) internal successors, (118184), 99068 states have internal predecessors, (118184), 0 states have call successors, (0), 0 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 04:41:14,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99069 states to 99069 states and 118184 transitions. [2025-01-09 04:41:14,173 INFO L78 Accepts]: Start accepts. Automaton has 99069 states and 118184 transitions. Word has length 105 [2025-01-09 04:41:14,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:14,173 INFO L471 AbstractCegarLoop]: Abstraction has 99069 states and 118184 transitions. [2025-01-09 04:41:14,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 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 04:41:14,174 INFO L276 IsEmpty]: Start isEmpty. Operand 99069 states and 118184 transitions. [2025-01-09 04:41:14,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:41:14,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:14,185 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:41:14,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-01-09 04:41:14,185 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:14,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:14,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1975472615, now seen corresponding path program 1 times [2025-01-09 04:41:14,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:14,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248301079] [2025-01-09 04:41:14,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:14,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:14,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:41:14,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:41:14,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:14,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:14,220 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:41:14,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:14,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248301079] [2025-01-09 04:41:14,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248301079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:41:14,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:41:14,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:41:14,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890563162] [2025-01-09 04:41:14,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:41:14,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:41:14,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:14,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:41:14,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:41:14,222 INFO L87 Difference]: Start difference. First operand 99069 states and 118184 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 04:41:14,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:41:14,455 INFO L93 Difference]: Finished difference Result 128265 states and 153436 transitions. [2025-01-09 04:41:14,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:41:14,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-01-09 04:41:14,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:41:14,544 INFO L225 Difference]: With dead ends: 128265 [2025-01-09 04:41:14,545 INFO L226 Difference]: Without dead ends: 90812 [2025-01-09 04:41:14,588 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 04:41:14,588 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 207 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:41:14,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 373 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:41:14,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90812 states. [2025-01-09 04:41:15,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90812 to 90774. [2025-01-09 04:41:15,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90774 states, 90773 states have (on average 1.1892633272008197) internal successors, (107953), 90773 states have internal predecessors, (107953), 0 states have call successors, (0), 0 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 04:41:15,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90774 states to 90774 states and 107953 transitions. [2025-01-09 04:41:15,997 INFO L78 Accepts]: Start accepts. Automaton has 90774 states and 107953 transitions. Word has length 105 [2025-01-09 04:41:15,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:41:15,997 INFO L471 AbstractCegarLoop]: Abstraction has 90774 states and 107953 transitions. [2025-01-09 04:41:15,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 04:41:15,998 INFO L276 IsEmpty]: Start isEmpty. Operand 90774 states and 107953 transitions. [2025-01-09 04:41:16,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 04:41:16,005 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:41:16,005 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:41:16,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-01-09 04:41:16,005 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 04:41:16,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:41:16,006 INFO L85 PathProgramCache]: Analyzing trace with hash -446747820, now seen corresponding path program 1 times [2025-01-09 04:41:16,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:41:16,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94394099] [2025-01-09 04:41:16,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:16,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:41:16,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:41:16,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:41:16,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:16,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:16,558 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:41:16,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:41:16,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94394099] [2025-01-09 04:41:16,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94394099] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:41:16,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535714833] [2025-01-09 04:41:16,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:41:16,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:41:16,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:41:16,560 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:41:16,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 04:41:16,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 04:41:16,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 04:41:16,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:41:16,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:41:16,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 04:41:16,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:41:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:41:18,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:41:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:41:19,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535714833] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:41:19,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:41:19,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 14] total 40 [2025-01-09 04:41:19,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692627963] [2025-01-09 04:41:19,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:41:19,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-01-09 04:41:19,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:41:19,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-01-09 04:41:19,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1415, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 04:41:19,362 INFO L87 Difference]: Start difference. First operand 90774 states and 107953 transitions. Second operand has 40 states, 40 states have (on average 6.5) internal successors, (260), 40 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)