./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.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_floodmax.3.3.ufo.BOUNDED-6.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 9674251da7d9ff9045cc98880d6752b693163f5c0467dc21f0f16b64a076bd08 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:28:19,439 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:28:19,535 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:28:19,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:28:19,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:28:19,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:28:19,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:28:19,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:28:19,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:28:19,569 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:28:19,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:28:19,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:28:19,570 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:28:19,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:28:19,571 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:28:19,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:28:19,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:28:19,574 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:28:19,574 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:28:19,575 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:28:19,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:28:19,577 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:28:19,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:28:19,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:28:19,581 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:28:19,581 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:28:19,581 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:28:19,581 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:28:19,582 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:28:19,582 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:28:19,582 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:28:19,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:28:19,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:28:19,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:28:19,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:28:19,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:28:19,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:28:19,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:28:19,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:28:19,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:28:19,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:28:19,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:28:19,588 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 -> 9674251da7d9ff9045cc98880d6752b693163f5c0467dc21f0f16b64a076bd08 [2024-11-11 21:28:19,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:28:19,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:28:19,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:28:19,902 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:28:19,903 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:28:19,904 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-11-11 21:28:21,436 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:28:21,728 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:28:21,731 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-11-11 21:28:21,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b85862378/b4f0c270f7c74c0f9bf25761e3e8c0c8/FLAG0fc084af7 [2024-11-11 21:28:22,017 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b85862378/b4f0c270f7c74c0f9bf25761e3e8c0c8 [2024-11-11 21:28:22,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:28:22,020 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:28:22,021 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:28:22,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:28:22,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:28:22,028 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:28:22" (1/1) ... [2024-11-11 21:28:22,029 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7319f4ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:28:22, skipping insertion in model container [2024-11-11 21:28:22,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:28:22" (1/1) ... [2024-11-11 21:28:22,093 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:28:22,496 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_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14166,14179] [2024-11-11 21:28:22,520 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_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15226,15239] [2024-11-11 21:28:22,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_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[26532,26545] [2024-11-11 21:28:22,608 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_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[27179,27192] [2024-11-11 21:28:22,631 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_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[28412,28425] [2024-11-11 21:28:22,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:28:22,685 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:28:22,802 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_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14166,14179] [2024-11-11 21:28:22,815 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_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[15226,15239] [2024-11-11 21:28:22,872 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_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[26532,26545] [2024-11-11 21:28:22,879 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_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[27179,27192] [2024-11-11 21:28:22,887 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_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[28412,28425] [2024-11-11 21:28:22,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:28:22,929 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:28:22,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:28:22 WrapperNode [2024-11-11 21:28:22,929 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:28:22,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:28:22,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:28:22,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:28:22,939 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:28:22" (1/1) ... [2024-11-11 21:28:22,962 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:28:22" (1/1) ... [2024-11-11 21:28:23,025 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1636 [2024-11-11 21:28:23,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:28:23,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:28:23,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:28:23,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:28:23,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:28:22" (1/1) ... [2024-11-11 21:28:23,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:28:22" (1/1) ... [2024-11-11 21:28:23,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:28:22" (1/1) ... [2024-11-11 21:28:23,088 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:28:23,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:28:22" (1/1) ... [2024-11-11 21:28:23,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:28:22" (1/1) ... [2024-11-11 21:28:23,117 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:28:22" (1/1) ... [2024-11-11 21:28:23,139 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:28:22" (1/1) ... [2024-11-11 21:28:23,148 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:28:22" (1/1) ... [2024-11-11 21:28:23,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:28:22" (1/1) ... [2024-11-11 21:28:23,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:28:23,170 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:28:23,171 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:28:23,171 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:28:23,172 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:28:22" (1/1) ... [2024-11-11 21:28:23,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:28:23,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:28:23,209 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:28:23,212 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:28:23,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:28:23,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:28:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:28:23,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:28:23,447 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:28:23,451 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:28:24,799 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-11-11 21:28:24,799 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:28:24,829 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:28:24,833 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 21:28:24,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:28:24 BoogieIcfgContainer [2024-11-11 21:28:24,834 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:28:24,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:28:24,838 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:28:24,842 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:28:24,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:28:22" (1/3) ... [2024-11-11 21:28:24,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7252e699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:28:24, skipping insertion in model container [2024-11-11 21:28:24,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:28:22" (2/3) ... [2024-11-11 21:28:24,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7252e699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:28:24, skipping insertion in model container [2024-11-11 21:28:24,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:28:24" (3/3) ... [2024-11-11 21:28:24,845 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-11-11 21:28:24,864 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:28:24,865 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-11-11 21:28:24,951 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:28:24,961 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;@7011b783, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:28:24,961 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-11 21:28:24,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 377 states, 371 states have (on average 1.8274932614555257) internal successors, (678), 376 states have internal predecessors, (678), 0 states have call successors, (0), 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:28:24,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-11 21:28:24,982 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:28:24,983 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:24,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:28:24,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:28:24,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1203570768, now seen corresponding path program 1 times [2024-11-11 21:28:25,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:28:25,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846535295] [2024-11-11 21:28:25,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:28:25,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:28:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:28:26,177 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:28:26,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:28:26,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846535295] [2024-11-11 21:28:26,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846535295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:28:26,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:28:26,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:28:26,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817067678] [2024-11-11 21:28:26,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:28:26,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:28:26,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:28:26,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:28:26,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:28:26,226 INFO L87 Difference]: Start difference. First operand has 377 states, 371 states have (on average 1.8274932614555257) internal successors, (678), 376 states have internal predecessors, (678), 0 states have call successors, (0), 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 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 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:28:26,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:28:26,495 INFO L93 Difference]: Finished difference Result 1434 states and 2591 transitions. [2024-11-11 21:28:26,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:28:26,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2024-11-11 21:28:26,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:28:26,526 INFO L225 Difference]: With dead ends: 1434 [2024-11-11 21:28:26,527 INFO L226 Difference]: Without dead ends: 1075 [2024-11-11 21:28:26,533 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:28:26,539 INFO L435 NwaCegarLoop]: 1180 mSDtfsCounter, 1239 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1239 SdHoareTripleChecker+Valid, 2418 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:28:26,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1239 Valid, 2418 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:28:26,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2024-11-11 21:28:26,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 701. [2024-11-11 21:28:26,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 696 states have (on average 1.4439655172413792) internal successors, (1005), 700 states have internal predecessors, (1005), 0 states have call successors, (0), 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:28:26,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1005 transitions. [2024-11-11 21:28:26,641 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1005 transitions. Word has length 139 [2024-11-11 21:28:26,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:28:26,641 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 1005 transitions. [2024-11-11 21:28:26,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 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:28:26,642 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1005 transitions. [2024-11-11 21:28:26,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-11 21:28:26,650 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:28:26,650 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] [2024-11-11 21:28:26,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:28:26,651 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:28:26,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:28:26,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1141139268, now seen corresponding path program 1 times [2024-11-11 21:28:26,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:28:26,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480675495] [2024-11-11 21:28:26,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:28:26,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:28:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:28:26,777 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:28:26,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:28:26,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480675495] [2024-11-11 21:28:26,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480675495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:28:26,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:28:26,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:28:26,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066691389] [2024-11-11 21:28:26,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:28:26,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:28:26,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:28:26,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:28:26,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:28:26,786 INFO L87 Difference]: Start difference. First operand 701 states and 1005 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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:28:26,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:28:26,821 INFO L93 Difference]: Finished difference Result 1376 states and 1966 transitions. [2024-11-11 21:28:26,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:28:26,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2024-11-11 21:28:26,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:28:26,824 INFO L225 Difference]: With dead ends: 1376 [2024-11-11 21:28:26,824 INFO L226 Difference]: Without dead ends: 703 [2024-11-11 21:28:26,828 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:28:26,830 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 0 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1070 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:28:26,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1070 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:28:26,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2024-11-11 21:28:26,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 703. [2024-11-11 21:28:26,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 698 states have (on average 1.4426934097421202) internal successors, (1007), 702 states have internal predecessors, (1007), 0 states have call successors, (0), 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:28:26,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1007 transitions. [2024-11-11 21:28:26,860 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1007 transitions. Word has length 140 [2024-11-11 21:28:26,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:28:26,862 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 1007 transitions. [2024-11-11 21:28:26,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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:28:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1007 transitions. [2024-11-11 21:28:26,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-11 21:28:26,867 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:28:26,867 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] [2024-11-11 21:28:26,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:28:26,868 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:28:26,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:28:26,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1084924930, now seen corresponding path program 1 times [2024-11-11 21:28:26,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:28:26,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955874437] [2024-11-11 21:28:26,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:28:26,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:28:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:28:27,029 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:28:27,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:28:27,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955874437] [2024-11-11 21:28:27,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955874437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:28:27,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:28:27,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:28:27,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672861658] [2024-11-11 21:28:27,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:28:27,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:28:27,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:28:27,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:28:27,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:28:27,035 INFO L87 Difference]: Start difference. First operand 703 states and 1007 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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:28:27,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:28:27,101 INFO L93 Difference]: Finished difference Result 1889 states and 2712 transitions. [2024-11-11 21:28:27,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:28:27,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2024-11-11 21:28:27,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:28:27,107 INFO L225 Difference]: With dead ends: 1889 [2024-11-11 21:28:27,108 INFO L226 Difference]: Without dead ends: 1364 [2024-11-11 21:28:27,109 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:28:27,110 INFO L435 NwaCegarLoop]: 985 mSDtfsCounter, 463 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1478 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:28:27,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1478 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:28:27,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2024-11-11 21:28:27,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1339. [2024-11-11 21:28:27,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 1334 states have (on average 1.4302848575712144) internal successors, (1908), 1338 states have internal predecessors, (1908), 0 states have call successors, (0), 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:28:27,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 1908 transitions. [2024-11-11 21:28:27,146 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 1908 transitions. Word has length 141 [2024-11-11 21:28:27,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:28:27,146 INFO L471 AbstractCegarLoop]: Abstraction has 1339 states and 1908 transitions. [2024-11-11 21:28:27,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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:28:27,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1908 transitions. [2024-11-11 21:28:27,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-11 21:28:27,150 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:28:27,150 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] [2024-11-11 21:28:27,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:28:27,151 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:28:27,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:28:27,152 INFO L85 PathProgramCache]: Analyzing trace with hash -980453119, now seen corresponding path program 1 times [2024-11-11 21:28:27,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:28:27,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122201030] [2024-11-11 21:28:27,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:28:27,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:28:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:28:27,733 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:28:27,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:28:27,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122201030] [2024-11-11 21:28:27,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122201030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:28:27,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:28:27,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:28:27,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240154929] [2024-11-11 21:28:27,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:28:27,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:28:27,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:28:27,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:28:27,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:28:27,736 INFO L87 Difference]: Start difference. First operand 1339 states and 1908 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 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:28:27,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:28:27,773 INFO L93 Difference]: Finished difference Result 2197 states and 3138 transitions. [2024-11-11 21:28:27,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:28:27,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2024-11-11 21:28:27,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:28:27,778 INFO L225 Difference]: With dead ends: 2197 [2024-11-11 21:28:27,778 INFO L226 Difference]: Without dead ends: 1026 [2024-11-11 21:28:27,781 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:28:27,784 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 25 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1690 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:28:27,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1690 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:28:27,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2024-11-11 21:28:27,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1026. [2024-11-11 21:28:27,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 1021 states have (on average 1.4240940254652301) internal successors, (1454), 1025 states have internal predecessors, (1454), 0 states have call successors, (0), 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:28:27,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1454 transitions. [2024-11-11 21:28:27,814 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1454 transitions. Word has length 141 [2024-11-11 21:28:27,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:28:27,815 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1454 transitions. [2024-11-11 21:28:27,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 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:28:27,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1454 transitions. [2024-11-11 21:28:27,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 21:28:27,817 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:28:27,817 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:28:27,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:28:27,818 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:28:27,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:28:27,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1168757507, now seen corresponding path program 1 times [2024-11-11 21:28:27,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:28:27,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510740255] [2024-11-11 21:28:27,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:28:27,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:28:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:28:27,942 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:28:27,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:28:27,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510740255] [2024-11-11 21:28:27,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510740255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:28:27,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:28:27,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:28:27,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066986987] [2024-11-11 21:28:27,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:28:27,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:28:27,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:28:27,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:28:27,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:28:27,947 INFO L87 Difference]: Start difference. First operand 1026 states and 1454 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:28:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:28:28,258 INFO L93 Difference]: Finished difference Result 2646 states and 3789 transitions. [2024-11-11 21:28:28,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:28:28,259 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:28:28,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:28:28,266 INFO L225 Difference]: With dead ends: 2646 [2024-11-11 21:28:28,268 INFO L226 Difference]: Without dead ends: 1873 [2024-11-11 21:28:28,270 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:28:28,270 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 390 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:28:28,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 917 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:28:28,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2024-11-11 21:28:28,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1848. [2024-11-11 21:28:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1848 states, 1843 states have (on average 1.427563754747694) internal successors, (2631), 1847 states have internal predecessors, (2631), 0 states have call successors, (0), 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:28:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2631 transitions. [2024-11-11 21:28:28,309 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2631 transitions. Word has length 147 [2024-11-11 21:28:28,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:28:28,311 INFO L471 AbstractCegarLoop]: Abstraction has 1848 states and 2631 transitions. [2024-11-11 21:28:28,311 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:28:28,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2631 transitions. [2024-11-11 21:28:28,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 21:28:28,314 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:28:28,315 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:28:28,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:28:28,315 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:28:28,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:28:28,316 INFO L85 PathProgramCache]: Analyzing trace with hash 668575330, now seen corresponding path program 1 times [2024-11-11 21:28:28,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:28:28,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509813779] [2024-11-11 21:28:28,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:28:28,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:28:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:28:28,852 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:28:28,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:28:28,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509813779] [2024-11-11 21:28:28,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509813779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:28:28,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:28:28,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:28:28,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775498532] [2024-11-11 21:28:28,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:28:28,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:28:28,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:28:28,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:28:28,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:28:28,856 INFO L87 Difference]: Start difference. First operand 1848 states and 2631 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:28:28,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:28:28,989 INFO L93 Difference]: Finished difference Result 3382 states and 4979 transitions. [2024-11-11 21:28:28,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:28:28,990 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:28:28,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:28:29,000 INFO L225 Difference]: With dead ends: 3382 [2024-11-11 21:28:29,000 INFO L226 Difference]: Without dead ends: 2810 [2024-11-11 21:28:29,002 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:28:29,003 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 614 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:28:29,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 1013 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:28:29,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2024-11-11 21:28:29,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 2808. [2024-11-11 21:28:29,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2808 states, 2803 states have (on average 1.4416696396717803) internal successors, (4041), 2807 states have internal predecessors, (4041), 0 states have call successors, (0), 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:28:29,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 4041 transitions. [2024-11-11 21:28:29,063 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 4041 transitions. Word has length 147 [2024-11-11 21:28:29,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:28:29,064 INFO L471 AbstractCegarLoop]: Abstraction has 2808 states and 4041 transitions. [2024-11-11 21:28:29,064 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:28:29,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 4041 transitions. [2024-11-11 21:28:29,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 21:28:29,068 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:28:29,068 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:28:29,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:28:29,069 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:28:29,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:28:29,070 INFO L85 PathProgramCache]: Analyzing trace with hash 2048583783, now seen corresponding path program 1 times [2024-11-11 21:28:29,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:28:29,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147065564] [2024-11-11 21:28:29,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:28:29,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:28:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:28:29,176 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:28:29,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:28:29,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147065564] [2024-11-11 21:28:29,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147065564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:28:29,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:28:29,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:28:29,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644387791] [2024-11-11 21:28:29,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:28:29,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:28:29,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:28:29,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:28:29,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:28:29,178 INFO L87 Difference]: Start difference. First operand 2808 states and 4041 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:28:29,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:28:29,264 INFO L93 Difference]: Finished difference Result 5536 states and 8267 transitions. [2024-11-11 21:28:29,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:28:29,266 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:28:29,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:28:29,281 INFO L225 Difference]: With dead ends: 5536 [2024-11-11 21:28:29,282 INFO L226 Difference]: Without dead ends: 4451 [2024-11-11 21:28:29,285 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:28:29,286 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 306 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:28:29,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 841 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:28:29,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4451 states. [2024-11-11 21:28:29,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4451 to 4449. [2024-11-11 21:28:29,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4449 states, 4444 states have (on average 1.4612961296129614) internal successors, (6494), 4448 states have internal predecessors, (6494), 0 states have call successors, (0), 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:28:29,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4449 states to 4449 states and 6494 transitions. [2024-11-11 21:28:29,397 INFO L78 Accepts]: Start accepts. Automaton has 4449 states and 6494 transitions. Word has length 147 [2024-11-11 21:28:29,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:28:29,397 INFO L471 AbstractCegarLoop]: Abstraction has 4449 states and 6494 transitions. [2024-11-11 21:28:29,398 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:28:29,398 INFO L276 IsEmpty]: Start isEmpty. Operand 4449 states and 6494 transitions. [2024-11-11 21:28:29,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 21:28:29,403 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:28:29,403 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:28:29,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:28:29,404 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:28:29,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:28:29,404 INFO L85 PathProgramCache]: Analyzing trace with hash -101387384, now seen corresponding path program 1 times [2024-11-11 21:28:29,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:28:29,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971942841] [2024-11-11 21:28:29,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:28:29,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:28:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:28:29,849 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:28:29,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:28:29,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971942841] [2024-11-11 21:28:29,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971942841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:28:29,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:28:29,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:28:29,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664415961] [2024-11-11 21:28:29,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:28:29,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:28:29,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:28:29,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:28:29,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:28:29,852 INFO L87 Difference]: Start difference. First operand 4449 states and 6494 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:28:29,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:28:29,997 INFO L93 Difference]: Finished difference Result 11588 states and 16902 transitions. [2024-11-11 21:28:29,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:28:29,998 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:28:29,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:28:30,026 INFO L225 Difference]: With dead ends: 11588 [2024-11-11 21:28:30,026 INFO L226 Difference]: Without dead ends: 7158 [2024-11-11 21:28:30,036 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:28:30,038 INFO L435 NwaCegarLoop]: 931 mSDtfsCounter, 465 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 2308 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:28:30,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 2308 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:28:30,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7158 states. [2024-11-11 21:28:30,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7158 to 7136. [2024-11-11 21:28:30,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7136 states, 7131 states have (on average 1.444818398541579) internal successors, (10303), 7135 states have internal predecessors, (10303), 0 states have call successors, (0), 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:28:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7136 states to 7136 states and 10303 transitions. [2024-11-11 21:28:30,271 INFO L78 Accepts]: Start accepts. Automaton has 7136 states and 10303 transitions. Word has length 147 [2024-11-11 21:28:30,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:28:30,271 INFO L471 AbstractCegarLoop]: Abstraction has 7136 states and 10303 transitions. [2024-11-11 21:28:30,272 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:28:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 7136 states and 10303 transitions. [2024-11-11 21:28:30,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-11 21:28:30,281 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:28:30,281 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:28:30,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:28:30,282 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:28:30,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:28:30,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1357805037, now seen corresponding path program 1 times [2024-11-11 21:28:30,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:28:30,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12072978] [2024-11-11 21:28:30,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:28:30,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:28:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:28:30,367 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:28:30,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:28:30,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12072978] [2024-11-11 21:28:30,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12072978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:28:30,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:28:30,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:28:30,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017672218] [2024-11-11 21:28:30,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:28:30,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:28:30,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:28:30,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:28:30,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:28:30,369 INFO L87 Difference]: Start difference. First operand 7136 states and 10303 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:28:30,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:28:30,453 INFO L93 Difference]: Finished difference Result 15599 states and 22500 transitions. [2024-11-11 21:28:30,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:28:30,456 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:28:30,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:28:30,489 INFO L225 Difference]: With dead ends: 15599 [2024-11-11 21:28:30,489 INFO L226 Difference]: Without dead ends: 10015 [2024-11-11 21:28:30,499 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:28:30,500 INFO L435 NwaCegarLoop]: 972 mSDtfsCounter, 505 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1501 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:28:30,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1501 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:28:30,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10015 states. [2024-11-11 21:28:30,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10015 to 7136. [2024-11-11 21:28:30,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7136 states, 7131 states have (on average 1.4446781657551535) internal successors, (10302), 7135 states have internal predecessors, (10302), 0 states have call successors, (0), 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:28:30,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7136 states to 7136 states and 10302 transitions. [2024-11-11 21:28:30,694 INFO L78 Accepts]: Start accepts. Automaton has 7136 states and 10302 transitions. Word has length 148 [2024-11-11 21:28:30,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:28:30,695 INFO L471 AbstractCegarLoop]: Abstraction has 7136 states and 10302 transitions. [2024-11-11 21:28:30,695 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:28:30,695 INFO L276 IsEmpty]: Start isEmpty. Operand 7136 states and 10302 transitions. [2024-11-11 21:28:30,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-11 21:28:30,703 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:28:30,703 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:28:30,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:28:30,703 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:28:30,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:28:30,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1272506948, now seen corresponding path program 1 times [2024-11-11 21:28:30,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:28:30,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789026060] [2024-11-11 21:28:30,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:28:30,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:28:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:28:30,833 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:28:30,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:28:30,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789026060] [2024-11-11 21:28:30,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789026060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:28:30,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:28:30,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:28:30,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756838434] [2024-11-11 21:28:30,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:28:30,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:28:30,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:28:30,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:28:30,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:28:30,835 INFO L87 Difference]: Start difference. First operand 7136 states and 10302 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:28:30,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:28:30,945 INFO L93 Difference]: Finished difference Result 20323 states and 29354 transitions. [2024-11-11 21:28:30,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:28:30,946 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:28:30,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:28:30,977 INFO L225 Difference]: With dead ends: 20323 [2024-11-11 21:28:30,977 INFO L226 Difference]: Without dead ends: 13660 [2024-11-11 21:28:30,990 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:28:30,991 INFO L435 NwaCegarLoop]: 1004 mSDtfsCounter, 453 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1486 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:28:30,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1486 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:28:31,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13660 states. [2024-11-11 21:28:31,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13660 to 13640. [2024-11-11 21:28:31,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13640 states, 13635 states have (on average 1.4280894756142282) internal successors, (19472), 13639 states have internal predecessors, (19472), 0 states have call successors, (0), 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:28:31,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13640 states to 13640 states and 19472 transitions. [2024-11-11 21:28:31,462 INFO L78 Accepts]: Start accepts. Automaton has 13640 states and 19472 transitions. Word has length 149 [2024-11-11 21:28:31,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:28:31,463 INFO L471 AbstractCegarLoop]: Abstraction has 13640 states and 19472 transitions. [2024-11-11 21:28:31,463 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:28:31,464 INFO L276 IsEmpty]: Start isEmpty. Operand 13640 states and 19472 transitions. [2024-11-11 21:28:31,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-11 21:28:31,492 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:28:31,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:31,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:28:31,492 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:28:31,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:28:31,493 INFO L85 PathProgramCache]: Analyzing trace with hash -235144953, now seen corresponding path program 1 times [2024-11-11 21:28:31,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:28:31,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683095384] [2024-11-11 21:28:31,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:28:31,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:28:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:28:31,917 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:28:31,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:28:31,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683095384] [2024-11-11 21:28:31,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683095384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:28:31,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:28:31,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:28:31,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953333900] [2024-11-11 21:28:31,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:28:31,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:28:31,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:28:31,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:28:31,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:28:31,920 INFO L87 Difference]: Start difference. First operand 13640 states and 19472 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:28:32,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:28:32,244 INFO L93 Difference]: Finished difference Result 66113 states and 94069 transitions. [2024-11-11 21:28:32,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:28:32,245 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:28:32,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:28:32,364 INFO L225 Difference]: With dead ends: 66113 [2024-11-11 21:28:32,364 INFO L226 Difference]: Without dead ends: 52520 [2024-11-11 21:28:32,408 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:28:32,409 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 1496 mSDsluCounter, 1454 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 2377 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:28:32,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 2377 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:28:32,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52520 states. [2024-11-11 21:28:33,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52520 to 26279. [2024-11-11 21:28:33,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26279 states, 26274 states have (on average 1.4086930044911319) internal successors, (37012), 26278 states have internal predecessors, (37012), 0 states have call successors, (0), 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:28:33,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26279 states to 26279 states and 37012 transitions. [2024-11-11 21:28:33,319 INFO L78 Accepts]: Start accepts. Automaton has 26279 states and 37012 transitions. Word has length 149 [2024-11-11 21:28:33,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:28:33,319 INFO L471 AbstractCegarLoop]: Abstraction has 26279 states and 37012 transitions. [2024-11-11 21:28:33,319 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:28:33,320 INFO L276 IsEmpty]: Start isEmpty. Operand 26279 states and 37012 transitions. [2024-11-11 21:28:33,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-11 21:28:33,348 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:28:33,348 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:28:33,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:28:33,348 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:28:33,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:28:33,349 INFO L85 PathProgramCache]: Analyzing trace with hash 2003751507, now seen corresponding path program 1 times [2024-11-11 21:28:33,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:28:33,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161329405] [2024-11-11 21:28:33,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:28:33,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:28:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:28:33,430 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:28:33,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:28:33,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161329405] [2024-11-11 21:28:33,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161329405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:28:33,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:28:33,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:28:33,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791652110] [2024-11-11 21:28:33,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:28:33,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:28:33,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:28:33,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:28:33,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:28:33,433 INFO L87 Difference]: Start difference. First operand 26279 states and 37012 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:28:33,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:28:33,772 INFO L93 Difference]: Finished difference Result 52446 states and 73873 transitions. [2024-11-11 21:28:33,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:28:33,781 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:28:33,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:28:33,959 INFO L225 Difference]: With dead ends: 52446 [2024-11-11 21:28:33,959 INFO L226 Difference]: Without dead ends: 26287 [2024-11-11 21:28:33,998 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:28:34,003 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 0 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1064 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:28:34,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1064 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:28:34,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26287 states. [2024-11-11 21:28:34,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26287 to 26287. [2024-11-11 21:28:34,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26287 states, 26282 states have (on average 1.4085686020850772) internal successors, (37020), 26286 states have internal predecessors, (37020), 0 states have call successors, (0), 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:28:34,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26287 states to 26287 states and 37020 transitions. [2024-11-11 21:28:34,707 INFO L78 Accepts]: Start accepts. Automaton has 26287 states and 37020 transitions. Word has length 150 [2024-11-11 21:28:34,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:28:34,707 INFO L471 AbstractCegarLoop]: Abstraction has 26287 states and 37020 transitions. [2024-11-11 21:28:34,707 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:28:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 26287 states and 37020 transitions. [2024-11-11 21:28:34,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-11 21:28:34,735 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:28:34,736 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] [2024-11-11 21:28:34,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:28:34,736 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:28:34,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:28:34,737 INFO L85 PathProgramCache]: Analyzing trace with hash 517151782, now seen corresponding path program 1 times [2024-11-11 21:28:34,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:28:34,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982101788] [2024-11-11 21:28:34,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:28:34,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:28:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:28:35,273 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:28:35,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:28:35,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982101788] [2024-11-11 21:28:35,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982101788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:28:35,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:28:35,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:28:35,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421868934] [2024-11-11 21:28:35,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:28:35,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:28:35,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:28:35,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:28:35,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:28:35,276 INFO L87 Difference]: Start difference. First operand 26287 states and 37020 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 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:28:35,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:28:35,471 INFO L93 Difference]: Finished difference Result 41929 states and 59019 transitions. [2024-11-11 21:28:35,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:28:35,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2024-11-11 21:28:35,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:28:35,514 INFO L225 Difference]: With dead ends: 41929 [2024-11-11 21:28:35,515 INFO L226 Difference]: Without dead ends: 21410 [2024-11-11 21:28:35,537 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:28:35,539 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 17 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1668 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.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:28:35,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1668 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:28:35,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21410 states. [2024-11-11 21:28:35,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21410 to 21410. [2024-11-11 21:28:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21410 states, 21405 states have (on average 1.4035505722961925) internal successors, (30043), 21409 states have internal predecessors, (30043), 0 states have call successors, (0), 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:28:36,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 30043 transitions. [2024-11-11 21:28:36,027 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 30043 transitions. Word has length 151 [2024-11-11 21:28:36,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:28:36,027 INFO L471 AbstractCegarLoop]: Abstraction has 21410 states and 30043 transitions. [2024-11-11 21:28:36,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 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:28:36,028 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 30043 transitions. [2024-11-11 21:28:36,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-11 21:28:36,047 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:28:36,047 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:28:36,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:28:36,048 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:28:36,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:28:36,048 INFO L85 PathProgramCache]: Analyzing trace with hash -915362106, now seen corresponding path program 1 times [2024-11-11 21:28:36,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:28:36,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097642843] [2024-11-11 21:28:36,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:28:36,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:28:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:28:36,521 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:28:36,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:28:36,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097642843] [2024-11-11 21:28:36,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097642843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:28:36,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:28:36,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:28:36,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208657133] [2024-11-11 21:28:36,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:28:36,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:28:36,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:28:36,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:28:36,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:28:36,524 INFO L87 Difference]: Start difference. First operand 21410 states and 30043 transitions. Second operand has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 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:28:36,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:28:36,831 INFO L93 Difference]: Finished difference Result 43799 states and 62721 transitions. [2024-11-11 21:28:36,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:28:36,831 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 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:28:36,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:28:36,900 INFO L225 Difference]: With dead ends: 43799 [2024-11-11 21:28:36,901 INFO L226 Difference]: Without dead ends: 34761 [2024-11-11 21:28:36,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:28:36,921 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 1926 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1926 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:28:36,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1926 Valid, 1245 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:28:36,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34761 states. [2024-11-11 21:28:37,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34761 to 34759. [2024-11-11 21:28:37,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34759 states, 34754 states have (on average 1.3845025033089717) internal successors, (48117), 34758 states have internal predecessors, (48117), 0 states have call successors, (0), 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:28:37,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34759 states to 34759 states and 48117 transitions. [2024-11-11 21:28:37,604 INFO L78 Accepts]: Start accepts. Automaton has 34759 states and 48117 transitions. Word has length 157 [2024-11-11 21:28:37,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:28:37,605 INFO L471 AbstractCegarLoop]: Abstraction has 34759 states and 48117 transitions. [2024-11-11 21:28:37,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.625) internal successors, (157), 8 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:28:37,605 INFO L276 IsEmpty]: Start isEmpty. Operand 34759 states and 48117 transitions. [2024-11-11 21:28:37,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-11 21:28:37,652 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:28:37,652 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:28:37,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:28:37,653 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:28:37,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:28:37,653 INFO L85 PathProgramCache]: Analyzing trace with hash 234138742, now seen corresponding path program 1 times [2024-11-11 21:28:37,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:28:37,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097869688] [2024-11-11 21:28:37,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:28:37,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:28:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:28:38,166 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:28:38,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:28:38,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097869688] [2024-11-11 21:28:38,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097869688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:28:38,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:28:38,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:28:38,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873308290] [2024-11-11 21:28:38,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:28:38,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:28:38,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:28:38,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:28:38,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:28:38,169 INFO L87 Difference]: Start difference. First operand 34759 states and 48117 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:28:38,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:28:38,576 INFO L93 Difference]: Finished difference Result 69411 states and 96096 transitions. [2024-11-11 21:28:38,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:28:38,577 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:28:38,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:28:38,651 INFO L225 Difference]: With dead ends: 69411 [2024-11-11 21:28:38,652 INFO L226 Difference]: Without dead ends: 34759 [2024-11-11 21:28:38,683 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:28:38,684 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 10 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1640 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:28:38,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1640 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:28:38,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34759 states. [2024-11-11 21:28:39,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34759 to 34756. [2024-11-11 21:28:39,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34756 states, 34751 states have (on average 1.3844205922131738) internal successors, (48110), 34755 states have internal predecessors, (48110), 0 states have call successors, (0), 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:28:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34756 states to 34756 states and 48110 transitions. [2024-11-11 21:28:39,436 INFO L78 Accepts]: Start accepts. Automaton has 34756 states and 48110 transitions. Word has length 157 [2024-11-11 21:28:39,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:28:39,436 INFO L471 AbstractCegarLoop]: Abstraction has 34756 states and 48110 transitions. [2024-11-11 21:28:39,436 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:28:39,436 INFO L276 IsEmpty]: Start isEmpty. Operand 34756 states and 48110 transitions. [2024-11-11 21:28:39,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-11 21:28:39,462 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:28:39,462 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:28:39,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:28:39,462 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:28:39,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:28:39,463 INFO L85 PathProgramCache]: Analyzing trace with hash -609898143, now seen corresponding path program 1 times [2024-11-11 21:28:39,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:28:39,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738110845] [2024-11-11 21:28:39,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:28:39,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:28:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:28:39,553 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:28:39,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:28:39,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738110845] [2024-11-11 21:28:39,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738110845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:28:39,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:28:39,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:28:39,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727556744] [2024-11-11 21:28:39,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:28:39,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:28:39,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:28:39,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:28:39,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:28:39,557 INFO L87 Difference]: Start difference. First operand 34756 states and 48110 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 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:28:39,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:28:39,820 INFO L93 Difference]: Finished difference Result 94073 states and 129645 transitions. [2024-11-11 21:28:39,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:28:39,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 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:28:39,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:28:39,954 INFO L225 Difference]: With dead ends: 94073 [2024-11-11 21:28:39,954 INFO L226 Difference]: Without dead ends: 60257 [2024-11-11 21:28:40,003 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:28:40,004 INFO L435 NwaCegarLoop]: 931 mSDtfsCounter, 448 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:28:40,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1422 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:28:40,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60257 states. [2024-11-11 21:28:41,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60257 to 60213. [2024-11-11 21:28:41,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60213 states, 60208 states have (on average 1.3570455753388253) internal successors, (81705), 60212 states have internal predecessors, (81705), 0 states have call successors, (0), 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:28:41,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60213 states to 60213 states and 81705 transitions. [2024-11-11 21:28:41,294 INFO L78 Accepts]: Start accepts. Automaton has 60213 states and 81705 transitions. Word has length 157 [2024-11-11 21:28:41,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:28:41,294 INFO L471 AbstractCegarLoop]: Abstraction has 60213 states and 81705 transitions. [2024-11-11 21:28:41,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 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:28:41,295 INFO L276 IsEmpty]: Start isEmpty. Operand 60213 states and 81705 transitions. [2024-11-11 21:28:41,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-11 21:28:41,350 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:28:41,350 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:41,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:28:41,351 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:28:41,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:28:41,352 INFO L85 PathProgramCache]: Analyzing trace with hash -31104540, now seen corresponding path program 1 times [2024-11-11 21:28:41,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:28:41,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963338446] [2024-11-11 21:28:41,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:28:41,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:28:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:28:41,806 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:28:41,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:28:41,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963338446] [2024-11-11 21:28:41,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963338446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:28:41,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:28:41,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:28:41,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827376085] [2024-11-11 21:28:41,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:28:41,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:28:41,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:28:41,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:28:41,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:28:41,810 INFO L87 Difference]: Start difference. First operand 60213 states and 81705 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:28:42,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:28:42,536 INFO L93 Difference]: Finished difference Result 110896 states and 150684 transitions. [2024-11-11 21:28:42,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:28:42,544 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:28:42,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:28:42,654 INFO L225 Difference]: With dead ends: 110896 [2024-11-11 21:28:42,654 INFO L226 Difference]: Without dead ends: 51505 [2024-11-11 21:28:42,714 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:28:42,715 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 13 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1644 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:28:42,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1644 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:28:42,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51505 states. [2024-11-11 21:28:43,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51505 to 51505. [2024-11-11 21:28:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51505 states, 51500 states have (on average 1.3583495145631068) internal successors, (69955), 51504 states have internal predecessors, (69955), 0 states have call successors, (0), 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:28:43,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51505 states to 51505 states and 69955 transitions. [2024-11-11 21:28:43,724 INFO L78 Accepts]: Start accepts. Automaton has 51505 states and 69955 transitions. Word has length 157 [2024-11-11 21:28:43,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:28:43,724 INFO L471 AbstractCegarLoop]: Abstraction has 51505 states and 69955 transitions. [2024-11-11 21:28:43,725 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:28:43,725 INFO L276 IsEmpty]: Start isEmpty. Operand 51505 states and 69955 transitions. [2024-11-11 21:28:43,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-11 21:28:43,753 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:28:43,753 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] [2024-11-11 21:28:43,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 21:28:43,753 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:28:43,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:28:43,754 INFO L85 PathProgramCache]: Analyzing trace with hash -941679734, now seen corresponding path program 1 times [2024-11-11 21:28:43,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:28:43,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634820391] [2024-11-11 21:28:43,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:28:43,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:28:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:28:44,188 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:28:44,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:28:44,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634820391] [2024-11-11 21:28:44,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634820391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:28:44,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:28:44,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 21:28:44,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739350565] [2024-11-11 21:28:44,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:28:44,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:28:44,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:28:44,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:28:44,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:28:44,191 INFO L87 Difference]: Start difference. First operand 51505 states and 69955 transitions. Second operand has 10 states, 10 states have (on average 16.3) internal successors, (163), 9 states have internal predecessors, (163), 0 states have call successors, (0), 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:28:44,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:28:44,643 INFO L93 Difference]: Finished difference Result 96082 states and 130592 transitions. [2024-11-11 21:28:44,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:28:44,644 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.3) internal successors, (163), 9 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2024-11-11 21:28:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:28:44,729 INFO L225 Difference]: With dead ends: 96082 [2024-11-11 21:28:44,729 INFO L226 Difference]: Without dead ends: 51505 [2024-11-11 21:28:44,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:28:44,774 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 3135 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3135 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:28:44,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3135 Valid, 681 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:28:44,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51505 states. [2024-11-11 21:28:45,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51505 to 51505. [2024-11-11 21:28:45,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51505 states, 51500 states have (on average 1.3406407766990291) internal successors, (69043), 51504 states have internal predecessors, (69043), 0 states have call successors, (0), 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:28:45,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51505 states to 51505 states and 69043 transitions. [2024-11-11 21:28:45,817 INFO L78 Accepts]: Start accepts. Automaton has 51505 states and 69043 transitions. Word has length 163 [2024-11-11 21:28:45,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:28:45,818 INFO L471 AbstractCegarLoop]: Abstraction has 51505 states and 69043 transitions. [2024-11-11 21:28:45,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.3) internal successors, (163), 9 states have internal predecessors, (163), 0 states have call successors, (0), 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:28:45,818 INFO L276 IsEmpty]: Start isEmpty. Operand 51505 states and 69043 transitions. [2024-11-11 21:28:45,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-11 21:28:45,848 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:28:45,848 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] [2024-11-11 21:28:45,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 21:28:45,848 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:28:45,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:28:45,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1530284517, now seen corresponding path program 1 times [2024-11-11 21:28:45,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:28:45,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302224941] [2024-11-11 21:28:45,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:28:45,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:28:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:28:47,516 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:28:47,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:28:47,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302224941] [2024-11-11 21:28:47,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302224941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:28:47,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:28:47,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-11 21:28:47,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035008248] [2024-11-11 21:28:47,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:28:47,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-11 21:28:47,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:28:47,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-11 21:28:47,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-11 21:28:47,521 INFO L87 Difference]: Start difference. First operand 51505 states and 69043 transitions. Second operand has 15 states, 15 states have (on average 10.866666666666667) internal successors, (163), 15 states have internal predecessors, (163), 0 states have call successors, (0), 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:28:49,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:28:49,120 INFO L93 Difference]: Finished difference Result 85730 states and 115775 transitions. [2024-11-11 21:28:49,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-11 21:28:49,121 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.866666666666667) internal successors, (163), 15 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2024-11-11 21:28:49,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:28:49,252 INFO L225 Difference]: With dead ends: 85730 [2024-11-11 21:28:49,253 INFO L226 Difference]: Without dead ends: 78140 [2024-11-11 21:28:49,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2024-11-11 21:28:49,295 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 3718 mSDsluCounter, 4572 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3718 SdHoareTripleChecker+Valid, 5145 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 21:28:49,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3718 Valid, 5145 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 21:28:49,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78140 states. [2024-11-11 21:28:50,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78140 to 57194. [2024-11-11 21:28:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57194 states, 57189 states have (on average 1.3228243193621152) internal successors, (75651), 57193 states have internal predecessors, (75651), 0 states have call successors, (0), 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:28:50,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57194 states to 57194 states and 75651 transitions. [2024-11-11 21:28:50,562 INFO L78 Accepts]: Start accepts. Automaton has 57194 states and 75651 transitions. Word has length 163 [2024-11-11 21:28:50,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:28:50,565 INFO L471 AbstractCegarLoop]: Abstraction has 57194 states and 75651 transitions. [2024-11-11 21:28:50,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.866666666666667) internal successors, (163), 15 states have internal predecessors, (163), 0 states have call successors, (0), 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:28:50,565 INFO L276 IsEmpty]: Start isEmpty. Operand 57194 states and 75651 transitions. [2024-11-11 21:28:50,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-11 21:28:50,598 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:28:50,599 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] [2024-11-11 21:28:50,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 21:28:50,599 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:28:50,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:28:50,600 INFO L85 PathProgramCache]: Analyzing trace with hash 888809919, now seen corresponding path program 1 times [2024-11-11 21:28:50,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:28:50,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455767698] [2024-11-11 21:28:50,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:28:50,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:28:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:28:50,974 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:28:50,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:28:50,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455767698] [2024-11-11 21:28:50,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455767698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:28:50,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:28:50,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:28:50,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879100607] [2024-11-11 21:28:50,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:28:50,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:28:50,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:28:50,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:28:50,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:28:50,977 INFO L87 Difference]: Start difference. First operand 57194 states and 75651 transitions. Second operand has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 0 states have call successors, (0), 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:28:51,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:28:51,288 INFO L93 Difference]: Finished difference Result 80338 states and 110636 transitions. [2024-11-11 21:28:51,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:28:51,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2024-11-11 21:28:51,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:28:51,413 INFO L225 Difference]: With dead ends: 80338 [2024-11-11 21:28:51,414 INFO L226 Difference]: Without dead ends: 57196 [2024-11-11 21:28:51,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:28:51,459 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 1436 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:28:51,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 1309 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:28:51,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57196 states. [2024-11-11 21:28:52,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57196 to 57194. [2024-11-11 21:28:52,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57194 states, 57189 states have (on average 1.3169490636311179) internal successors, (75315), 57193 states have internal predecessors, (75315), 0 states have call successors, (0), 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:28:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57194 states to 57194 states and 75315 transitions. [2024-11-11 21:28:52,620 INFO L78 Accepts]: Start accepts. Automaton has 57194 states and 75315 transitions. Word has length 163 [2024-11-11 21:28:52,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:28:52,620 INFO L471 AbstractCegarLoop]: Abstraction has 57194 states and 75315 transitions. [2024-11-11 21:28:52,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 0 states have call successors, (0), 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:28:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 57194 states and 75315 transitions. [2024-11-11 21:28:52,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-11 21:28:52,654 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:28:52,654 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] [2024-11-11 21:28:52,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 21:28:52,655 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:28:52,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:28:52,655 INFO L85 PathProgramCache]: Analyzing trace with hash 292054911, now seen corresponding path program 1 times [2024-11-11 21:28:52,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:28:52,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116045762] [2024-11-11 21:28:52,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:28:52,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:28:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:28:52,968 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:28:52,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:28:52,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116045762] [2024-11-11 21:28:52,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116045762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:28:52,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:28:52,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:28:52,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558565043] [2024-11-11 21:28:52,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:28:52,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:28:52,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:28:52,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:28:52,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:28:52,971 INFO L87 Difference]: Start difference. First operand 57194 states and 75315 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 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:28:53,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:28:53,268 INFO L93 Difference]: Finished difference Result 92671 states and 121935 transitions. [2024-11-11 21:28:53,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:28:53,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2024-11-11 21:28:53,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:28:53,709 INFO L225 Difference]: With dead ends: 92671 [2024-11-11 21:28:53,710 INFO L226 Difference]: Without dead ends: 50951 [2024-11-11 21:28:53,728 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:28:53,729 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 456 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:28:53,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1547 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:28:53,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50951 states. [2024-11-11 21:28:54,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50951 to 50827. [2024-11-11 21:28:54,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50827 states, 50822 states have (on average 1.312325370902365) internal successors, (66695), 50826 states have internal predecessors, (66695), 0 states have call successors, (0), 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:28:54,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50827 states to 50827 states and 66695 transitions. [2024-11-11 21:28:54,614 INFO L78 Accepts]: Start accepts. Automaton has 50827 states and 66695 transitions. Word has length 163 [2024-11-11 21:28:54,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:28:54,614 INFO L471 AbstractCegarLoop]: Abstraction has 50827 states and 66695 transitions. [2024-11-11 21:28:54,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 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:28:54,615 INFO L276 IsEmpty]: Start isEmpty. Operand 50827 states and 66695 transitions. [2024-11-11 21:28:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-11 21:28:54,656 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:28:54,657 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] [2024-11-11 21:28:54,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 21:28:54,657 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:28:54,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:28:54,658 INFO L85 PathProgramCache]: Analyzing trace with hash 652438755, now seen corresponding path program 1 times [2024-11-11 21:28:54,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:28:54,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144569287] [2024-11-11 21:28:54,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:28:54,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:28:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:28:56,211 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:28:56,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:28:56,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144569287] [2024-11-11 21:28:56,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144569287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:28:56,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:28:56,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-11 21:28:56,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143144434] [2024-11-11 21:28:56,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:28:56,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 21:28:56,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:28:56,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 21:28:56,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2024-11-11 21:28:56,214 INFO L87 Difference]: Start difference. First operand 50827 states and 66695 transitions. Second operand has 16 states, 16 states have (on average 10.3125) internal successors, (165), 16 states have internal predecessors, (165), 0 states have call successors, (0), 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:28:58,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:28:58,783 INFO L93 Difference]: Finished difference Result 110794 states and 151943 transitions. [2024-11-11 21:28:58,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-11 21:28:58,784 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.3125) internal successors, (165), 16 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2024-11-11 21:28:58,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:28:58,912 INFO L225 Difference]: With dead ends: 110794 [2024-11-11 21:28:58,913 INFO L226 Difference]: Without dead ends: 101520 [2024-11-11 21:28:58,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=468, Invalid=1424, Unknown=0, NotChecked=0, Total=1892 [2024-11-11 21:28:58,943 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 4342 mSDsluCounter, 7063 mSDsCounter, 0 mSdLazyCounter, 2015 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4342 SdHoareTripleChecker+Valid, 7928 SdHoareTripleChecker+Invalid, 2147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 2015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:28:58,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4342 Valid, 7928 Invalid, 2147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2015 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 21:28:59,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101520 states. [2024-11-11 21:28:59,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101520 to 57066. [2024-11-11 21:28:59,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57066 states, 57061 states have (on average 1.3014318010550112) internal successors, (74261), 57065 states have internal predecessors, (74261), 0 states have call successors, (0), 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:29:00,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57066 states to 57066 states and 74261 transitions. [2024-11-11 21:29:00,033 INFO L78 Accepts]: Start accepts. Automaton has 57066 states and 74261 transitions. Word has length 165 [2024-11-11 21:29:00,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:00,033 INFO L471 AbstractCegarLoop]: Abstraction has 57066 states and 74261 transitions. [2024-11-11 21:29:00,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.3125) internal successors, (165), 16 states have internal predecessors, (165), 0 states have call successors, (0), 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:29:00,033 INFO L276 IsEmpty]: Start isEmpty. Operand 57066 states and 74261 transitions. [2024-11-11 21:29:00,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-11 21:29:00,068 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:00,068 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] [2024-11-11 21:29:00,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 21:29:00,068 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:00,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:00,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1711717342, now seen corresponding path program 1 times [2024-11-11 21:29:00,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:00,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816685601] [2024-11-11 21:29:00,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:00,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:00,369 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:29:00,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:00,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816685601] [2024-11-11 21:29:00,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816685601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:00,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:00,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:29:00,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984507344] [2024-11-11 21:29:00,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:00,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:29:00,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:00,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:29:00,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:00,371 INFO L87 Difference]: Start difference. First operand 57066 states and 74261 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 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:29:00,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:00,714 INFO L93 Difference]: Finished difference Result 120286 states and 156590 transitions. [2024-11-11 21:29:00,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:29:00,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2024-11-11 21:29:00,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:00,825 INFO L225 Difference]: With dead ends: 120286 [2024-11-11 21:29:00,825 INFO L226 Difference]: Without dead ends: 78801 [2024-11-11 21:29:00,876 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:29:00,876 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 990 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:00,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 1797 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:29:00,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78801 states. [2024-11-11 21:29:02,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78801 to 57255. [2024-11-11 21:29:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57255 states, 57250 states have (on average 1.300995633187773) internal successors, (74482), 57254 states have internal predecessors, (74482), 0 states have call successors, (0), 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:29:02,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57255 states to 57255 states and 74482 transitions. [2024-11-11 21:29:02,386 INFO L78 Accepts]: Start accepts. Automaton has 57255 states and 74482 transitions. Word has length 165 [2024-11-11 21:29:02,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:02,387 INFO L471 AbstractCegarLoop]: Abstraction has 57255 states and 74482 transitions. [2024-11-11 21:29:02,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 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:29:02,387 INFO L276 IsEmpty]: Start isEmpty. Operand 57255 states and 74482 transitions. [2024-11-11 21:29:02,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-11 21:29:02,421 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:02,421 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:29:02,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 21:29:02,421 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:02,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:02,422 INFO L85 PathProgramCache]: Analyzing trace with hash 193280334, now seen corresponding path program 1 times [2024-11-11 21:29:02,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:02,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645763880] [2024-11-11 21:29:02,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:02,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:02,502 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:29:02,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:02,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645763880] [2024-11-11 21:29:02,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645763880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:02,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:02,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:29:02,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819595518] [2024-11-11 21:29:02,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:02,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:29:02,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:02,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:29:02,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:02,504 INFO L87 Difference]: Start difference. First operand 57255 states and 74482 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 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:29:03,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:03,179 INFO L93 Difference]: Finished difference Result 113888 states and 148248 transitions. [2024-11-11 21:29:03,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:29:03,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 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:29:03,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:03,274 INFO L225 Difference]: With dead ends: 113888 [2024-11-11 21:29:03,274 INFO L226 Difference]: Without dead ends: 57271 [2024-11-11 21:29:03,310 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:29:03,310 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 0 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1042 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:29:03,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1042 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:29:03,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57271 states. [2024-11-11 21:29:03,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57271 to 57271. [2024-11-11 21:29:03,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57271 states, 57266 states have (on average 1.3009115356406944) internal successors, (74498), 57270 states have internal predecessors, (74498), 0 states have call successors, (0), 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:29:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57271 states to 57271 states and 74498 transitions. [2024-11-11 21:29:04,374 INFO L78 Accepts]: Start accepts. Automaton has 57271 states and 74498 transitions. Word has length 166 [2024-11-11 21:29:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:04,374 INFO L471 AbstractCegarLoop]: Abstraction has 57271 states and 74498 transitions. [2024-11-11 21:29:04,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 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:29:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 57271 states and 74498 transitions. [2024-11-11 21:29:04,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-11 21:29:04,436 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:04,440 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, 1] [2024-11-11 21:29:04,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 21:29:04,441 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:04,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:04,441 INFO L85 PathProgramCache]: Analyzing trace with hash -126278232, now seen corresponding path program 1 times [2024-11-11 21:29:04,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:04,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779554834] [2024-11-11 21:29:04,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:04,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:05,387 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:29:05,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:05,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779554834] [2024-11-11 21:29:05,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779554834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:05,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:05,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-11 21:29:05,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937796758] [2024-11-11 21:29:05,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:05,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 21:29:05,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:05,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 21:29:05,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-11 21:29:05,389 INFO L87 Difference]: Start difference. First operand 57271 states and 74498 transitions. Second operand has 16 states, 16 states have (on average 10.4375) internal successors, (167), 16 states have internal predecessors, (167), 0 states have call successors, (0), 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:29:06,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:06,857 INFO L93 Difference]: Finished difference Result 74074 states and 97486 transitions. [2024-11-11 21:29:06,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-11 21:29:06,857 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.4375) internal successors, (167), 16 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2024-11-11 21:29:06,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:06,917 INFO L225 Difference]: With dead ends: 74074 [2024-11-11 21:29:06,917 INFO L226 Difference]: Without dead ends: 66440 [2024-11-11 21:29:06,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=779, Unknown=0, NotChecked=0, Total=1056 [2024-11-11 21:29:06,932 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 5533 mSDsluCounter, 4854 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5533 SdHoareTripleChecker+Valid, 5359 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:06,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5533 Valid, 5359 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:29:06,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66440 states. [2024-11-11 21:29:07,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66440 to 60194. [2024-11-11 21:29:07,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60194 states, 60189 states have (on average 1.293757995647045) internal successors, (77870), 60193 states have internal predecessors, (77870), 0 states have call successors, (0), 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:29:07,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60194 states to 60194 states and 77870 transitions. [2024-11-11 21:29:07,632 INFO L78 Accepts]: Start accepts. Automaton has 60194 states and 77870 transitions. Word has length 167 [2024-11-11 21:29:07,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:07,632 INFO L471 AbstractCegarLoop]: Abstraction has 60194 states and 77870 transitions. [2024-11-11 21:29:07,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.4375) internal successors, (167), 16 states have internal predecessors, (167), 0 states have call successors, (0), 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:29:07,632 INFO L276 IsEmpty]: Start isEmpty. Operand 60194 states and 77870 transitions. [2024-11-11 21:29:07,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-11 21:29:07,675 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:07,675 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, 1] [2024-11-11 21:29:07,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 21:29:07,675 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:07,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:07,676 INFO L85 PathProgramCache]: Analyzing trace with hash -625080728, now seen corresponding path program 1 times [2024-11-11 21:29:07,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:07,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625336123] [2024-11-11 21:29:07,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:07,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:08,159 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:29:08,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:08,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625336123] [2024-11-11 21:29:08,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625336123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:08,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:08,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:29:08,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949077378] [2024-11-11 21:29:08,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:08,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:29:08,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:08,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:29:08,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:08,162 INFO L87 Difference]: Start difference. First operand 60194 states and 77870 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 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:29:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:08,456 INFO L93 Difference]: Finished difference Result 106527 states and 137634 transitions. [2024-11-11 21:29:08,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:29:08,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2024-11-11 21:29:08,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:08,532 INFO L225 Difference]: With dead ends: 106527 [2024-11-11 21:29:08,532 INFO L226 Difference]: Without dead ends: 61264 [2024-11-11 21:29:08,572 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:29:08,573 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 890 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:08,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 1355 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:29:08,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61264 states. [2024-11-11 21:29:09,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61264 to 60661. [2024-11-11 21:29:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60661 states, 60656 states have (on average 1.2927163017673438) internal successors, (78411), 60660 states have internal predecessors, (78411), 0 states have call successors, (0), 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:29:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60661 states to 60661 states and 78411 transitions. [2024-11-11 21:29:09,591 INFO L78 Accepts]: Start accepts. Automaton has 60661 states and 78411 transitions. Word has length 167 [2024-11-11 21:29:09,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:09,591 INFO L471 AbstractCegarLoop]: Abstraction has 60661 states and 78411 transitions. [2024-11-11 21:29:09,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 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:29:09,591 INFO L276 IsEmpty]: Start isEmpty. Operand 60661 states and 78411 transitions. [2024-11-11 21:29:09,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-11 21:29:09,630 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:09,630 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, 1] [2024-11-11 21:29:09,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-11 21:29:09,630 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:09,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:09,631 INFO L85 PathProgramCache]: Analyzing trace with hash -726741763, now seen corresponding path program 1 times [2024-11-11 21:29:09,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:09,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258959247] [2024-11-11 21:29:09,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:09,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:09,930 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:29:09,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:09,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258959247] [2024-11-11 21:29:09,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258959247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:09,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:09,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:29:09,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835150519] [2024-11-11 21:29:09,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:09,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:29:09,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:09,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:29:09,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:09,932 INFO L87 Difference]: Start difference. First operand 60661 states and 78411 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 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:29:10,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:10,201 INFO L93 Difference]: Finished difference Result 112492 states and 145480 transitions. [2024-11-11 21:29:10,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:29:10,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2024-11-11 21:29:10,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:10,274 INFO L225 Difference]: With dead ends: 112492 [2024-11-11 21:29:10,274 INFO L226 Difference]: Without dead ends: 52179 [2024-11-11 21:29:10,322 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:29:10,322 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 4 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1600 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:29:10,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1600 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:29:10,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52179 states. [2024-11-11 21:29:11,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52179 to 52179. [2024-11-11 21:29:11,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52179 states, 52174 states have (on average 1.2933261777897036) internal successors, (67478), 52178 states have internal predecessors, (67478), 0 states have call successors, (0), 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:29:11,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52179 states to 52179 states and 67478 transitions. [2024-11-11 21:29:11,308 INFO L78 Accepts]: Start accepts. Automaton has 52179 states and 67478 transitions. Word has length 167 [2024-11-11 21:29:11,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:11,308 INFO L471 AbstractCegarLoop]: Abstraction has 52179 states and 67478 transitions. [2024-11-11 21:29:11,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 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:29:11,308 INFO L276 IsEmpty]: Start isEmpty. Operand 52179 states and 67478 transitions. [2024-11-11 21:29:11,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-11 21:29:11,340 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:11,340 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, 1, 1] [2024-11-11 21:29:11,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-11 21:29:11,340 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:11,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:11,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1679476573, now seen corresponding path program 1 times [2024-11-11 21:29:11,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:11,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624668943] [2024-11-11 21:29:11,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:11,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:11,410 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:29:11,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:11,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624668943] [2024-11-11 21:29:11,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624668943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:11,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:11,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:29:11,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152785611] [2024-11-11 21:29:11,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:11,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:29:11,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:11,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:29:11,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:11,412 INFO L87 Difference]: Start difference. First operand 52179 states and 67478 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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:29:11,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:11,646 INFO L93 Difference]: Finished difference Result 113406 states and 146709 transitions. [2024-11-11 21:29:11,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:29:11,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2024-11-11 21:29:11,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:11,729 INFO L225 Difference]: With dead ends: 113406 [2024-11-11 21:29:11,729 INFO L226 Difference]: Without dead ends: 75583 [2024-11-11 21:29:11,768 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:29:11,768 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 476 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:11,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1436 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:29:11,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75583 states. [2024-11-11 21:29:12,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75583 to 52182. [2024-11-11 21:29:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52182 states, 52177 states have (on average 1.293194319336106) internal successors, (67475), 52181 states have internal predecessors, (67475), 0 states have call successors, (0), 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:29:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52182 states to 52182 states and 67475 transitions. [2024-11-11 21:29:12,938 INFO L78 Accepts]: Start accepts. Automaton has 52182 states and 67475 transitions. Word has length 168 [2024-11-11 21:29:12,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:12,938 INFO L471 AbstractCegarLoop]: Abstraction has 52182 states and 67475 transitions. [2024-11-11 21:29:12,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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:29:12,938 INFO L276 IsEmpty]: Start isEmpty. Operand 52182 states and 67475 transitions. [2024-11-11 21:29:12,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-11 21:29:12,971 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:12,971 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, 1, 1, 1] [2024-11-11 21:29:12,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-11 21:29:12,972 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:12,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:12,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1505524721, now seen corresponding path program 1 times [2024-11-11 21:29:12,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:12,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082279400] [2024-11-11 21:29:12,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:12,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:13,051 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:29:13,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:13,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082279400] [2024-11-11 21:29:13,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082279400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:13,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:13,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:29:13,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051225132] [2024-11-11 21:29:13,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:13,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:29:13,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:13,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:29:13,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:13,053 INFO L87 Difference]: Start difference. First operand 52182 states and 67475 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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:29:13,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:13,434 INFO L93 Difference]: Finished difference Result 127619 states and 167259 transitions. [2024-11-11 21:29:13,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:29:13,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2024-11-11 21:29:13,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:14,035 INFO L225 Difference]: With dead ends: 127619 [2024-11-11 21:29:14,035 INFO L226 Difference]: Without dead ends: 92782 [2024-11-11 21:29:14,088 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:29:14,089 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 334 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:14,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 953 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:29:14,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92782 states. [2024-11-11 21:29:15,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92782 to 92731. [2024-11-11 21:29:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92731 states, 92726 states have (on average 1.2917089058085112) internal successors, (119775), 92730 states have internal predecessors, (119775), 0 states have call successors, (0), 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:29:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92731 states to 92731 states and 119775 transitions. [2024-11-11 21:29:15,548 INFO L78 Accepts]: Start accepts. Automaton has 92731 states and 119775 transitions. Word has length 169 [2024-11-11 21:29:15,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:15,548 INFO L471 AbstractCegarLoop]: Abstraction has 92731 states and 119775 transitions. [2024-11-11 21:29:15,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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:29:15,549 INFO L276 IsEmpty]: Start isEmpty. Operand 92731 states and 119775 transitions. [2024-11-11 21:29:15,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-11 21:29:15,605 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:15,605 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, 1, 1, 1] [2024-11-11 21:29:15,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-11 21:29:15,606 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:15,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:15,606 INFO L85 PathProgramCache]: Analyzing trace with hash -841245238, now seen corresponding path program 1 times [2024-11-11 21:29:15,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:15,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784453588] [2024-11-11 21:29:15,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:15,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:16,767 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:29:16,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:16,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784453588] [2024-11-11 21:29:16,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784453588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:16,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:16,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-11 21:29:16,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573404224] [2024-11-11 21:29:16,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:16,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-11 21:29:16,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:16,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-11 21:29:16,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:29:16,770 INFO L87 Difference]: Start difference. First operand 92731 states and 119775 transitions. Second operand has 19 states, 19 states have (on average 8.894736842105264) internal successors, (169), 19 states have internal predecessors, (169), 0 states have call successors, (0), 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:29:19,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:19,054 INFO L93 Difference]: Finished difference Result 240291 states and 323308 transitions. [2024-11-11 21:29:19,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-11 21:29:19,055 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.894736842105264) internal successors, (169), 19 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2024-11-11 21:29:19,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:19,397 INFO L225 Difference]: With dead ends: 240291 [2024-11-11 21:29:19,397 INFO L226 Difference]: Without dead ends: 236907 [2024-11-11 21:29:19,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=433, Invalid=1729, Unknown=0, NotChecked=0, Total=2162 [2024-11-11 21:29:19,479 INFO L435 NwaCegarLoop]: 965 mSDtfsCounter, 5631 mSDsluCounter, 10773 mSDsCounter, 0 mSdLazyCounter, 2403 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5631 SdHoareTripleChecker+Valid, 11738 SdHoareTripleChecker+Invalid, 2482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:19,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5631 Valid, 11738 Invalid, 2482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2403 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 21:29:19,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236907 states. [2024-11-11 21:29:22,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236907 to 110069. [2024-11-11 21:29:22,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110069 states, 110064 states have (on average 1.2715692687890683) internal successors, (139954), 110068 states have internal predecessors, (139954), 0 states have call successors, (0), 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:29:22,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110069 states to 110069 states and 139954 transitions. [2024-11-11 21:29:22,822 INFO L78 Accepts]: Start accepts. Automaton has 110069 states and 139954 transitions. Word has length 169 [2024-11-11 21:29:22,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:22,823 INFO L471 AbstractCegarLoop]: Abstraction has 110069 states and 139954 transitions. [2024-11-11 21:29:22,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.894736842105264) internal successors, (169), 19 states have internal predecessors, (169), 0 states have call successors, (0), 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:29:22,823 INFO L276 IsEmpty]: Start isEmpty. Operand 110069 states and 139954 transitions. [2024-11-11 21:29:22,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-11 21:29:22,892 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:22,892 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, 1, 1, 1] [2024-11-11 21:29:22,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-11 21:29:22,892 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:22,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:22,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1047890421, now seen corresponding path program 1 times [2024-11-11 21:29:22,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:22,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277796899] [2024-11-11 21:29:22,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:22,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:22,983 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:29:22,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:22,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277796899] [2024-11-11 21:29:22,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277796899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:22,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:22,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:29:22,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707294927] [2024-11-11 21:29:22,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:22,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:29:22,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:22,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:29:22,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:22,986 INFO L87 Difference]: Start difference. First operand 110069 states and 139954 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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:29:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:23,325 INFO L93 Difference]: Finished difference Result 134005 states and 175223 transitions. [2024-11-11 21:29:23,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:29:23,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2024-11-11 21:29:23,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:23,452 INFO L225 Difference]: With dead ends: 134005 [2024-11-11 21:29:23,452 INFO L226 Difference]: Without dead ends: 110071 [2024-11-11 21:29:23,495 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:29:23,495 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 270 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:23,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 983 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:29:23,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110071 states. [2024-11-11 21:29:25,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110071 to 109597. [2024-11-11 21:29:25,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109597 states, 109592 states have (on average 1.267775020074458) internal successors, (138938), 109596 states have internal predecessors, (138938), 0 states have call successors, (0), 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:29:25,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109597 states to 109597 states and 138938 transitions. [2024-11-11 21:29:25,743 INFO L78 Accepts]: Start accepts. Automaton has 109597 states and 138938 transitions. Word has length 169 [2024-11-11 21:29:25,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:25,743 INFO L471 AbstractCegarLoop]: Abstraction has 109597 states and 138938 transitions. [2024-11-11 21:29:25,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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:29:25,743 INFO L276 IsEmpty]: Start isEmpty. Operand 109597 states and 138938 transitions. [2024-11-11 21:29:25,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-11 21:29:25,813 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:25,813 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, 1, 1, 1] [2024-11-11 21:29:25,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-11 21:29:25,814 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:25,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:25,814 INFO L85 PathProgramCache]: Analyzing trace with hash -463472731, now seen corresponding path program 1 times [2024-11-11 21:29:25,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:25,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886137450] [2024-11-11 21:29:25,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:25,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat