./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.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.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 1bc6aa00437fa9caa5f3417d996588d430ef5fa0daab57def01c3e44b34b1cac --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:29:04,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:29:04,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:29:04,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:29:04,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:29:05,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:29:05,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:29:05,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:29:05,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:29:05,018 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:29:05,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:29:05,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:29:05,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:29:05,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:29:05,020 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:29:05,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:29:05,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:29:05,020 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:29:05,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:29:05,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:29:05,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:29:05,024 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:29:05,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:29:05,025 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:29:05,025 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:29:05,025 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:29:05,025 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:29:05,025 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:29:05,026 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:29:05,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:29:05,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:29:05,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:29:05,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:29:05,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:29:05,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:29:05,027 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:29:05,027 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:29:05,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:29:05,028 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:29:05,028 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:29:05,029 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:29:05,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:29:05,033 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 -> 1bc6aa00437fa9caa5f3417d996588d430ef5fa0daab57def01c3e44b34b1cac [2024-11-11 21:29:05,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:29:05,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:29:05,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:29:05,294 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:29:05,295 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:29:05,295 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-11-11 21:29:06,847 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:29:07,088 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:29:07,092 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-11-11 21:29:07,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6014af5fa/4c9c49413f6d47ee96b322c13ea4355a/FLAG1899bd6d8 [2024-11-11 21:29:07,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6014af5fa/4c9c49413f6d47ee96b322c13ea4355a [2024-11-11 21:29:07,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:29:07,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:29:07,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:29:07,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:29:07,136 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:29:07,137 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:07,138 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1291b5cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07, skipping insertion in model container [2024-11-11 21:29:07,138 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:07,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:29:07,479 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14164,14177] [2024-11-11 21:29:07,490 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14811,14824] [2024-11-11 21:29:07,500 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[16044,16057] [2024-11-11 21:29:07,512 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[17104,17117] [2024-11-11 21:29:07,578 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[25495,25508] [2024-11-11 21:29:07,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:29:07,654 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:29:07,720 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14164,14177] [2024-11-11 21:29:07,725 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[14811,14824] [2024-11-11 21:29:07,736 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[16044,16057] [2024-11-11 21:29:07,746 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[17104,17117] [2024-11-11 21:29:07,837 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.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[25495,25508] [2024-11-11 21:29:07,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:29:07,921 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:29:07,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07 WrapperNode [2024-11-11 21:29:07,921 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:29:07,922 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:29:07,922 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:29:07,922 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:29:07,928 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:29:07" (1/1) ... [2024-11-11 21:29:07,951 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:29:07" (1/1) ... [2024-11-11 21:29:08,025 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1636 [2024-11-11 21:29:08,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:29:08,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:29:08,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:29:08,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:29:08,037 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:08,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:08,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:08,081 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:29:08,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:08,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:08,111 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:08,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:08,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:08,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:08,162 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:29:08,167 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:29:08,167 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:29:08,167 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:29:08,168 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07" (1/1) ... [2024-11-11 21:29:08,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:29:08,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:29:08,201 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:29:08,214 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:29:08,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:29:08,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:29:08,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:29:08,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:29:08,414 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:29:08,416 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:29:09,427 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-11-11 21:29:09,431 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:29:09,450 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:29:09,450 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-11 21:29:09,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:29:09 BoogieIcfgContainer [2024-11-11 21:29:09,451 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:29:09,452 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:29:09,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:29:09,456 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:29:09,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:29:07" (1/3) ... [2024-11-11 21:29:09,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb3bde3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:29:09, skipping insertion in model container [2024-11-11 21:29:09,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:29:07" (2/3) ... [2024-11-11 21:29:09,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb3bde3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:29:09, skipping insertion in model container [2024-11-11 21:29:09,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:29:09" (3/3) ... [2024-11-11 21:29:09,458 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-11-11 21:29:09,481 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:29:09,481 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-11-11 21:29:09,564 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:29:09,573 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;@54b72cdd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:29:09,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-11 21:29:09,583 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:29:09,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-11 21:29:09,597 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:09,598 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:29:09,599 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:09,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:09,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1808275345, now seen corresponding path program 1 times [2024-11-11 21:29:09,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:09,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55556870] [2024-11-11 21:29:09,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:09,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:10,277 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:10,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:10,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55556870] [2024-11-11 21:29:10,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55556870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:10,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:10,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:29:10,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580011335] [2024-11-11 21:29:10,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:10,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:29:10,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:10,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:29:10,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:10,312 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 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 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:29:10,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:10,470 INFO L93 Difference]: Finished difference Result 683 states and 1217 transitions. [2024-11-11 21:29:10,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:29:10,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 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:29:10,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:10,487 INFO L225 Difference]: With dead ends: 683 [2024-11-11 21:29:10,488 INFO L226 Difference]: Without dead ends: 546 [2024-11-11 21:29:10,491 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:10,493 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 391 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:10,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1207 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:29:10,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-11-11 21:29:10,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2024-11-11 21:29:10,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 539 states have (on average 1.4805194805194806) internal successors, (798), 543 states have internal predecessors, (798), 0 states have call successors, (0), 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,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 798 transitions. [2024-11-11 21:29:10,547 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 798 transitions. Word has length 139 [2024-11-11 21:29:10,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:10,547 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 798 transitions. [2024-11-11 21:29:10,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 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:29:10,548 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 798 transitions. [2024-11-11 21:29:10,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-11 21:29:10,550 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:10,550 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:29:10,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:29:10,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:10,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:10,551 INFO L85 PathProgramCache]: Analyzing trace with hash 715131696, now seen corresponding path program 1 times [2024-11-11 21:29:10,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:10,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530366047] [2024-11-11 21:29:10,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:10,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:10,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:10,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:10,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530366047] [2024-11-11 21:29:10,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530366047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:10,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:10,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:29:10,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386225219] [2024-11-11 21:29:10,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:10,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:29:10,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:10,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:29:10,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:10,783 INFO L87 Difference]: Start difference. First operand 544 states and 798 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 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:29:10,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:10,941 INFO L93 Difference]: Finished difference Result 1093 states and 1658 transitions. [2024-11-11 21:29:10,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:29:10,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 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:29:10,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:10,949 INFO L225 Difference]: With dead ends: 1093 [2024-11-11 21:29:10,951 INFO L226 Difference]: Without dead ends: 902 [2024-11-11 21:29:10,953 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:10,954 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 312 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:10,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 979 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:29:10,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-11-11 21:29:10,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 900. [2024-11-11 21:29:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 895 states have (on average 1.5027932960893855) internal successors, (1345), 899 states have internal predecessors, (1345), 0 states have call successors, (0), 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,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1345 transitions. [2024-11-11 21:29:11,001 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1345 transitions. Word has length 139 [2024-11-11 21:29:11,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:11,002 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1345 transitions. [2024-11-11 21:29:11,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 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:29:11,002 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1345 transitions. [2024-11-11 21:29:11,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-11 21:29:11,009 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:11,009 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:29:11,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:29:11,010 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:29:11,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:11,010 INFO L85 PathProgramCache]: Analyzing trace with hash 714700720, now seen corresponding path program 1 times [2024-11-11 21:29:11,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:11,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256977274] [2024-11-11 21:29:11,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:11,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:11,560 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,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:11,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256977274] [2024-11-11 21:29:11,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256977274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:11,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:11,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:29:11,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239742586] [2024-11-11 21:29:11,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:11,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:29:11,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:11,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:29:11,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:11,562 INFO L87 Difference]: Start difference. First operand 900 states and 1345 transitions. 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:29:11,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:11,693 INFO L93 Difference]: Finished difference Result 4365 states and 6502 transitions. [2024-11-11 21:29:11,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:29:11,694 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:29:11,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:11,705 INFO L225 Difference]: With dead ends: 4365 [2024-11-11 21:29:11,706 INFO L226 Difference]: Without dead ends: 3474 [2024-11-11 21:29:11,710 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:29:11,711 INFO L435 NwaCegarLoop]: 939 mSDtfsCounter, 1532 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 2414 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:11,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 2414 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:29:11,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3474 states. [2024-11-11 21:29:11,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3474 to 1703. [2024-11-11 21:29:11,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 1698 states have (on average 1.4888103651354534) internal successors, (2528), 1702 states have internal predecessors, (2528), 0 states have call successors, (0), 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,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2528 transitions. [2024-11-11 21:29:11,749 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2528 transitions. Word has length 139 [2024-11-11 21:29:11,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:11,749 INFO L471 AbstractCegarLoop]: Abstraction has 1703 states and 2528 transitions. [2024-11-11 21:29:11,749 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:29:11,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2528 transitions. [2024-11-11 21:29:11,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-11 21:29:11,751 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:11,751 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:29:11,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:29:11,752 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:29:11,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:11,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1630009316, now seen corresponding path program 1 times [2024-11-11 21:29:11,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:11,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112334892] [2024-11-11 21:29:11,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:11,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:11,829 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,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:11,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112334892] [2024-11-11 21:29:11,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112334892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:11,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:11,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:29:11,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667775827] [2024-11-11 21:29:11,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:11,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:29:11,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:11,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:29:11,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:11,835 INFO L87 Difference]: Start difference. First operand 1703 states and 2528 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:29:11,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:11,860 INFO L93 Difference]: Finished difference Result 3380 states and 5013 transitions. [2024-11-11 21:29:11,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:29:11,861 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:29:11,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:11,865 INFO L225 Difference]: With dead ends: 3380 [2024-11-11 21:29:11,865 INFO L226 Difference]: Without dead ends: 1705 [2024-11-11 21:29:11,867 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,870 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:29:11,872 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:29:11,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2024-11-11 21:29:11,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1705. [2024-11-11 21:29:11,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1700 states have (on average 1.488235294117647) internal successors, (2530), 1704 states have internal predecessors, (2530), 0 states have call successors, (0), 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,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2530 transitions. [2024-11-11 21:29:11,901 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2530 transitions. Word has length 140 [2024-11-11 21:29:11,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:11,901 INFO L471 AbstractCegarLoop]: Abstraction has 1705 states and 2530 transitions. [2024-11-11 21:29:11,902 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:29:11,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2530 transitions. [2024-11-11 21:29:11,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-11 21:29:11,904 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:11,904 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:29:11,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:29:11,904 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:29:11,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:11,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1573794978, now seen corresponding path program 1 times [2024-11-11 21:29:11,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:11,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451117723] [2024-11-11 21:29:11,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:11,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:12,006 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:12,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:12,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451117723] [2024-11-11 21:29:12,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451117723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:12,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:12,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:29:12,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507931276] [2024-11-11 21:29:12,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:12,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:29:12,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:12,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:29:12,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:12,009 INFO L87 Difference]: Start difference. First operand 1705 states and 2530 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:29:12,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:12,065 INFO L93 Difference]: Finished difference Result 4483 states and 6649 transitions. [2024-11-11 21:29:12,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:29:12,066 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:29:12,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:12,075 INFO L225 Difference]: With dead ends: 4483 [2024-11-11 21:29:12,075 INFO L226 Difference]: Without dead ends: 2956 [2024-11-11 21:29:12,080 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:12,081 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 465 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1287 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:29:12,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1287 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:29:12,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2024-11-11 21:29:12,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2916. [2024-11-11 21:29:12,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2916 states, 2911 states have (on average 1.4671934043284094) internal successors, (4271), 2915 states have internal predecessors, (4271), 0 states have call successors, (0), 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,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 4271 transitions. [2024-11-11 21:29:12,183 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 4271 transitions. Word has length 141 [2024-11-11 21:29:12,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:12,184 INFO L471 AbstractCegarLoop]: Abstraction has 2916 states and 4271 transitions. [2024-11-11 21:29:12,184 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:29:12,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 4271 transitions. [2024-11-11 21:29:12,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-11 21:29:12,188 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:12,188 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:29:12,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:29:12,189 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:29:12,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:12,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1469323167, now seen corresponding path program 1 times [2024-11-11 21:29:12,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:12,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614420055] [2024-11-11 21:29:12,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:12,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:12,580 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:12,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:12,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614420055] [2024-11-11 21:29:12,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614420055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:12,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:12,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:29:12,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701322895] [2024-11-11 21:29:12,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:12,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:29:12,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:12,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:29:12,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:12,582 INFO L87 Difference]: Start difference. First operand 2916 states and 4271 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:29:12,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:12,615 INFO L93 Difference]: Finished difference Result 5253 states and 7712 transitions. [2024-11-11 21:29:12,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:29:12,616 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:29:12,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:12,623 INFO L225 Difference]: With dead ends: 5253 [2024-11-11 21:29:12,623 INFO L226 Difference]: Without dead ends: 2505 [2024-11-11 21:29:12,626 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:12,627 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 25 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1688 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:12,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1688 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:12,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2505 states. [2024-11-11 21:29:12,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2505 to 2505. [2024-11-11 21:29:12,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2505 states, 2500 states have (on average 1.4656) internal successors, (3664), 2504 states have internal predecessors, (3664), 0 states have call successors, (0), 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,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2505 states to 2505 states and 3664 transitions. [2024-11-11 21:29:12,660 INFO L78 Accepts]: Start accepts. Automaton has 2505 states and 3664 transitions. Word has length 141 [2024-11-11 21:29:12,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:12,661 INFO L471 AbstractCegarLoop]: Abstraction has 2505 states and 3664 transitions. [2024-11-11 21:29:12,661 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:29:12,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2505 states and 3664 transitions. [2024-11-11 21:29:12,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 21:29:12,663 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:12,663 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:29:12,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:29:12,664 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:12,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:12,664 INFO L85 PathProgramCache]: Analyzing trace with hash 419999342, now seen corresponding path program 1 times [2024-11-11 21:29:12,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:12,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981007593] [2024-11-11 21:29:12,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:12,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:12,761 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:12,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:12,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981007593] [2024-11-11 21:29:12,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981007593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:12,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:12,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:29:12,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730961966] [2024-11-11 21:29:12,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:12,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:29:12,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:12,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:29:12,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:12,764 INFO L87 Difference]: Start difference. First operand 2505 states and 3664 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:29:12,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:12,977 INFO L93 Difference]: Finished difference Result 6986 states and 10274 transitions. [2024-11-11 21:29:12,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:29:12,978 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:29:12,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:12,990 INFO L225 Difference]: With dead ends: 6986 [2024-11-11 21:29:12,991 INFO L226 Difference]: Without dead ends: 4801 [2024-11-11 21:29:12,994 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:12,995 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 390 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:12,995 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.2s Time] [2024-11-11 21:29:12,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4801 states. [2024-11-11 21:29:13,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4801 to 4761. [2024-11-11 21:29:13,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4761 states, 4756 states have (on average 1.4598402018502943) internal successors, (6943), 4760 states have internal predecessors, (6943), 0 states have call successors, (0), 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,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4761 states to 4761 states and 6943 transitions. [2024-11-11 21:29:13,078 INFO L78 Accepts]: Start accepts. Automaton has 4761 states and 6943 transitions. Word has length 147 [2024-11-11 21:29:13,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:13,078 INFO L471 AbstractCegarLoop]: Abstraction has 4761 states and 6943 transitions. [2024-11-11 21:29:13,078 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:29:13,078 INFO L276 IsEmpty]: Start isEmpty. Operand 4761 states and 6943 transitions. [2024-11-11 21:29:13,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 21:29:13,083 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:13,083 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:29:13,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:29:13,083 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:13,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:13,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2037635117, now seen corresponding path program 1 times [2024-11-11 21:29:13,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:13,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639009285] [2024-11-11 21:29:13,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:13,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:14,358 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:14,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:14,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639009285] [2024-11-11 21:29:14,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639009285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:14,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:14,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-11 21:29:14,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928533738] [2024-11-11 21:29:14,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:14,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 21:29:14,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:14,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 21:29:14,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-11 21:29:14,360 INFO L87 Difference]: Start difference. First operand 4761 states and 6943 transitions. Second operand has 13 states, 13 states have (on average 11.307692307692308) internal successors, (147), 13 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:29:15,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:15,906 INFO L93 Difference]: Finished difference Result 8070 states and 11968 transitions. [2024-11-11 21:29:15,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 21:29:15,907 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.307692307692308) internal successors, (147), 13 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:29:15,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:15,926 INFO L225 Difference]: With dead ends: 8070 [2024-11-11 21:29:15,927 INFO L226 Difference]: Without dead ends: 6478 [2024-11-11 21:29:15,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2024-11-11 21:29:15,933 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 3166 mSDsluCounter, 4468 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3166 SdHoareTripleChecker+Valid, 5014 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:15,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3166 Valid, 5014 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 21:29:15,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6478 states. [2024-11-11 21:29:16,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6478 to 5220. [2024-11-11 21:29:16,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5220 states, 5215 states have (on average 1.4452540747842761) internal successors, (7537), 5219 states have internal predecessors, (7537), 0 states have call successors, (0), 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:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5220 states to 5220 states and 7537 transitions. [2024-11-11 21:29:16,042 INFO L78 Accepts]: Start accepts. Automaton has 5220 states and 7537 transitions. Word has length 147 [2024-11-11 21:29:16,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:16,042 INFO L471 AbstractCegarLoop]: Abstraction has 5220 states and 7537 transitions. [2024-11-11 21:29:16,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.307692307692308) internal successors, (147), 13 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:29:16,043 INFO L276 IsEmpty]: Start isEmpty. Operand 5220 states and 7537 transitions. [2024-11-11 21:29:16,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 21:29:16,048 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:16,048 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:29:16,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:29:16,049 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:16,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:16,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1951696513, now seen corresponding path program 1 times [2024-11-11 21:29:16,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:16,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886472726] [2024-11-11 21:29:16,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:16,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:16,378 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,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:16,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886472726] [2024-11-11 21:29:16,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886472726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:16,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:16,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:29:16,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68764364] [2024-11-11 21:29:16,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:16,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:29:16,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:16,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:29:16,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:16,384 INFO L87 Difference]: Start difference. First operand 5220 states and 7537 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:29:16,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:16,502 INFO L93 Difference]: Finished difference Result 13723 states and 19760 transitions. [2024-11-11 21:29:16,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:29:16,503 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:29:16,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:16,525 INFO L225 Difference]: With dead ends: 13723 [2024-11-11 21:29:16,526 INFO L226 Difference]: Without dead ends: 8522 [2024-11-11 21:29:16,534 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:29:16,534 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 465 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 2155 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:29:16,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 2155 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:29:16,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8522 states. [2024-11-11 21:29:16,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8522 to 8492. [2024-11-11 21:29:16,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8492 states, 8487 states have (on average 1.423824673029339) internal successors, (12084), 8491 states have internal predecessors, (12084), 0 states have call successors, (0), 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:16,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8492 states to 8492 states and 12084 transitions. [2024-11-11 21:29:16,676 INFO L78 Accepts]: Start accepts. Automaton has 8492 states and 12084 transitions. Word has length 147 [2024-11-11 21:29:16,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:16,677 INFO L471 AbstractCegarLoop]: Abstraction has 8492 states and 12084 transitions. [2024-11-11 21:29:16,677 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:29:16,677 INFO L276 IsEmpty]: Start isEmpty. Operand 8492 states and 12084 transitions. [2024-11-11 21:29:16,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-11 21:29:16,686 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:16,686 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:29:16,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:29:16,687 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:16,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:16,688 INFO L85 PathProgramCache]: Analyzing trace with hash -969376451, now seen corresponding path program 1 times [2024-11-11 21:29:16,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:16,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310757180] [2024-11-11 21:29:16,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:16,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:16,801 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,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:16,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310757180] [2024-11-11 21:29:16,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310757180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:16,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:16,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:29:16,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456853528] [2024-11-11 21:29:16,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:16,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:29:16,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:16,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:29:16,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:16,803 INFO L87 Difference]: Start difference. First operand 8492 states and 12084 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:29:16,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:16,877 INFO L93 Difference]: Finished difference Result 22810 states and 32417 transitions. [2024-11-11 21:29:16,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:29:16,881 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:29:16,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:16,908 INFO L225 Difference]: With dead ends: 22810 [2024-11-11 21:29:16,908 INFO L226 Difference]: Without dead ends: 14842 [2024-11-11 21:29:16,919 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:16,919 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 455 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1357 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:29:16,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1357 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:29:16,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14842 states. [2024-11-11 21:29:17,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14842 to 14816. [2024-11-11 21:29:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14816 states, 14811 states have (on average 1.402403618931875) internal successors, (20771), 14815 states have internal predecessors, (20771), 0 states have call successors, (0), 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:17,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14816 states to 14816 states and 20771 transitions. [2024-11-11 21:29:17,120 INFO L78 Accepts]: Start accepts. Automaton has 14816 states and 20771 transitions. Word has length 149 [2024-11-11 21:29:17,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:17,120 INFO L471 AbstractCegarLoop]: Abstraction has 14816 states and 20771 transitions. [2024-11-11 21:29:17,121 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:29:17,121 INFO L276 IsEmpty]: Start isEmpty. Operand 14816 states and 20771 transitions. [2024-11-11 21:29:17,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-11 21:29:17,133 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:17,133 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:29:17,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:29:17,133 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:17,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:17,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1817938944, now seen corresponding path program 1 times [2024-11-11 21:29:17,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:17,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656316106] [2024-11-11 21:29:17,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:17,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:17,546 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:17,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:17,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656316106] [2024-11-11 21:29:17,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656316106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:17,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:17,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:29:17,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405813070] [2024-11-11 21:29:17,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:17,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:29:17,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:17,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:29:17,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:17,548 INFO L87 Difference]: Start difference. First operand 14816 states and 20771 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:29:17,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:17,606 INFO L93 Difference]: Finished difference Result 24733 states and 34624 transitions. [2024-11-11 21:29:17,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:29:17,607 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:29:17,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:17,625 INFO L225 Difference]: With dead ends: 24733 [2024-11-11 21:29:17,625 INFO L226 Difference]: Without dead ends: 13164 [2024-11-11 21:29:17,638 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:17,639 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 19 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 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.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:17,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1668 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:29:17,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2024-11-11 21:29:17,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 13164. [2024-11-11 21:29:17,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13159 states have (on average 1.400866327228513) internal successors, (18434), 13163 states have internal predecessors, (18434), 0 states have call successors, (0), 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:17,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 18434 transitions. [2024-11-11 21:29:17,822 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 18434 transitions. Word has length 149 [2024-11-11 21:29:17,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:17,823 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 18434 transitions. [2024-11-11 21:29:17,823 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:29:17,823 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 18434 transitions. [2024-11-11 21:29:17,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-11 21:29:17,836 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:17,836 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:17,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:29:17,836 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:17,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:17,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1252810675, now seen corresponding path program 1 times [2024-11-11 21:29:17,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:17,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693596086] [2024-11-11 21:29:17,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:17,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:18,186 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:18,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:18,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693596086] [2024-11-11 21:29:18,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693596086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:18,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:18,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:29:18,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804495969] [2024-11-11 21:29:18,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:18,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:29:18,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:18,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:29:18,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:29:18,188 INFO L87 Difference]: Start difference. First operand 13164 states and 18434 transitions. Second operand has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:18,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:18,364 INFO L93 Difference]: Finished difference Result 17852 states and 25949 transitions. [2024-11-11 21:29:18,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:29:18,364 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2024-11-11 21:29:18,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:18,384 INFO L225 Difference]: With dead ends: 17852 [2024-11-11 21:29:18,384 INFO L226 Difference]: Without dead ends: 13166 [2024-11-11 21:29:18,394 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:29:18,395 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 2438 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2438 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:18,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2438 Valid, 1246 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:29:18,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13166 states. [2024-11-11 21:29:18,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13166 to 13164. [2024-11-11 21:29:18,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13159 states have (on average 1.3947108442890797) internal successors, (18353), 13163 states have internal predecessors, (18353), 0 states have call successors, (0), 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:18,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 18353 transitions. [2024-11-11 21:29:18,555 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 18353 transitions. Word has length 155 [2024-11-11 21:29:18,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:18,556 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 18353 transitions. [2024-11-11 21:29:18,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.375) internal successors, (155), 8 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:18,556 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 18353 transitions. [2024-11-11 21:29:18,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-11 21:29:18,566 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:18,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:18,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:29:18,567 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:18,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:18,568 INFO L85 PathProgramCache]: Analyzing trace with hash -103309827, now seen corresponding path program 1 times [2024-11-11 21:29:18,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:18,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382157952] [2024-11-11 21:29:18,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:18,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:18,856 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:18,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:18,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382157952] [2024-11-11 21:29:18,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382157952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:18,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:18,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:29:18,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78924688] [2024-11-11 21:29:18,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:18,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:29:18,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:18,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:29:18,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:18,860 INFO L87 Difference]: Start difference. First operand 13164 states and 18353 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:19,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:19,090 INFO L93 Difference]: Finished difference Result 63928 states and 88795 transitions. [2024-11-11 21:29:19,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:29:19,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2024-11-11 21:29:19,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:19,177 INFO L225 Difference]: With dead ends: 63928 [2024-11-11 21:29:19,178 INFO L226 Difference]: Without dead ends: 50803 [2024-11-11 21:29:19,209 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:29:19,210 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 1491 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 2375 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:29:19,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 2375 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:29:19,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50803 states. [2024-11-11 21:29:19,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50803 to 25389. [2024-11-11 21:29:19,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25389 states, 25384 states have (on average 1.3759060825716987) internal successors, (34926), 25388 states have internal predecessors, (34926), 0 states have call successors, (0), 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,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25389 states to 25389 states and 34926 transitions. [2024-11-11 21:29:19,850 INFO L78 Accepts]: Start accepts. Automaton has 25389 states and 34926 transitions. Word has length 155 [2024-11-11 21:29:19,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:19,851 INFO L471 AbstractCegarLoop]: Abstraction has 25389 states and 34926 transitions. [2024-11-11 21:29:19,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:19,851 INFO L276 IsEmpty]: Start isEmpty. Operand 25389 states and 34926 transitions. [2024-11-11 21:29:19,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 21:29:19,873 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:19,873 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:29:19,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:29:19,873 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:19,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:19,874 INFO L85 PathProgramCache]: Analyzing trace with hash 425314407, now seen corresponding path program 1 times [2024-11-11 21:29:19,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:19,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690883746] [2024-11-11 21:29:19,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:19,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:19,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:19,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:19,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690883746] [2024-11-11 21:29:19,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690883746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:19,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:19,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:29:19,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311137357] [2024-11-11 21:29:19,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:19,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:29:19,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:19,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:29:19,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:19,931 INFO L87 Difference]: Start difference. First operand 25389 states and 34926 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:20,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:20,206 INFO L93 Difference]: Finished difference Result 50677 states and 69721 transitions. [2024-11-11 21:29:20,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:29:20,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2024-11-11 21:29:20,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:20,246 INFO L225 Difference]: With dead ends: 50677 [2024-11-11 21:29:20,246 INFO L226 Difference]: Without dead ends: 25395 [2024-11-11 21:29:20,264 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:20,264 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 0 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1062 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:20,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1062 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:20,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25395 states. [2024-11-11 21:29:20,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25395 to 25395. [2024-11-11 21:29:20,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25395 states, 25390 states have (on average 1.3758172508861757) internal successors, (34932), 25394 states have internal predecessors, (34932), 0 states have call successors, (0), 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:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25395 states to 25395 states and 34932 transitions. [2024-11-11 21:29:20,769 INFO L78 Accepts]: Start accepts. Automaton has 25395 states and 34932 transitions. Word has length 156 [2024-11-11 21:29:20,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:20,769 INFO L471 AbstractCegarLoop]: Abstraction has 25395 states and 34932 transitions. [2024-11-11 21:29:20,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:29:20,770 INFO L276 IsEmpty]: Start isEmpty. Operand 25395 states and 34932 transitions. [2024-11-11 21:29:20,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-11 21:29:20,789 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:20,789 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:29:20,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:29:20,789 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:20,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:20,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1678824924, now seen corresponding path program 1 times [2024-11-11 21:29:20,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:20,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109774309] [2024-11-11 21:29:20,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:20,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:21,217 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:21,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:21,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109774309] [2024-11-11 21:29:21,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109774309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:21,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:21,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:29:21,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019792986] [2024-11-11 21:29:21,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:21,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:29:21,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:21,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:29:21,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:21,220 INFO L87 Difference]: Start difference. First operand 25395 states and 34932 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:29:21,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:21,634 INFO L93 Difference]: Finished difference Result 123034 states and 168589 transitions. [2024-11-11 21:29:21,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:29:21,637 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:29:21,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:21,801 INFO L225 Difference]: With dead ends: 123034 [2024-11-11 21:29:21,802 INFO L226 Difference]: Without dead ends: 97703 [2024-11-11 21:29:21,842 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:29:21,843 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 1473 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 2270 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:21,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 2270 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:29:21,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97703 states. [2024-11-11 21:29:23,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97703 to 48901. [2024-11-11 21:29:23,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48901 states, 48896 states have (on average 1.3557755235602094) internal successors, (66292), 48900 states have internal predecessors, (66292), 0 states have call successors, (0), 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,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48901 states to 48901 states and 66292 transitions. [2024-11-11 21:29:23,589 INFO L78 Accepts]: Start accepts. Automaton has 48901 states and 66292 transitions. Word has length 157 [2024-11-11 21:29:23,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:23,591 INFO L471 AbstractCegarLoop]: Abstraction has 48901 states and 66292 transitions. [2024-11-11 21:29:23,591 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:29:23,591 INFO L276 IsEmpty]: Start isEmpty. Operand 48901 states and 66292 transitions. [2024-11-11 21:29:23,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-11 21:29:23,629 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:23,629 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] [2024-11-11 21:29:23,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:29:23,630 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:23,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:23,630 INFO L85 PathProgramCache]: Analyzing trace with hash -79696538, now seen corresponding path program 1 times [2024-11-11 21:29:23,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:23,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105004391] [2024-11-11 21:29:23,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:23,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:23,717 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:23,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:23,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105004391] [2024-11-11 21:29:23,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105004391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:23,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:23,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:29:23,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287190589] [2024-11-11 21:29:23,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:23,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:29:23,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:23,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:29:23,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:23,721 INFO L87 Difference]: Start difference. First operand 48901 states and 66292 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:23,908 INFO L93 Difference]: Finished difference Result 96780 states and 131355 transitions. [2024-11-11 21:29:23,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:29:23,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2024-11-11 21:29:23,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:23,973 INFO L225 Difference]: With dead ends: 96780 [2024-11-11 21:29:23,973 INFO L226 Difference]: Without dead ends: 48915 [2024-11-11 21:29:24,015 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:24,016 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 0 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1062 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:24,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1062 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:24,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48915 states. [2024-11-11 21:29:25,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48915 to 48915. [2024-11-11 21:29:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48915 states, 48910 states have (on average 1.355673686362707) internal successors, (66306), 48914 states have internal predecessors, (66306), 0 states have call successors, (0), 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,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48915 states to 48915 states and 66306 transitions. [2024-11-11 21:29:25,369 INFO L78 Accepts]: Start accepts. Automaton has 48915 states and 66306 transitions. Word has length 158 [2024-11-11 21:29:25,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:25,369 INFO L471 AbstractCegarLoop]: Abstraction has 48915 states and 66306 transitions. [2024-11-11 21:29:25,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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,369 INFO L276 IsEmpty]: Start isEmpty. Operand 48915 states and 66306 transitions. [2024-11-11 21:29:25,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-11 21:29:25,396 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:25,396 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] [2024-11-11 21:29:25,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:29:25,396 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:25,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:25,397 INFO L85 PathProgramCache]: Analyzing trace with hash 60078395, now seen corresponding path program 1 times [2024-11-11 21:29:25,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:25,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938863059] [2024-11-11 21:29:25,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:25,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:25,923 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:25,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:25,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938863059] [2024-11-11 21:29:25,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938863059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:25,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:25,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:29:25,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128003351] [2024-11-11 21:29:25,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:25,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:29:25,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:25,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:29:25,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:25,925 INFO L87 Difference]: Start difference. First operand 48915 states and 66306 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 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:26,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:26,072 INFO L93 Difference]: Finished difference Result 86465 states and 117048 transitions. [2024-11-11 21:29:26,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:29:26,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2024-11-11 21:29:26,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:26,110 INFO L225 Difference]: With dead ends: 86465 [2024-11-11 21:29:26,110 INFO L226 Difference]: Without dead ends: 37608 [2024-11-11 21:29:26,145 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:26,146 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 12 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1649 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:26,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1649 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:26,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37608 states. [2024-11-11 21:29:26,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37608 to 37608. [2024-11-11 21:29:26,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37608 states, 37603 states have (on average 1.3513549450841689) internal successors, (50815), 37607 states have internal predecessors, (50815), 0 states have call successors, (0), 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:26,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37608 states to 37608 states and 50815 transitions. [2024-11-11 21:29:26,991 INFO L78 Accepts]: Start accepts. Automaton has 37608 states and 50815 transitions. Word has length 159 [2024-11-11 21:29:26,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:26,991 INFO L471 AbstractCegarLoop]: Abstraction has 37608 states and 50815 transitions. [2024-11-11 21:29:26,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 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:26,992 INFO L276 IsEmpty]: Start isEmpty. Operand 37608 states and 50815 transitions. [2024-11-11 21:29:27,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-11 21:29:27,020 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:27,020 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:27,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 21:29:27,021 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:27,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:27,021 INFO L85 PathProgramCache]: Analyzing trace with hash -829166184, now seen corresponding path program 1 times [2024-11-11 21:29:27,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:27,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951293582] [2024-11-11 21:29:27,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:27,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:27,386 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:27,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:27,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951293582] [2024-11-11 21:29:27,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951293582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:27,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:27,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:29:27,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058951191] [2024-11-11 21:29:27,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:27,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:29:27,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:27,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:29:27,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:27,388 INFO L87 Difference]: Start difference. First operand 37608 states and 50815 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:27,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:27,788 INFO L93 Difference]: Finished difference Result 59919 states and 81065 transitions. [2024-11-11 21:29:27,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:29:27,789 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:27,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:27,823 INFO L225 Difference]: With dead ends: 59919 [2024-11-11 21:29:27,823 INFO L226 Difference]: Without dead ends: 33772 [2024-11-11 21:29:27,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:27,840 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 465 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 1466 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:27,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 1466 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:29:27,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33772 states. [2024-11-11 21:29:28,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33772 to 33543. [2024-11-11 21:29:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33543 states, 33538 states have (on average 1.3481125887053491) internal successors, (45213), 33542 states have internal predecessors, (45213), 0 states have call successors, (0), 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:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33543 states to 33543 states and 45213 transitions. [2024-11-11 21:29:28,197 INFO L78 Accepts]: Start accepts. Automaton has 33543 states and 45213 transitions. Word has length 165 [2024-11-11 21:29:28,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:28,197 INFO L471 AbstractCegarLoop]: Abstraction has 33543 states and 45213 transitions. [2024-11-11 21:29:28,197 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:28,197 INFO L276 IsEmpty]: Start isEmpty. Operand 33543 states and 45213 transitions. [2024-11-11 21:29:28,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-11 21:29:28,214 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:28,214 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:28,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 21:29:28,215 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:28,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:28,215 INFO L85 PathProgramCache]: Analyzing trace with hash -798666505, now seen corresponding path program 1 times [2024-11-11 21:29:28,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:28,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211629119] [2024-11-11 21:29:28,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:28,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:28,683 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:28,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:28,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211629119] [2024-11-11 21:29:28,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211629119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:28,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:28,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:29:28,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640961930] [2024-11-11 21:29:28,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:28,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:29:28,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:28,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:29:28,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:28,688 INFO L87 Difference]: Start difference. First operand 33543 states and 45213 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:28,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:28,949 INFO L93 Difference]: Finished difference Result 43016 states and 59863 transitions. [2024-11-11 21:29:28,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:29:28,950 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:28,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:29,009 INFO L225 Difference]: With dead ends: 43016 [2024-11-11 21:29:29,013 INFO L226 Difference]: Without dead ends: 30722 [2024-11-11 21:29:29,042 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:29:29,043 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 598 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:29,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 974 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:29:29,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30722 states. [2024-11-11 21:29:29,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30722 to 30720. [2024-11-11 21:29:29,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30720 states, 30715 states have (on average 1.320332085300342) internal successors, (40554), 30719 states have internal predecessors, (40554), 0 states have call successors, (0), 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:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30720 states to 30720 states and 40554 transitions. [2024-11-11 21:29:29,369 INFO L78 Accepts]: Start accepts. Automaton has 30720 states and 40554 transitions. Word has length 167 [2024-11-11 21:29:29,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:29,370 INFO L471 AbstractCegarLoop]: Abstraction has 30720 states and 40554 transitions. [2024-11-11 21:29:29,370 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:29,370 INFO L276 IsEmpty]: Start isEmpty. Operand 30720 states and 40554 transitions. [2024-11-11 21:29:29,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-11 21:29:29,385 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:29,386 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:29,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 21:29:29,386 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:29,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:29,386 INFO L85 PathProgramCache]: Analyzing trace with hash -12964090, now seen corresponding path program 1 times [2024-11-11 21:29:29,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:29,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124733076] [2024-11-11 21:29:29,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:29,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:29,695 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:29,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:29,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124733076] [2024-11-11 21:29:29,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124733076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:29,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:29,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:29:29,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074585010] [2024-11-11 21:29:29,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:29,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:29:29,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:29,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:29:29,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:29,698 INFO L87 Difference]: Start difference. First operand 30720 states and 40554 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:29,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:29,840 INFO L93 Difference]: Finished difference Result 61829 states and 81584 transitions. [2024-11-11 21:29:29,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:29:29,840 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:29,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:29,874 INFO L225 Difference]: With dead ends: 61829 [2024-11-11 21:29:29,874 INFO L226 Difference]: Without dead ends: 31512 [2024-11-11 21:29:29,896 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:29:29,896 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 462 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:29,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 2184 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:29:29,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31512 states. [2024-11-11 21:29:30,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31512 to 31077. [2024-11-11 21:29:30,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31077 states, 31072 states have (on average 1.318196446961895) internal successors, (40959), 31076 states have internal predecessors, (40959), 0 states have call successors, (0), 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:30,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31077 states to 31077 states and 40959 transitions. [2024-11-11 21:29:30,539 INFO L78 Accepts]: Start accepts. Automaton has 31077 states and 40959 transitions. Word has length 167 [2024-11-11 21:29:30,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:30,539 INFO L471 AbstractCegarLoop]: Abstraction has 31077 states and 40959 transitions. [2024-11-11 21:29:30,540 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:30,540 INFO L276 IsEmpty]: Start isEmpty. Operand 31077 states and 40959 transitions. [2024-11-11 21:29:30,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-11 21:29:30,562 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:30,562 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:30,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 21:29:30,562 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:30,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:30,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1973164691, now seen corresponding path program 1 times [2024-11-11 21:29:30,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:30,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495592249] [2024-11-11 21:29:30,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:30,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:30,657 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:30,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:30,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495592249] [2024-11-11 21:29:30,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495592249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:30,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:30,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:29:30,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884313427] [2024-11-11 21:29:30,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:30,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:29:30,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:30,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:29:30,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:30,659 INFO L87 Difference]: Start difference. First operand 31077 states and 40959 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 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:31,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:31,053 INFO L93 Difference]: Finished difference Result 79161 states and 105809 transitions. [2024-11-11 21:29:31,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:29:31,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 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:31,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:31,124 INFO L225 Difference]: With dead ends: 79161 [2024-11-11 21:29:31,124 INFO L226 Difference]: Without dead ends: 56520 [2024-11-11 21:29:31,153 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:31,154 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 407 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:31,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 937 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:29:31,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56520 states. [2024-11-11 21:29:32,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56520 to 56092. [2024-11-11 21:29:32,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56092 states, 56087 states have (on average 1.3183447144614617) internal successors, (73942), 56091 states have internal predecessors, (73942), 0 states have call successors, (0), 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:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56092 states to 56092 states and 73942 transitions. [2024-11-11 21:29:32,127 INFO L78 Accepts]: Start accepts. Automaton has 56092 states and 73942 transitions. Word has length 167 [2024-11-11 21:29:32,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:32,127 INFO L471 AbstractCegarLoop]: Abstraction has 56092 states and 73942 transitions. [2024-11-11 21:29:32,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 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:32,128 INFO L276 IsEmpty]: Start isEmpty. Operand 56092 states and 73942 transitions. [2024-11-11 21:29:32,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-11 21:29:32,156 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:32,156 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:32,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 21:29:32,156 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:32,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:32,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1204570280, now seen corresponding path program 1 times [2024-11-11 21:29:32,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:32,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922029009] [2024-11-11 21:29:32,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:32,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:32,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:32,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:32,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922029009] [2024-11-11 21:29:32,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922029009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:32,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:32,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:29:32,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250081653] [2024-11-11 21:29:32,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:32,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:29:32,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:32,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:29:32,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:29:32,382 INFO L87 Difference]: Start difference. First operand 56092 states and 73942 transitions. Second operand has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 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:32,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:32,666 INFO L93 Difference]: Finished difference Result 98802 states and 133534 transitions. [2024-11-11 21:29:32,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:29:32,666 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 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:32,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:32,750 INFO L225 Difference]: With dead ends: 98802 [2024-11-11 21:29:32,750 INFO L226 Difference]: Without dead ends: 78444 [2024-11-11 21:29:32,785 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:29:32,785 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 2384 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2384 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:32,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2384 Valid, 1187 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:29:32,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78444 states. [2024-11-11 21:29:33,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78444 to 78442. [2024-11-11 21:29:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78442 states, 78437 states have (on average 1.3030712546374799) internal successors, (102209), 78441 states have internal predecessors, (102209), 0 states have call successors, (0), 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:34,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78442 states to 78442 states and 102209 transitions. [2024-11-11 21:29:34,124 INFO L78 Accepts]: Start accepts. Automaton has 78442 states and 102209 transitions. Word has length 167 [2024-11-11 21:29:34,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:34,125 INFO L471 AbstractCegarLoop]: Abstraction has 78442 states and 102209 transitions. [2024-11-11 21:29:34,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 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:34,125 INFO L276 IsEmpty]: Start isEmpty. Operand 78442 states and 102209 transitions. [2024-11-11 21:29:34,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-11 21:29:34,172 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:34,172 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 21:29:34,173 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:34,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:34,177 INFO L85 PathProgramCache]: Analyzing trace with hash -326669391, now seen corresponding path program 1 times [2024-11-11 21:29:34,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:34,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026129857] [2024-11-11 21:29:34,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:34,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:34,481 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:34,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:34,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026129857] [2024-11-11 21:29:34,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026129857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:34,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:34,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 21:29:34,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085574393] [2024-11-11 21:29:34,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:34,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:29:34,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:34,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:29:34,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:29:34,483 INFO L87 Difference]: Start difference. First operand 78442 states and 102209 transitions. Second operand has 10 states, 10 states have (on average 16.7) internal successors, (167), 9 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:34,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:34,874 INFO L93 Difference]: Finished difference Result 103465 states and 135628 transitions. [2024-11-11 21:29:34,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:29:34,875 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 9 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:34,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:34,944 INFO L225 Difference]: With dead ends: 103465 [2024-11-11 21:29:34,944 INFO L226 Difference]: Without dead ends: 43277 [2024-11-11 21:29:34,987 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:29:34,988 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 1418 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1418 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:34,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1418 Valid, 731 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:29:35,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43277 states. [2024-11-11 21:29:35,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43277 to 43277. [2024-11-11 21:29:35,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43277 states, 43272 states have (on average 1.2866287668700314) internal successors, (55675), 43276 states have internal predecessors, (55675), 0 states have call successors, (0), 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:35,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43277 states to 43277 states and 55675 transitions. [2024-11-11 21:29:35,927 INFO L78 Accepts]: Start accepts. Automaton has 43277 states and 55675 transitions. Word has length 167 [2024-11-11 21:29:35,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:35,927 INFO L471 AbstractCegarLoop]: Abstraction has 43277 states and 55675 transitions. [2024-11-11 21:29:35,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 9 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:35,927 INFO L276 IsEmpty]: Start isEmpty. Operand 43277 states and 55675 transitions. [2024-11-11 21:29:35,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-11 21:29:35,960 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:35,960 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:35,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 21:29:35,960 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:35,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:35,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1568307259, now seen corresponding path program 1 times [2024-11-11 21:29:35,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:35,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040146495] [2024-11-11 21:29:35,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:35,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:36,283 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:36,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:36,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040146495] [2024-11-11 21:29:36,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040146495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:36,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:36,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:29:36,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167881499] [2024-11-11 21:29:36,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:36,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:29:36,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:36,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:29:36,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:29:36,285 INFO L87 Difference]: Start difference. First operand 43277 states and 55675 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:36,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:36,908 INFO L93 Difference]: Finished difference Result 62229 states and 79960 transitions. [2024-11-11 21:29:36,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:29:36,908 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:36,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:36,945 INFO L225 Difference]: With dead ends: 62229 [2024-11-11 21:29:36,946 INFO L226 Difference]: Without dead ends: 37349 [2024-11-11 21:29:36,961 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:36,962 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 2 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:36,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1594 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:29:36,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37349 states. [2024-11-11 21:29:37,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37349 to 37349. [2024-11-11 21:29:37,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37349 states, 37344 states have (on average 1.2866859468723222) internal successors, (48050), 37348 states have internal predecessors, (48050), 0 states have call successors, (0), 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:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37349 states to 37349 states and 48050 transitions. [2024-11-11 21:29:37,373 INFO L78 Accepts]: Start accepts. Automaton has 37349 states and 48050 transitions. Word has length 167 [2024-11-11 21:29:37,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:37,373 INFO L471 AbstractCegarLoop]: Abstraction has 37349 states and 48050 transitions. [2024-11-11 21:29:37,373 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:37,374 INFO L276 IsEmpty]: Start isEmpty. Operand 37349 states and 48050 transitions. [2024-11-11 21:29:37,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-11 21:29:37,396 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:37,397 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:37,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 21:29:37,397 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:37,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:37,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2126052944, now seen corresponding path program 1 times [2024-11-11 21:29:37,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:37,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110763881] [2024-11-11 21:29:37,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:37,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:37,465 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:37,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:37,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110763881] [2024-11-11 21:29:37,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110763881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:37,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:37,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:29:37,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008837275] [2024-11-11 21:29:37,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:37,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:29:37,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:37,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:29:37,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:29:37,468 INFO L87 Difference]: Start difference. First operand 37349 states and 48050 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:37,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:37,772 INFO L93 Difference]: Finished difference Result 91927 states and 119764 transitions. [2024-11-11 21:29:37,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:29:37,772 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:37,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:37,845 INFO L225 Difference]: With dead ends: 91927 [2024-11-11 21:29:37,845 INFO L226 Difference]: Without dead ends: 66713 [2024-11-11 21:29:37,878 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:37,878 INFO L435 NwaCegarLoop]: 583 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, 970 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:37,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 970 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:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66713 states. [2024-11-11 21:29:38,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66713 to 65830. [2024-11-11 21:29:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65830 states, 65825 states have (on average 1.2839346752753513) internal successors, (84515), 65829 states have internal predecessors, (84515), 0 states have call successors, (0), 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:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65830 states to 65830 states and 84515 transitions. [2024-11-11 21:29:39,278 INFO L78 Accepts]: Start accepts. Automaton has 65830 states and 84515 transitions. Word has length 169 [2024-11-11 21:29:39,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:39,279 INFO L471 AbstractCegarLoop]: Abstraction has 65830 states and 84515 transitions. [2024-11-11 21:29:39,279 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:39,279 INFO L276 IsEmpty]: Start isEmpty. Operand 65830 states and 84515 transitions. [2024-11-11 21:29:39,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-11 21:29:39,316 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:39,316 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:39,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 21:29:39,319 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:39,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:39,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1504634869, now seen corresponding path program 1 times [2024-11-11 21:29:39,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:39,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362938974] [2024-11-11 21:29:39,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:39,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:39,831 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:39,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:39,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362938974] [2024-11-11 21:29:39,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362938974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:39,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:39,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-11 21:29:39,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713581287] [2024-11-11 21:29:39,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:39,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 21:29:39,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:39,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 21:29:39,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-11-11 21:29:39,833 INFO L87 Difference]: Start difference. First operand 65830 states and 84515 transitions. Second operand has 14 states, 14 states have (on average 12.071428571428571) internal successors, (169), 14 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:41,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:41,143 INFO L93 Difference]: Finished difference Result 114075 states and 146793 transitions. [2024-11-11 21:29:41,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-11 21:29:41,144 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.071428571428571) internal successors, (169), 14 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:41,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:41,268 INFO L225 Difference]: With dead ends: 114075 [2024-11-11 21:29:41,268 INFO L226 Difference]: Without dead ends: 101454 [2024-11-11 21:29:41,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2024-11-11 21:29:41,289 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 3288 mSDsluCounter, 6508 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3288 SdHoareTripleChecker+Valid, 7302 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:41,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3288 Valid, 7302 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1292 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:29:41,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101454 states. [2024-11-11 21:29:42,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101454 to 78228. [2024-11-11 21:29:42,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78228 states, 78223 states have (on average 1.260613885941475) internal successors, (98609), 78227 states have internal predecessors, (98609), 0 states have call successors, (0), 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:42,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78228 states to 78228 states and 98609 transitions. [2024-11-11 21:29:42,778 INFO L78 Accepts]: Start accepts. Automaton has 78228 states and 98609 transitions. Word has length 169 [2024-11-11 21:29:42,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:42,778 INFO L471 AbstractCegarLoop]: Abstraction has 78228 states and 98609 transitions. [2024-11-11 21:29:42,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.071428571428571) internal successors, (169), 14 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:42,778 INFO L276 IsEmpty]: Start isEmpty. Operand 78228 states and 98609 transitions. [2024-11-11 21:29:42,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-11 21:29:42,828 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:42,828 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:42,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-11 21:29:42,828 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:42,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:42,829 INFO L85 PathProgramCache]: Analyzing trace with hash 470682753, now seen corresponding path program 1 times [2024-11-11 21:29:42,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:42,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876424614] [2024-11-11 21:29:42,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:42,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:43,415 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:43,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:43,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876424614] [2024-11-11 21:29:43,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876424614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:43,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:43,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-11 21:29:43,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050483816] [2024-11-11 21:29:43,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:43,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 21:29:43,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:43,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 21:29:43,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-11 21:29:43,418 INFO L87 Difference]: Start difference. First operand 78228 states and 98609 transitions. Second operand has 16 states, 16 states have (on average 10.5625) internal successors, (169), 16 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:45,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:45,076 INFO L93 Difference]: Finished difference Result 108899 states and 138744 transitions. [2024-11-11 21:29:45,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-11 21:29:45,076 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.5625) internal successors, (169), 16 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:45,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:45,185 INFO L225 Difference]: With dead ends: 108899 [2024-11-11 21:29:45,186 INFO L226 Difference]: Without dead ends: 98693 [2024-11-11 21:29:45,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=262, Invalid=794, Unknown=0, NotChecked=0, Total=1056 [2024-11-11 21:29:45,227 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 3138 mSDsluCounter, 6923 mSDsCounter, 0 mSdLazyCounter, 1861 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3138 SdHoareTripleChecker+Valid, 7698 SdHoareTripleChecker+Invalid, 1947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:45,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3138 Valid, 7698 Invalid, 1947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1861 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 21:29:45,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98693 states. [2024-11-11 21:29:46,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98693 to 89750. [2024-11-11 21:29:46,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89750 states, 89745 states have (on average 1.2477463925566883) internal successors, (111979), 89749 states have internal predecessors, (111979), 0 states have call successors, (0), 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:46,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89750 states to 89750 states and 111979 transitions. [2024-11-11 21:29:46,547 INFO L78 Accepts]: Start accepts. Automaton has 89750 states and 111979 transitions. Word has length 169 [2024-11-11 21:29:46,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:46,547 INFO L471 AbstractCegarLoop]: Abstraction has 89750 states and 111979 transitions. [2024-11-11 21:29:46,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.5625) internal successors, (169), 16 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:46,548 INFO L276 IsEmpty]: Start isEmpty. Operand 89750 states and 111979 transitions. [2024-11-11 21:29:46,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-11 21:29:46,605 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:46,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:46,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-11 21:29:46,605 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:46,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:46,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1113489418, now seen corresponding path program 1 times [2024-11-11 21:29:46,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:46,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84713198] [2024-11-11 21:29:46,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:46,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:47,672 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:47,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:47,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84713198] [2024-11-11 21:29:47,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84713198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:47,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:47,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-11 21:29:47,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017200249] [2024-11-11 21:29:47,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:47,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 21:29:47,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:47,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 21:29:47,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-11-11 21:29:47,674 INFO L87 Difference]: Start difference. First operand 89750 states and 111979 transitions. Second operand has 16 states, 16 states have (on average 10.5625) internal successors, (169), 16 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:49,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:49,218 INFO L93 Difference]: Finished difference Result 171296 states and 220559 transitions. [2024-11-11 21:29:49,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-11 21:29:49,219 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.5625) internal successors, (169), 16 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:49,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:49,423 INFO L225 Difference]: With dead ends: 171296 [2024-11-11 21:29:49,423 INFO L226 Difference]: Without dead ends: 161569 [2024-11-11 21:29:49,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2024-11-11 21:29:49,484 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 5901 mSDsluCounter, 6294 mSDsCounter, 0 mSdLazyCounter, 1688 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5901 SdHoareTripleChecker+Valid, 6942 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:49,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5901 Valid, 6942 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1688 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 21:29:49,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161569 states. [2024-11-11 21:29:51,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161569 to 108359. [2024-11-11 21:29:51,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108359 states, 108354 states have (on average 1.2346567731694262) internal successors, (133780), 108358 states have internal predecessors, (133780), 0 states have call successors, (0), 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:51,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108359 states to 108359 states and 133780 transitions. [2024-11-11 21:29:51,641 INFO L78 Accepts]: Start accepts. Automaton has 108359 states and 133780 transitions. Word has length 169 [2024-11-11 21:29:51,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:29:51,642 INFO L471 AbstractCegarLoop]: Abstraction has 108359 states and 133780 transitions. [2024-11-11 21:29:51,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.5625) internal successors, (169), 16 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:51,642 INFO L276 IsEmpty]: Start isEmpty. Operand 108359 states and 133780 transitions. [2024-11-11 21:29:51,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-11 21:29:51,712 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:29:51,712 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:51,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-11 21:29:51,713 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:29:51,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:29:51,714 INFO L85 PathProgramCache]: Analyzing trace with hash 763562170, now seen corresponding path program 1 times [2024-11-11 21:29:51,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:29:51,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829530985] [2024-11-11 21:29:51,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:29:51,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:29:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:29:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:29:54,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:29:54,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829530985] [2024-11-11 21:29:54,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829530985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:29:54,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:29:54,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-11-11 21:29:54,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120129751] [2024-11-11 21:29:54,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:29:54,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-11 21:29:54,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:29:54,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-11 21:29:54,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2024-11-11 21:29:54,034 INFO L87 Difference]: Start difference. First operand 108359 states and 133780 transitions. Second operand has 23 states, 23 states have (on average 7.3478260869565215) internal successors, (169), 23 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:58,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:29:58,490 INFO L93 Difference]: Finished difference Result 147960 states and 188306 transitions. [2024-11-11 21:29:58,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-11 21:29:58,491 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.3478260869565215) internal successors, (169), 23 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:58,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:29:58,649 INFO L225 Difference]: With dead ends: 147960 [2024-11-11 21:29:58,649 INFO L226 Difference]: Without dead ends: 141713 [2024-11-11 21:29:58,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=352, Invalid=1130, Unknown=0, NotChecked=0, Total=1482 [2024-11-11 21:29:58,678 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 4772 mSDsluCounter, 9359 mSDsCounter, 0 mSdLazyCounter, 3992 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4772 SdHoareTripleChecker+Valid, 10024 SdHoareTripleChecker+Invalid, 4056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:29:58,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4772 Valid, 10024 Invalid, 4056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3992 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-11 21:29:58,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141713 states. [2024-11-11 21:30:00,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141713 to 109843. [2024-11-11 21:30:00,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109843 states, 109838 states have (on average 1.2330887306760867) internal successors, (135440), 109842 states have internal predecessors, (135440), 0 states have call successors, (0), 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:30:00,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109843 states to 109843 states and 135440 transitions. [2024-11-11 21:30:00,773 INFO L78 Accepts]: Start accepts. Automaton has 109843 states and 135440 transitions. Word has length 169 [2024-11-11 21:30:00,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:30:00,774 INFO L471 AbstractCegarLoop]: Abstraction has 109843 states and 135440 transitions. [2024-11-11 21:30:00,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.3478260869565215) internal successors, (169), 23 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:30:00,774 INFO L276 IsEmpty]: Start isEmpty. Operand 109843 states and 135440 transitions. [2024-11-11 21:30:00,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-11 21:30:00,837 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:30:00,837 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:30:00,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-11 21:30:00,837 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:30:00,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:30:00,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1014770631, now seen corresponding path program 1 times [2024-11-11 21:30:00,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:30:00,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364587786] [2024-11-11 21:30:00,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:30:00,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:30:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:30:01,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:30:01,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:30:01,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364587786] [2024-11-11 21:30:01,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364587786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:30:01,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:30:01,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 21:30:01,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000874843] [2024-11-11 21:30:01,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:30:01,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:30:01,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:30:01,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:30:01,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:30:01,117 INFO L87 Difference]: Start difference. First operand 109843 states and 135440 transitions. Second operand has 10 states, 10 states have (on average 16.9) internal successors, (169), 9 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:30:01,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:30:01,534 INFO L93 Difference]: Finished difference Result 170840 states and 212920 transitions. [2024-11-11 21:30:01,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:30:01,534 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.9) internal successors, (169), 9 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:30:01,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:30:01,630 INFO L225 Difference]: With dead ends: 170840 [2024-11-11 21:30:01,630 INFO L226 Difference]: Without dead ends: 78243 [2024-11-11 21:30:01,696 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:30:01,696 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 1389 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1389 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:30:01,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1389 Valid, 718 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:30:01,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78243 states. [2024-11-11 21:30:02,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78243 to 70041. [2024-11-11 21:30:02,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70041 states, 70036 states have (on average 1.2147038665829002) internal successors, (85073), 70040 states have internal predecessors, (85073), 0 states have call successors, (0), 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:30:02,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70041 states to 70041 states and 85073 transitions. [2024-11-11 21:30:02,908 INFO L78 Accepts]: Start accepts. Automaton has 70041 states and 85073 transitions. Word has length 169 [2024-11-11 21:30:02,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:30:02,909 INFO L471 AbstractCegarLoop]: Abstraction has 70041 states and 85073 transitions. [2024-11-11 21:30:02,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.9) internal successors, (169), 9 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:30:02,909 INFO L276 IsEmpty]: Start isEmpty. Operand 70041 states and 85073 transitions. [2024-11-11 21:30:02,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-11 21:30:02,957 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:30:02,957 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:30:02,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-11 21:30:02,958 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:30:02,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:30:02,958 INFO L85 PathProgramCache]: Analyzing trace with hash -350491148, now seen corresponding path program 1 times [2024-11-11 21:30:02,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:30:02,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680330132] [2024-11-11 21:30:02,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:30:02,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:30:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:30:04,661 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:30:04,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:30:04,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680330132] [2024-11-11 21:30:04,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680330132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:30:04,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:30:04,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-11-11 21:30:04,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588836674] [2024-11-11 21:30:04,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:30:04,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-11 21:30:04,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:30:04,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-11 21:30:04,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2024-11-11 21:30:04,664 INFO L87 Difference]: Start difference. First operand 70041 states and 85073 transitions. Second operand has 23 states, 23 states have (on average 7.3478260869565215) internal successors, (169), 23 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:30:10,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:30:10,182 INFO L93 Difference]: Finished difference Result 109971 states and 141647 transitions. [2024-11-11 21:30:10,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-11 21:30:10,182 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.3478260869565215) internal successors, (169), 23 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:30:10,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:30:10,300 INFO L225 Difference]: With dead ends: 109971 [2024-11-11 21:30:10,301 INFO L226 Difference]: Without dead ends: 107332 [2024-11-11 21:30:10,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=733, Invalid=3299, Unknown=0, NotChecked=0, Total=4032 [2024-11-11 21:30:10,321 INFO L435 NwaCegarLoop]: 948 mSDtfsCounter, 4874 mSDsluCounter, 13383 mSDsCounter, 0 mSdLazyCounter, 5078 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4874 SdHoareTripleChecker+Valid, 14331 SdHoareTripleChecker+Invalid, 5192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 5078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-11 21:30:10,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4874 Valid, 14331 Invalid, 5192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 5078 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-11 21:30:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107332 states. [2024-11-11 21:30:11,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107332 to 72609. [2024-11-11 21:30:11,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72609 states, 72604 states have (on average 1.2125640460580684) internal successors, (88037), 72608 states have internal predecessors, (88037), 0 states have call successors, (0), 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:30:11,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72609 states to 72609 states and 88037 transitions. [2024-11-11 21:30:11,419 INFO L78 Accepts]: Start accepts. Automaton has 72609 states and 88037 transitions. Word has length 169 [2024-11-11 21:30:11,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:30:11,419 INFO L471 AbstractCegarLoop]: Abstraction has 72609 states and 88037 transitions. [2024-11-11 21:30:11,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.3478260869565215) internal successors, (169), 23 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:30:11,419 INFO L276 IsEmpty]: Start isEmpty. Operand 72609 states and 88037 transitions. [2024-11-11 21:30:11,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-11 21:30:11,472 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:30:11,472 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:30:11,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-11 21:30:11,472 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:30:11,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:30:11,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1837923337, now seen corresponding path program 1 times [2024-11-11 21:30:11,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:30:11,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586275234] [2024-11-11 21:30:11,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:30:11,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:30:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:30:13,150 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:30:13,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:30:13,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586275234] [2024-11-11 21:30:13,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586275234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:30:13,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:30:13,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-11 21:30:13,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776280459] [2024-11-11 21:30:13,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:30:13,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-11 21:30:13,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:30:13,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-11 21:30:13,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2024-11-11 21:30:13,153 INFO L87 Difference]: Start difference. First operand 72609 states and 88037 transitions. Second operand has 22 states, 22 states have (on average 7.681818181818182) internal successors, (169), 22 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:30:20,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:30:20,356 INFO L93 Difference]: Finished difference Result 98260 states and 123113 transitions. [2024-11-11 21:30:20,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-11 21:30:20,356 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.681818181818182) internal successors, (169), 22 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:30:20,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:30:20,441 INFO L225 Difference]: With dead ends: 98260 [2024-11-11 21:30:20,441 INFO L226 Difference]: Without dead ends: 93878 [2024-11-11 21:30:20,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1040, Invalid=4216, Unknown=0, NotChecked=0, Total=5256 [2024-11-11 21:30:20,456 INFO L435 NwaCegarLoop]: 1260 mSDtfsCounter, 6585 mSDsluCounter, 16936 mSDsCounter, 0 mSdLazyCounter, 6201 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6585 SdHoareTripleChecker+Valid, 18196 SdHoareTripleChecker+Invalid, 6373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 6201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-11 21:30:20,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6585 Valid, 18196 Invalid, 6373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 6201 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-11 21:30:20,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93878 states. [2024-11-11 21:30:21,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93878 to 74933. [2024-11-11 21:30:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74933 states, 74928 states have (on average 1.2087604099935938) internal successors, (90570), 74932 states have internal predecessors, (90570), 0 states have call successors, (0), 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:30:21,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74933 states to 74933 states and 90570 transitions. [2024-11-11 21:30:21,422 INFO L78 Accepts]: Start accepts. Automaton has 74933 states and 90570 transitions. Word has length 169 [2024-11-11 21:30:21,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:30:21,422 INFO L471 AbstractCegarLoop]: Abstraction has 74933 states and 90570 transitions. [2024-11-11 21:30:21,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.681818181818182) internal successors, (169), 22 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:30:21,423 INFO L276 IsEmpty]: Start isEmpty. Operand 74933 states and 90570 transitions. [2024-11-11 21:30:21,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-11 21:30:21,478 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:30:21,478 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:30:21,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-11 21:30:21,478 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-11 21:30:21,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:30:21,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1736661874, now seen corresponding path program 1 times [2024-11-11 21:30:21,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:30:21,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399708277] [2024-11-11 21:30:21,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:30:21,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:30:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:30:23,307 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:30:23,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:30:23,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399708277] [2024-11-11 21:30:23,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399708277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:30:23,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:30:23,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-11-11 21:30:23,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853739384] [2024-11-11 21:30:23,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:30:23,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-11 21:30:23,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:30:23,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-11 21:30:23,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2024-11-11 21:30:23,309 INFO L87 Difference]: Start difference. First operand 74933 states and 90570 transitions. Second operand has 24 states, 24 states have (on average 7.041666666666667) internal successors, (169), 24 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)