./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef92e2cd363e9cbada9057da9935ca7963cc6741d3474fe25a5d63d0a08b0a5f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:47:59,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:47:59,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:47:59,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:47:59,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:47:59,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:47:59,847 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:47:59,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:47:59,847 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:47:59,848 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:47:59,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:47:59,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:47:59,849 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:47:59,849 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:47:59,849 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:47:59,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:47:59,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:47:59,850 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:47:59,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:47:59,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:47:59,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:47:59,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:47:59,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:47:59,852 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:47:59,852 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:47:59,853 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:47:59,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:47:59,853 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:47:59,854 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:47:59,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:47:59,854 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:47:59,854 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:47:59,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:47:59,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:47:59,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:47:59,855 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:47:59,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:47:59,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:47:59,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:47:59,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:47:59,857 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:47:59,857 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:47:59,857 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ef92e2cd363e9cbada9057da9935ca7963cc6741d3474fe25a5d63d0a08b0a5f [2024-11-11 21:48:00,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:48:00,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:48:00,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:48:00,105 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:48:00,106 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:48:00,107 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-11 21:48:01,562 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:48:01,838 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:48:01,839 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-11 21:48:01,861 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a99b8311f/f5188f4a9b0b4a29a0980aaf1969b6c8/FLAG59754d407 [2024-11-11 21:48:02,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a99b8311f/f5188f4a9b0b4a29a0980aaf1969b6c8 [2024-11-11 21:48:02,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:48:02,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:48:02,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:48:02,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:48:02,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:48:02,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:48:02" (1/1) ... [2024-11-11 21:48:02,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5566233c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:48:02, skipping insertion in model container [2024-11-11 21:48:02,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:48:02" (1/1) ... [2024-11-11 21:48:02,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:48:02,518 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15169,15182] [2024-11-11 21:48:02,565 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15816,15829] [2024-11-11 21:48:02,596 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17200,17213] [2024-11-11 21:48:02,612 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18176,18189] [2024-11-11 21:48:02,656 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27541,27554] [2024-11-11 21:48:02,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:48:02,699 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:48:02,744 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15169,15182] [2024-11-11 21:48:02,749 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15816,15829] [2024-11-11 21:48:02,755 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17200,17213] [2024-11-11 21:48:02,761 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18176,18189] [2024-11-11 21:48:02,787 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27541,27554] [2024-11-11 21:48:02,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:48:02,833 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:48:02,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:48:02 WrapperNode [2024-11-11 21:48:02,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:48:02,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:48:02,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:48:02,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:48:02,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:48:02" (1/1) ... [2024-11-11 21:48:02,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:48:02" (1/1) ... [2024-11-11 21:48:02,932 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1763 [2024-11-11 21:48:02,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:48:02,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:48:02,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:48:02,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:48:02,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:48:02" (1/1) ... [2024-11-11 21:48:02,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:48:02" (1/1) ... [2024-11-11 21:48:02,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:48:02" (1/1) ... [2024-11-11 21:48:02,977 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]. [2024-11-11 21:48:02,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:48:02" (1/1) ... [2024-11-11 21:48:02,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:48:02" (1/1) ... [2024-11-11 21:48:02,994 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:48:02" (1/1) ... [2024-11-11 21:48:03,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:48:02" (1/1) ... [2024-11-11 21:48:03,007 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:48:02" (1/1) ... [2024-11-11 21:48:03,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:48:02" (1/1) ... [2024-11-11 21:48:03,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:48:03,027 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:48:03,027 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:48:03,027 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:48:03,027 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:48:02" (1/1) ... [2024-11-11 21:48:03,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:48:03,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:48:03,059 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 21:48:03,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 21:48:03,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:48:03,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:48:03,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:48:03,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:48:03,255 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:48:03,257 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:48:04,276 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2024-11-11 21:48:04,277 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:48:04,303 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:48:04,303 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 21:48:04,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:48:04 BoogieIcfgContainer [2024-11-11 21:48:04,304 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:48:04,308 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:48:04,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:48:04,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:48:04,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:48:02" (1/3) ... [2024-11-11 21:48:04,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6868cbc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:48:04, skipping insertion in model container [2024-11-11 21:48:04,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:48:02" (2/3) ... [2024-11-11 21:48:04,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6868cbc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:48:04, skipping insertion in model container [2024-11-11 21:48:04,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:48:04" (3/3) ... [2024-11-11 21:48:04,316 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-11 21:48:04,330 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:48:04,331 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-11-11 21:48:04,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:48:04,411 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;@13724ff2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:48:04,411 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-11 21:48:04,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 411 states, 405 states have (on average 1.8098765432098765) internal successors, (733), 410 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:04,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 21:48:04,429 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:48:04,430 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:48:04,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:48:04,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:48:04,435 INFO L85 PathProgramCache]: Analyzing trace with hash -430745720, now seen corresponding path program 1 times [2024-11-11 21:48:04,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:48:04,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766665895] [2024-11-11 21:48:04,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:48:04,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:48:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:48:05,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:48:05,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:48:05,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766665895] [2024-11-11 21:48:05,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766665895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:48:05,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:48:05,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:48:05,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836794917] [2024-11-11 21:48:05,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:48:05,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:48:05,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:48:05,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:48:05,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:48:05,071 INFO L87 Difference]: Start difference. First operand has 411 states, 405 states have (on average 1.8098765432098765) internal successors, (733), 410 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:05,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:48:05,246 INFO L93 Difference]: Finished difference Result 753 states and 1326 transitions. [2024-11-11 21:48:05,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:48:05,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2024-11-11 21:48:05,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:48:05,269 INFO L225 Difference]: With dead ends: 753 [2024-11-11 21:48:05,269 INFO L226 Difference]: Without dead ends: 596 [2024-11-11 21:48:05,273 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 [2024-11-11 21:48:05,278 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 434 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:48:05,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1316 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:48:05,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-11-11 21:48:05,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 594. [2024-11-11 21:48:05,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 589 states have (on average 1.4736842105263157) internal successors, (868), 593 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:05,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 868 transitions. [2024-11-11 21:48:05,350 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 868 transitions. Word has length 147 [2024-11-11 21:48:05,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:48:05,351 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 868 transitions. [2024-11-11 21:48:05,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:05,351 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 868 transitions. [2024-11-11 21:48:05,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 21:48:05,355 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:48:05,355 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:48:05,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:48:05,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:48:05,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:48:05,356 INFO L85 PathProgramCache]: Analyzing trace with hash -734514301, now seen corresponding path program 1 times [2024-11-11 21:48:05,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:48:05,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591807717] [2024-11-11 21:48:05,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:48:05,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:48:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:48:05,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:48:05,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:48:05,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591807717] [2024-11-11 21:48:05,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591807717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:48:05,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:48:05,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:48:05,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565156278] [2024-11-11 21:48:05,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:48:05,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:48:05,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:48:05,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:48:05,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:48:05,608 INFO L87 Difference]: Start difference. First operand 594 states and 868 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:05,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:48:05,722 INFO L93 Difference]: Finished difference Result 1211 states and 1828 transitions. [2024-11-11 21:48:05,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:48:05,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2024-11-11 21:48:05,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:48:05,729 INFO L225 Difference]: With dead ends: 1211 [2024-11-11 21:48:05,730 INFO L226 Difference]: Without dead ends: 988 [2024-11-11 21:48:05,732 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 [2024-11-11 21:48:05,733 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 351 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:48:05,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 1080 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:48:05,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2024-11-11 21:48:05,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 986. [2024-11-11 21:48:05,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 981 states have (on average 1.4933741080530072) internal successors, (1465), 985 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:05,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1465 transitions. [2024-11-11 21:48:05,773 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1465 transitions. Word has length 147 [2024-11-11 21:48:05,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:48:05,773 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 1465 transitions. [2024-11-11 21:48:05,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:05,774 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1465 transitions. [2024-11-11 21:48:05,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 21:48:05,778 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:48:05,778 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:48:05,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:48:05,779 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:48:05,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:48:05,780 INFO L85 PathProgramCache]: Analyzing trace with hash -734945277, now seen corresponding path program 1 times [2024-11-11 21:48:05,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:48:05,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086057557] [2024-11-11 21:48:05,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:48:05,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:48:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:48:06,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:48:06,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:48:06,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086057557] [2024-11-11 21:48:06,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086057557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:48:06,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:48:06,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:48:06,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787698436] [2024-11-11 21:48:06,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:48:06,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:48:06,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:48:06,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:48:06,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:48:06,322 INFO L87 Difference]: Start difference. First operand 986 states and 1465 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:06,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:48:06,415 INFO L93 Difference]: Finished difference Result 3824 states and 5652 transitions. [2024-11-11 21:48:06,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:48:06,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2024-11-11 21:48:06,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:48:06,428 INFO L225 Difference]: With dead ends: 3824 [2024-11-11 21:48:06,429 INFO L226 Difference]: Without dead ends: 2863 [2024-11-11 21:48:06,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:48:06,433 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 1288 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1288 SdHoareTripleChecker+Valid, 1946 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:48:06,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1288 Valid, 1946 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:48:06,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2024-11-11 21:48:06,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 1878. [2024-11-11 21:48:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1878 states, 1873 states have (on average 1.4837159636946076) internal successors, (2779), 1877 states have internal predecessors, (2779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:06,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 2779 transitions. [2024-11-11 21:48:06,477 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 2779 transitions. Word has length 147 [2024-11-11 21:48:06,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:48:06,477 INFO L471 AbstractCegarLoop]: Abstraction has 1878 states and 2779 transitions. [2024-11-11 21:48:06,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:06,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 2779 transitions. [2024-11-11 21:48:06,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-11 21:48:06,480 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:48:06,480 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:48:06,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:48:06,481 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:48:06,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:48:06,482 INFO L85 PathProgramCache]: Analyzing trace with hash -464497969, now seen corresponding path program 1 times [2024-11-11 21:48:06,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:48:06,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163195475] [2024-11-11 21:48:06,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:48:06,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:48:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:48:06,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:48:06,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:48:06,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163195475] [2024-11-11 21:48:06,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163195475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:48:06,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:48:06,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:48:06,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935197302] [2024-11-11 21:48:06,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:48:06,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:48:06,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:48:06,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:48:06,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:48:06,583 INFO L87 Difference]: Start difference. First operand 1878 states and 2779 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:06,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:48:06,612 INFO L93 Difference]: Finished difference Result 3730 states and 5514 transitions. [2024-11-11 21:48:06,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:48:06,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2024-11-11 21:48:06,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:48:06,618 INFO L225 Difference]: With dead ends: 3730 [2024-11-11 21:48:06,618 INFO L226 Difference]: Without dead ends: 1880 [2024-11-11 21:48:06,620 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 [2024-11-11 21:48:06,621 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 0 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:48:06,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:48:06,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2024-11-11 21:48:06,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1880. [2024-11-11 21:48:06,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1875 states have (on average 1.4832) internal successors, (2781), 1879 states have internal predecessors, (2781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:06,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2781 transitions. [2024-11-11 21:48:06,652 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2781 transitions. Word has length 148 [2024-11-11 21:48:06,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:48:06,652 INFO L471 AbstractCegarLoop]: Abstraction has 1880 states and 2781 transitions. [2024-11-11 21:48:06,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:06,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2781 transitions. [2024-11-11 21:48:06,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-11 21:48:06,655 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:48:06,655 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:48:06,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:48:06,656 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:48:06,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:48:06,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1286115900, now seen corresponding path program 1 times [2024-11-11 21:48:06,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:48:06,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545256198] [2024-11-11 21:48:06,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:48:06,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:48:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:48:06,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:48:06,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:48:06,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545256198] [2024-11-11 21:48:06,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545256198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:48:06,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:48:06,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:48:06,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815074984] [2024-11-11 21:48:06,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:48:06,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:48:06,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:48:06,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:48:06,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:48:06,779 INFO L87 Difference]: Start difference. First operand 1880 states and 2781 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:48:06,836 INFO L93 Difference]: Finished difference Result 4936 states and 7287 transitions. [2024-11-11 21:48:06,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:48:06,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2024-11-11 21:48:06,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:48:06,845 INFO L225 Difference]: With dead ends: 4936 [2024-11-11 21:48:06,845 INFO L226 Difference]: Without dead ends: 3249 [2024-11-11 21:48:06,847 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 [2024-11-11 21:48:06,848 INFO L435 NwaCegarLoop]: 1065 mSDtfsCounter, 508 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:48:06,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 1599 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:48:06,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2024-11-11 21:48:06,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 3201. [2024-11-11 21:48:06,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 3196 states have (on average 1.4633917396745932) internal successors, (4677), 3200 states have internal predecessors, (4677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:06,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 4677 transitions. [2024-11-11 21:48:06,899 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 4677 transitions. Word has length 149 [2024-11-11 21:48:06,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:48:06,899 INFO L471 AbstractCegarLoop]: Abstraction has 3201 states and 4677 transitions. [2024-11-11 21:48:06,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:06,900 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 4677 transitions. [2024-11-11 21:48:06,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-11 21:48:06,903 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:48:06,903 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:48:06,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:48:06,903 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:48:06,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:48:06,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1559353287, now seen corresponding path program 1 times [2024-11-11 21:48:06,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:48:06,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135924631] [2024-11-11 21:48:06,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:48:06,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:48:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:48:07,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:48:07,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:48:07,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135924631] [2024-11-11 21:48:07,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135924631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:48:07,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:48:07,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:48:07,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515579560] [2024-11-11 21:48:07,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:48:07,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:48:07,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:48:07,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:48:07,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:48:07,451 INFO L87 Difference]: Start difference. First operand 3201 states and 4677 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:07,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:48:07,495 INFO L93 Difference]: Finished difference Result 5769 states and 8444 transitions. [2024-11-11 21:48:07,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:48:07,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2024-11-11 21:48:07,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:48:07,504 INFO L225 Difference]: With dead ends: 5769 [2024-11-11 21:48:07,507 INFO L226 Difference]: Without dead ends: 2749 [2024-11-11 21:48:07,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:48:07,513 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 25 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:48:07,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1831 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:48:07,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2749 states. [2024-11-11 21:48:07,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2749 to 2749. [2024-11-11 21:48:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2749 states, 2744 states have (on average 1.462463556851312) internal successors, (4013), 2748 states have internal predecessors, (4013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:07,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2749 states and 4013 transitions. [2024-11-11 21:48:07,604 INFO L78 Accepts]: Start accepts. Automaton has 2749 states and 4013 transitions. Word has length 149 [2024-11-11 21:48:07,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:48:07,604 INFO L471 AbstractCegarLoop]: Abstraction has 2749 states and 4013 transitions. [2024-11-11 21:48:07,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:07,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2749 states and 4013 transitions. [2024-11-11 21:48:07,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-11 21:48:07,609 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:48:07,609 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:48:07,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:48:07,610 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:48:07,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:48:07,613 INFO L85 PathProgramCache]: Analyzing trace with hash -828709836, now seen corresponding path program 1 times [2024-11-11 21:48:07,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:48:07,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18857098] [2024-11-11 21:48:07,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:48:07,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:48:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:48:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:48:07,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:48:07,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18857098] [2024-11-11 21:48:07,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18857098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:48:07,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:48:07,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:48:07,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737661789] [2024-11-11 21:48:07,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:48:07,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:48:07,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:48:07,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:48:07,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:48:07,779 INFO L87 Difference]: Start difference. First operand 2749 states and 4013 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:07,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:48:07,875 INFO L93 Difference]: Finished difference Result 6270 states and 9373 transitions. [2024-11-11 21:48:07,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:48:07,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2024-11-11 21:48:07,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:48:07,893 INFO L225 Difference]: With dead ends: 6270 [2024-11-11 21:48:07,896 INFO L226 Difference]: Without dead ends: 3703 [2024-11-11 21:48:07,904 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 [2024-11-11 21:48:07,905 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 233 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:48:07,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 1182 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:48:07,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3703 states. [2024-11-11 21:48:07,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3703 to 3617. [2024-11-11 21:48:07,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3617 states, 3612 states have (on average 1.5016611295681064) internal successors, (5424), 3616 states have internal predecessors, (5424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:07,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3617 states to 3617 states and 5424 transitions. [2024-11-11 21:48:07,992 INFO L78 Accepts]: Start accepts. Automaton has 3617 states and 5424 transitions. Word has length 150 [2024-11-11 21:48:07,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:48:07,992 INFO L471 AbstractCegarLoop]: Abstraction has 3617 states and 5424 transitions. [2024-11-11 21:48:07,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:07,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3617 states and 5424 transitions. [2024-11-11 21:48:07,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-11 21:48:07,995 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:48:07,995 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:48:07,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:48:07,996 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:48:07,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:48:07,996 INFO L85 PathProgramCache]: Analyzing trace with hash -2116909629, now seen corresponding path program 1 times [2024-11-11 21:48:07,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:48:07,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753238536] [2024-11-11 21:48:07,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:48:07,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:48:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:48:08,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:48:08,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:48:08,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753238536] [2024-11-11 21:48:08,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753238536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:48:08,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:48:08,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:48:08,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027725214] [2024-11-11 21:48:08,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:48:08,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:48:08,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:48:08,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:48:08,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:48:08,119 INFO L87 Difference]: Start difference. First operand 3617 states and 5424 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:08,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:48:08,206 INFO L93 Difference]: Finished difference Result 9270 states and 14128 transitions. [2024-11-11 21:48:08,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:48:08,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2024-11-11 21:48:08,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:48:08,227 INFO L225 Difference]: With dead ends: 9270 [2024-11-11 21:48:08,228 INFO L226 Difference]: Without dead ends: 5919 [2024-11-11 21:48:08,233 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 [2024-11-11 21:48:08,235 INFO L435 NwaCegarLoop]: 813 mSDtfsCounter, 352 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:48:08,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1239 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:48:08,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5919 states. [2024-11-11 21:48:08,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5919 to 5173. [2024-11-11 21:48:08,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5173 states, 5168 states have (on average 1.5369582043343653) internal successors, (7943), 5172 states have internal predecessors, (7943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:08,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5173 states to 5173 states and 7943 transitions. [2024-11-11 21:48:08,368 INFO L78 Accepts]: Start accepts. Automaton has 5173 states and 7943 transitions. Word has length 153 [2024-11-11 21:48:08,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:48:08,368 INFO L471 AbstractCegarLoop]: Abstraction has 5173 states and 7943 transitions. [2024-11-11 21:48:08,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:08,368 INFO L276 IsEmpty]: Start isEmpty. Operand 5173 states and 7943 transitions. [2024-11-11 21:48:08,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-11 21:48:08,371 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:48:08,371 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:48:08,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:48:08,372 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:48:08,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:48:08,372 INFO L85 PathProgramCache]: Analyzing trace with hash -520298944, now seen corresponding path program 1 times [2024-11-11 21:48:08,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:48:08,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085487380] [2024-11-11 21:48:08,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:48:08,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:48:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:48:08,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:48:08,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:48:08,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085487380] [2024-11-11 21:48:08,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085487380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:48:08,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:48:08,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:48:08,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060525456] [2024-11-11 21:48:08,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:48:08,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:48:08,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:48:08,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:48:08,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:48:08,539 INFO L87 Difference]: Start difference. First operand 5173 states and 7943 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:08,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:48:08,722 INFO L93 Difference]: Finished difference Result 10170 states and 15661 transitions. [2024-11-11 21:48:08,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:48:08,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2024-11-11 21:48:08,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:48:08,745 INFO L225 Difference]: With dead ends: 10170 [2024-11-11 21:48:08,746 INFO L226 Difference]: Without dead ends: 5173 [2024-11-11 21:48:08,756 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 [2024-11-11 21:48:08,756 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 1565 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1565 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:48:08,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1565 Valid, 554 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:48:08,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5173 states. [2024-11-11 21:48:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5173 to 5173. [2024-11-11 21:48:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5173 states, 5168 states have (on average 1.528250773993808) internal successors, (7898), 5172 states have internal predecessors, (7898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:08,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5173 states to 5173 states and 7898 transitions. [2024-11-11 21:48:08,913 INFO L78 Accepts]: Start accepts. Automaton has 5173 states and 7898 transitions. Word has length 153 [2024-11-11 21:48:08,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:48:08,914 INFO L471 AbstractCegarLoop]: Abstraction has 5173 states and 7898 transitions. [2024-11-11 21:48:08,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:08,914 INFO L276 IsEmpty]: Start isEmpty. Operand 5173 states and 7898 transitions. [2024-11-11 21:48:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-11 21:48:08,917 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:48:08,917 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:48:08,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:48:08,918 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:48:08,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:48:08,918 INFO L85 PathProgramCache]: Analyzing trace with hash 84319429, now seen corresponding path program 1 times [2024-11-11 21:48:08,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:48:08,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673214826] [2024-11-11 21:48:08,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:48:08,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:48:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:48:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:48:09,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:48:09,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673214826] [2024-11-11 21:48:09,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673214826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:48:09,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:48:09,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:48:09,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936011996] [2024-11-11 21:48:09,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:48:09,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:48:09,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:48:09,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:48:09,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:48:09,231 INFO L87 Difference]: Start difference. First operand 5173 states and 7898 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:09,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:48:09,343 INFO L93 Difference]: Finished difference Result 13554 states and 20689 transitions. [2024-11-11 21:48:09,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:48:09,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2024-11-11 21:48:09,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:48:09,358 INFO L225 Difference]: With dead ends: 13554 [2024-11-11 21:48:09,358 INFO L226 Difference]: Without dead ends: 8400 [2024-11-11 21:48:09,366 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 [2024-11-11 21:48:09,367 INFO L435 NwaCegarLoop]: 1015 mSDtfsCounter, 503 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 2525 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:48:09,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 2525 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:48:09,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8400 states. [2024-11-11 21:48:09,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8400 to 8366. [2024-11-11 21:48:09,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8366 states, 8361 states have (on average 1.5169238129410358) internal successors, (12683), 8365 states have internal predecessors, (12683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:09,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8366 states to 8366 states and 12683 transitions. [2024-11-11 21:48:09,546 INFO L78 Accepts]: Start accepts. Automaton has 8366 states and 12683 transitions. Word has length 153 [2024-11-11 21:48:09,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:48:09,546 INFO L471 AbstractCegarLoop]: Abstraction has 8366 states and 12683 transitions. [2024-11-11 21:48:09,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:09,547 INFO L276 IsEmpty]: Start isEmpty. Operand 8366 states and 12683 transitions. [2024-11-11 21:48:09,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-11 21:48:09,552 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:48:09,552 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:48:09,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:48:09,552 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:48:09,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:48:09,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1667235184, now seen corresponding path program 1 times [2024-11-11 21:48:09,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:48:09,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185380587] [2024-11-11 21:48:09,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:48:09,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:48:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:48:09,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:48:09,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:48:09,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185380587] [2024-11-11 21:48:09,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185380587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:48:09,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:48:09,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:48:09,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889676889] [2024-11-11 21:48:09,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:48:09,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:48:09,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:48:09,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:48:09,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:48:09,626 INFO L87 Difference]: Start difference. First operand 8366 states and 12683 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:09,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:48:09,680 INFO L93 Difference]: Finished difference Result 18337 states and 27785 transitions. [2024-11-11 21:48:09,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:48:09,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2024-11-11 21:48:09,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:48:09,699 INFO L225 Difference]: With dead ends: 18337 [2024-11-11 21:48:09,699 INFO L226 Difference]: Without dead ends: 11746 [2024-11-11 21:48:09,709 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 [2024-11-11 21:48:09,710 INFO L435 NwaCegarLoop]: 1050 mSDtfsCounter, 546 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:48:09,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1618 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:48:09,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11746 states. [2024-11-11 21:48:09,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11746 to 8366. [2024-11-11 21:48:09,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8366 states, 8361 states have (on average 1.5168042100227246) internal successors, (12682), 8365 states have internal predecessors, (12682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:09,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8366 states to 8366 states and 12682 transitions. [2024-11-11 21:48:09,984 INFO L78 Accepts]: Start accepts. Automaton has 8366 states and 12682 transitions. Word has length 154 [2024-11-11 21:48:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:48:09,985 INFO L471 AbstractCegarLoop]: Abstraction has 8366 states and 12682 transitions. [2024-11-11 21:48:09,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:09,985 INFO L276 IsEmpty]: Start isEmpty. Operand 8366 states and 12682 transitions. [2024-11-11 21:48:09,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-11 21:48:09,990 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:48:09,990 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:48:09,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:48:09,990 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:48:09,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:48:09,991 INFO L85 PathProgramCache]: Analyzing trace with hash -486384364, now seen corresponding path program 1 times [2024-11-11 21:48:09,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:48:09,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685517001] [2024-11-11 21:48:09,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:48:09,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:48:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:48:10,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:48:10,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:48:10,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685517001] [2024-11-11 21:48:10,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685517001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:48:10,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:48:10,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:48:10,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275956022] [2024-11-11 21:48:10,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:48:10,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:48:10,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:48:10,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:48:10,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:48:10,089 INFO L87 Difference]: Start difference. First operand 8366 states and 12682 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:10,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:48:10,184 INFO L93 Difference]: Finished difference Result 22553 states and 34204 transitions. [2024-11-11 21:48:10,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:48:10,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2024-11-11 21:48:10,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:48:10,209 INFO L225 Difference]: With dead ends: 22553 [2024-11-11 21:48:10,209 INFO L226 Difference]: Without dead ends: 14550 [2024-11-11 21:48:10,223 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 [2024-11-11 21:48:10,223 INFO L435 NwaCegarLoop]: 1039 mSDtfsCounter, 490 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:48:10,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1554 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:48:10,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14550 states. [2024-11-11 21:48:10,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14550 to 14520. [2024-11-11 21:48:10,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14520 states, 14515 states have (on average 1.4996899758870135) internal successors, (21768), 14519 states have internal predecessors, (21768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14520 states to 14520 states and 21768 transitions. [2024-11-11 21:48:10,474 INFO L78 Accepts]: Start accepts. Automaton has 14520 states and 21768 transitions. Word has length 155 [2024-11-11 21:48:10,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:48:10,474 INFO L471 AbstractCegarLoop]: Abstraction has 14520 states and 21768 transitions. [2024-11-11 21:48:10,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:10,475 INFO L276 IsEmpty]: Start isEmpty. Operand 14520 states and 21768 transitions. [2024-11-11 21:48:10,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-11 21:48:10,481 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:48:10,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:48:10,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:48:10,482 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:48:10,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:48:10,482 INFO L85 PathProgramCache]: Analyzing trace with hash 92409239, now seen corresponding path program 1 times [2024-11-11 21:48:10,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:48:10,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779879839] [2024-11-11 21:48:10,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:48:10,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:48:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:48:10,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:48:10,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:48:10,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779879839] [2024-11-11 21:48:10,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779879839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:48:10,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:48:10,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:48:10,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105345342] [2024-11-11 21:48:10,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:48:10,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:48:10,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:48:10,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:48:10,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:48:10,900 INFO L87 Difference]: Start difference. First operand 14520 states and 21768 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:11,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:48:11,061 INFO L93 Difference]: Finished difference Result 55749 states and 83295 transitions. [2024-11-11 21:48:11,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:48:11,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2024-11-11 21:48:11,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:48:11,126 INFO L225 Difference]: With dead ends: 55749 [2024-11-11 21:48:11,126 INFO L226 Difference]: Without dead ends: 41292 [2024-11-11 21:48:11,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:48:11,157 INFO L435 NwaCegarLoop]: 995 mSDtfsCounter, 1016 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 2019 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:48:11,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 2019 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:48:11,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41292 states. [2024-11-11 21:48:11,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41292 to 27830. [2024-11-11 21:48:11,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27830 states, 27825 states have (on average 1.4846720575022463) internal successors, (41311), 27829 states have internal predecessors, (41311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:11,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27830 states to 27830 states and 41311 transitions. [2024-11-11 21:48:11,732 INFO L78 Accepts]: Start accepts. Automaton has 27830 states and 41311 transitions. Word has length 155 [2024-11-11 21:48:11,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:48:11,732 INFO L471 AbstractCegarLoop]: Abstraction has 27830 states and 41311 transitions. [2024-11-11 21:48:11,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand 27830 states and 41311 transitions. [2024-11-11 21:48:11,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 21:48:11,744 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:48:11,745 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:48:11,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:48:11,745 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:48:11,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:48:11,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1955710595, now seen corresponding path program 1 times [2024-11-11 21:48:11,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:48:11,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134663911] [2024-11-11 21:48:11,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:48:11,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:48:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:48:11,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:48:11,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:48:11,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134663911] [2024-11-11 21:48:11,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134663911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:48:11,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:48:11,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:48:11,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372447950] [2024-11-11 21:48:11,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:48:11,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:48:11,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:48:11,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:48:11,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:48:11,811 INFO L87 Difference]: Start difference. First operand 27830 states and 41311 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:11,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:48:11,935 INFO L93 Difference]: Finished difference Result 55548 states and 82468 transitions. [2024-11-11 21:48:11,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:48:11,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2024-11-11 21:48:11,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:48:11,980 INFO L225 Difference]: With dead ends: 55548 [2024-11-11 21:48:11,981 INFO L226 Difference]: Without dead ends: 27838 [2024-11-11 21:48:12,005 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 [2024-11-11 21:48:12,005 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 0 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:48:12,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1142 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:48:12,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27838 states. [2024-11-11 21:48:12,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27838 to 27838. [2024-11-11 21:48:12,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27838 states, 27833 states have (on average 1.4845327488951963) internal successors, (41319), 27837 states have internal predecessors, (41319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:12,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27838 states to 27838 states and 41319 transitions. [2024-11-11 21:48:12,571 INFO L78 Accepts]: Start accepts. Automaton has 27838 states and 41319 transitions. Word has length 156 [2024-11-11 21:48:12,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:48:12,571 INFO L471 AbstractCegarLoop]: Abstraction has 27838 states and 41319 transitions. [2024-11-11 21:48:12,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:12,571 INFO L276 IsEmpty]: Start isEmpty. Operand 27838 states and 41319 transitions. [2024-11-11 21:48:12,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-11 21:48:12,584 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:48:12,584 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:48:12,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:48:12,584 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:48:12,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:48:12,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1660790966, now seen corresponding path program 1 times [2024-11-11 21:48:12,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:48:12,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770735769] [2024-11-11 21:48:12,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:48:12,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:48:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:48:13,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:48:13,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:48:13,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770735769] [2024-11-11 21:48:13,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770735769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:48:13,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:48:13,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:48:13,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923353165] [2024-11-11 21:48:13,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:48:13,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:48:13,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:48:13,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:48:13,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:48:13,265 INFO L87 Difference]: Start difference. First operand 27838 states and 41319 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:13,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:48:13,366 INFO L93 Difference]: Finished difference Result 46164 states and 68580 transitions. [2024-11-11 21:48:13,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:48:13,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2024-11-11 21:48:13,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:48:13,409 INFO L225 Difference]: With dead ends: 46164 [2024-11-11 21:48:13,409 INFO L226 Difference]: Without dead ends: 24882 [2024-11-11 21:48:13,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:48:13,430 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 17 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:48:13,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1785 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:48:13,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24882 states. [2024-11-11 21:48:13,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24882 to 24882. [2024-11-11 21:48:13,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24882 states, 24877 states have (on average 1.4833782208465651) internal successors, (36902), 24881 states have internal predecessors, (36902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:13,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24882 states to 24882 states and 36902 transitions. [2024-11-11 21:48:13,828 INFO L78 Accepts]: Start accepts. Automaton has 24882 states and 36902 transitions. Word has length 157 [2024-11-11 21:48:13,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:48:13,828 INFO L471 AbstractCegarLoop]: Abstraction has 24882 states and 36902 transitions. [2024-11-11 21:48:13,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:13,829 INFO L276 IsEmpty]: Start isEmpty. Operand 24882 states and 36902 transitions. [2024-11-11 21:48:13,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-11 21:48:13,839 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:48:13,839 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:48:13,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:48:13,840 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:48:13,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:48:13,840 INFO L85 PathProgramCache]: Analyzing trace with hash 894323527, now seen corresponding path program 1 times [2024-11-11 21:48:13,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:48:13,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840020731] [2024-11-11 21:48:13,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:48:13,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:48:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:48:13,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:48:13,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:48:13,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840020731] [2024-11-11 21:48:13,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840020731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:48:13,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:48:13,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:48:13,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938330057] [2024-11-11 21:48:13,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:48:13,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:48:13,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:48:13,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:48:13,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:48:13,926 INFO L87 Difference]: Start difference. First operand 24882 states and 36902 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:14,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:48:14,198 INFO L93 Difference]: Finished difference Result 59894 states and 89808 transitions. [2024-11-11 21:48:14,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:48:14,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-11-11 21:48:14,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:48:14,264 INFO L225 Difference]: With dead ends: 59894 [2024-11-11 21:48:14,264 INFO L226 Difference]: Without dead ends: 39800 [2024-11-11 21:48:14,284 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 [2024-11-11 21:48:14,285 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 310 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:48:14,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1211 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:48:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39800 states. [2024-11-11 21:48:15,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39800 to 35990. [2024-11-11 21:48:15,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35990 states, 35985 states have (on average 1.5114353202723356) internal successors, (54389), 35989 states have internal predecessors, (54389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:15,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35990 states to 35990 states and 54389 transitions. [2024-11-11 21:48:15,170 INFO L78 Accepts]: Start accepts. Automaton has 35990 states and 54389 transitions. Word has length 161 [2024-11-11 21:48:15,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:48:15,170 INFO L471 AbstractCegarLoop]: Abstraction has 35990 states and 54389 transitions. [2024-11-11 21:48:15,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:15,171 INFO L276 IsEmpty]: Start isEmpty. Operand 35990 states and 54389 transitions. [2024-11-11 21:48:15,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-11 21:48:15,181 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:48:15,181 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:48:15,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:48:15,182 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:48:15,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:48:15,182 INFO L85 PathProgramCache]: Analyzing trace with hash -2143076339, now seen corresponding path program 1 times [2024-11-11 21:48:15,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:48:15,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983081125] [2024-11-11 21:48:15,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:48:15,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:48:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:48:15,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:48:15,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:48:15,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983081125] [2024-11-11 21:48:15,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983081125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:48:15,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:48:15,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:48:15,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552956185] [2024-11-11 21:48:15,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:48:15,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:48:15,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:48:15,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:48:15,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:48:15,510 INFO L87 Difference]: Start difference. First operand 35990 states and 54389 transitions. Second operand has 8 states, 8 states have (on average 20.125) internal successors, (161), 7 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:16,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:48:16,447 INFO L93 Difference]: Finished difference Result 143698 states and 218247 transitions. [2024-11-11 21:48:16,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:48:16,448 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 7 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-11-11 21:48:16,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:48:16,697 INFO L225 Difference]: With dead ends: 143698 [2024-11-11 21:48:16,697 INFO L226 Difference]: Without dead ends: 108426 [2024-11-11 21:48:16,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2024-11-11 21:48:16,736 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 6234 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6234 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:48:16,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6234 Valid, 1452 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:48:16,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108426 states. [2024-11-11 21:48:17,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108426 to 57458. [2024-11-11 21:48:17,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57458 states, 57453 states have (on average 1.4953962369240945) internal successors, (85915), 57457 states have internal predecessors, (85915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57458 states to 57458 states and 85915 transitions. [2024-11-11 21:48:18,053 INFO L78 Accepts]: Start accepts. Automaton has 57458 states and 85915 transitions. Word has length 161 [2024-11-11 21:48:18,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:48:18,054 INFO L471 AbstractCegarLoop]: Abstraction has 57458 states and 85915 transitions. [2024-11-11 21:48:18,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.125) internal successors, (161), 7 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:18,054 INFO L276 IsEmpty]: Start isEmpty. Operand 57458 states and 85915 transitions. [2024-11-11 21:48:18,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-11 21:48:18,063 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:48:18,063 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:48:18,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 21:48:18,064 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:48:18,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:48:18,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1649820476, now seen corresponding path program 1 times [2024-11-11 21:48:18,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:48:18,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69688019] [2024-11-11 21:48:18,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:48:18,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:48:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:48:18,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:48:18,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:48:18,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69688019] [2024-11-11 21:48:18,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69688019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:48:18,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:48:18,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:48:18,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559068576] [2024-11-11 21:48:18,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:48:18,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:48:18,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:48:18,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:48:18,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:48:18,632 INFO L87 Difference]: Start difference. First operand 57458 states and 85915 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:18,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:48:18,898 INFO L93 Difference]: Finished difference Result 114878 states and 171775 transitions. [2024-11-11 21:48:18,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:48:18,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-11-11 21:48:18,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:48:18,983 INFO L225 Difference]: With dead ends: 114878 [2024-11-11 21:48:18,983 INFO L226 Difference]: Without dead ends: 57452 [2024-11-11 21:48:19,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:48:19,034 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 14 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:48:19,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1733 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:48:19,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57452 states. [2024-11-11 21:48:19,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57452 to 57452. [2024-11-11 21:48:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57452 states, 57447 states have (on average 1.4953435340400718) internal successors, (85903), 57451 states have internal predecessors, (85903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57452 states to 57452 states and 85903 transitions. [2024-11-11 21:48:20,219 INFO L78 Accepts]: Start accepts. Automaton has 57452 states and 85903 transitions. Word has length 161 [2024-11-11 21:48:20,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:48:20,219 INFO L471 AbstractCegarLoop]: Abstraction has 57452 states and 85903 transitions. [2024-11-11 21:48:20,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:20,219 INFO L276 IsEmpty]: Start isEmpty. Operand 57452 states and 85903 transitions. [2024-11-11 21:48:20,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-11 21:48:20,229 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:48:20,229 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:48:20,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 21:48:20,230 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:48:20,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:48:20,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1431815238, now seen corresponding path program 1 times [2024-11-11 21:48:20,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:48:20,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257677098] [2024-11-11 21:48:20,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:48:20,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:48:20,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:48:20,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:48:20,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:48:20,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257677098] [2024-11-11 21:48:20,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257677098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:48:20,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:48:20,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:48:20,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234412585] [2024-11-11 21:48:20,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:48:20,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:48:20,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:48:20,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:48:20,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:48:20,332 INFO L87 Difference]: Start difference. First operand 57452 states and 85903 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:20,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:48:20,816 INFO L93 Difference]: Finished difference Result 140607 states and 210074 transitions. [2024-11-11 21:48:20,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:48:20,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-11-11 21:48:20,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:48:20,948 INFO L225 Difference]: With dead ends: 140607 [2024-11-11 21:48:20,948 INFO L226 Difference]: Without dead ends: 83895 [2024-11-11 21:48:21,014 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 [2024-11-11 21:48:21,014 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 473 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:48:21,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 1552 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:48:21,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83895 states. [2024-11-11 21:48:22,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83895 to 83819. [2024-11-11 21:48:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83819 states, 83814 states have (on average 1.476817715417472) internal successors, (123778), 83818 states have internal predecessors, (123778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:22,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83819 states to 83819 states and 123778 transitions. [2024-11-11 21:48:22,672 INFO L78 Accepts]: Start accepts. Automaton has 83819 states and 123778 transitions. Word has length 161 [2024-11-11 21:48:22,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:48:22,672 INFO L471 AbstractCegarLoop]: Abstraction has 83819 states and 123778 transitions. [2024-11-11 21:48:22,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:22,672 INFO L276 IsEmpty]: Start isEmpty. Operand 83819 states and 123778 transitions. [2024-11-11 21:48:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-11 21:48:22,682 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:48:22,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:48:22,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 21:48:22,683 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:48:22,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:48:22,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1429871558, now seen corresponding path program 1 times [2024-11-11 21:48:22,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:48:22,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792298374] [2024-11-11 21:48:22,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:48:22,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:48:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:48:23,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:48:23,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:48:23,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792298374] [2024-11-11 21:48:23,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792298374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:48:23,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:48:23,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:48:23,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408315299] [2024-11-11 21:48:23,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:48:23,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:48:23,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:48:23,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:48:23,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:48:23,147 INFO L87 Difference]: Start difference. First operand 83819 states and 123778 transitions. Second operand has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 8 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:24,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:48:24,979 INFO L93 Difference]: Finished difference Result 399311 states and 589201 transitions. [2024-11-11 21:48:24,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 21:48:24,980 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 8 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2024-11-11 21:48:24,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:48:26,075 INFO L225 Difference]: With dead ends: 399311 [2024-11-11 21:48:26,075 INFO L226 Difference]: Without dead ends: 345711 [2024-11-11 21:48:26,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:48:26,142 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 5811 mSDsluCounter, 2297 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5811 SdHoareTripleChecker+Valid, 2747 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:48:26,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5811 Valid, 2747 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:48:26,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345711 states. [2024-11-11 21:48:30,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345711 to 203887. [2024-11-11 21:48:30,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203887 states, 203882 states have (on average 1.4851629864333291) internal successors, (302798), 203886 states have internal predecessors, (302798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203887 states to 203887 states and 302798 transitions. [2024-11-11 21:48:31,088 INFO L78 Accepts]: Start accepts. Automaton has 203887 states and 302798 transitions. Word has length 166 [2024-11-11 21:48:31,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:48:31,088 INFO L471 AbstractCegarLoop]: Abstraction has 203887 states and 302798 transitions. [2024-11-11 21:48:31,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 8 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:31,090 INFO L276 IsEmpty]: Start isEmpty. Operand 203887 states and 302798 transitions. [2024-11-11 21:48:31,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-11 21:48:31,115 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:48:31,115 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:48:31,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 21:48:31,115 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:48:31,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:48:31,116 INFO L85 PathProgramCache]: Analyzing trace with hash 745364345, now seen corresponding path program 1 times [2024-11-11 21:48:31,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:48:31,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389324576] [2024-11-11 21:48:31,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:48:31,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:48:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:48:31,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:48:31,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:48:31,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389324576] [2024-11-11 21:48:31,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389324576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:48:31,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:48:31,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:48:31,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136632951] [2024-11-11 21:48:31,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:48:31,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:48:31,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:48:31,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:48:31,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:48:31,382 INFO L87 Difference]: Start difference. First operand 203887 states and 302798 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:33,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:48:33,627 INFO L93 Difference]: Finished difference Result 452762 states and 681625 transitions. [2024-11-11 21:48:33,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:48:33,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2024-11-11 21:48:33,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:48:34,254 INFO L225 Difference]: With dead ends: 452762 [2024-11-11 21:48:34,254 INFO L226 Difference]: Without dead ends: 273585 [2024-11-11 21:48:34,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:48:34,412 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 640 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:48:34,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 1030 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:48:34,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273585 states. [2024-11-11 21:48:37,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273585 to 273583. [2024-11-11 21:48:38,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273583 states, 273578 states have (on average 1.4880874924153258) internal successors, (407108), 273582 states have internal predecessors, (407108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:39,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273583 states to 273583 states and 407108 transitions. [2024-11-11 21:48:39,724 INFO L78 Accepts]: Start accepts. Automaton has 273583 states and 407108 transitions. Word has length 166 [2024-11-11 21:48:39,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:48:39,725 INFO L471 AbstractCegarLoop]: Abstraction has 273583 states and 407108 transitions. [2024-11-11 21:48:39,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:39,725 INFO L276 IsEmpty]: Start isEmpty. Operand 273583 states and 407108 transitions. [2024-11-11 21:48:39,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-11 21:48:39,767 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:48:39,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:48:39,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 21:48:39,768 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:48:39,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:48:39,772 INFO L85 PathProgramCache]: Analyzing trace with hash 163774475, now seen corresponding path program 1 times [2024-11-11 21:48:39,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:48:39,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658397482] [2024-11-11 21:48:39,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:48:39,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:48:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:48:40,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:48:40,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:48:40,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658397482] [2024-11-11 21:48:40,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658397482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:48:40,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:48:40,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:48:40,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890873144] [2024-11-11 21:48:40,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:48:40,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:48:40,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:48:40,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:48:40,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:48:40,080 INFO L87 Difference]: Start difference. First operand 273583 states and 407108 transitions. Second operand has 8 states, 8 states have (on average 20.75) internal successors, (166), 7 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:44,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:48:44,738 INFO L93 Difference]: Finished difference Result 1007051 states and 1490322 transitions. [2024-11-11 21:48:44,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 21:48:44,746 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.75) internal successors, (166), 7 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2024-11-11 21:48:44,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:48:46,406 INFO L225 Difference]: With dead ends: 1007051 [2024-11-11 21:48:46,407 INFO L226 Difference]: Without dead ends: 742651 [2024-11-11 21:48:46,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2024-11-11 21:48:46,642 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 6607 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6607 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:48:46,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6607 Valid, 1372 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:48:47,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742651 states. [2024-11-11 21:48:54,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742651 to 355319. [2024-11-11 21:48:55,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355319 states, 355314 states have (on average 1.4658808828247691) internal successors, (520848), 355318 states have internal predecessors, (520848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:55,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355319 states to 355319 states and 520848 transitions. [2024-11-11 21:48:55,942 INFO L78 Accepts]: Start accepts. Automaton has 355319 states and 520848 transitions. Word has length 166 [2024-11-11 21:48:55,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:48:55,942 INFO L471 AbstractCegarLoop]: Abstraction has 355319 states and 520848 transitions. [2024-11-11 21:48:55,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.75) internal successors, (166), 7 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:48:55,943 INFO L276 IsEmpty]: Start isEmpty. Operand 355319 states and 520848 transitions. [2024-11-11 21:48:55,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-11 21:48:55,981 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:48:55,982 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:48:55,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 21:48:55,985 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:48:55,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:48:55,986 INFO L85 PathProgramCache]: Analyzing trace with hash 2011330745, now seen corresponding path program 1 times [2024-11-11 21:48:55,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:48:55,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219153804] [2024-11-11 21:48:55,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:48:55,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:48:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:48:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:48:56,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:48:56,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219153804] [2024-11-11 21:48:56,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219153804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:48:56,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:48:56,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:48:56,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443887087] [2024-11-11 21:48:56,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:48:56,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:48:56,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:48:56,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:48:56,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:48:56,271 INFO L87 Difference]: Start difference. First operand 355319 states and 520848 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)