./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-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 297d4f7e6fe1324d357f4812a6556f1cd58caa692e4601779e6f52e2ab17fbf7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:58:52,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:58:52,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:58:52,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:58:52,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:58:52,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:58:52,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:58:52,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:58:52,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:58:52,486 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:58:52,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:58:52,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:58:52,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:58:52,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:58:52,493 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:58:52,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:58:52,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:58:52,494 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:58:52,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:58:52,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:58:52,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:58:52,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:58:52,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:58:52,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:58:52,497 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:58:52,498 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:58:52,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:58:52,498 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:58:52,498 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:58:52,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:58:52,499 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:58:52,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:58:52,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:58:52,500 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:58:52,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:58:52,500 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:58:52,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:58:52,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:58:52,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:58:52,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:58:52,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:58:52,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:58:52,503 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 -> 297d4f7e6fe1324d357f4812a6556f1cd58caa692e4601779e6f52e2ab17fbf7 [2024-11-09 23:58:52,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:58:52,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:58:52,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:58:52,778 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:58:52,778 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:58:52,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-11-09 23:58:54,175 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:58:54,462 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:58:54,462 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-11-09 23:58:54,480 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86aee6527/bc3543602da842c68b54f2001be5cbab/FLAGb041e56d0 [2024-11-09 23:58:54,516 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86aee6527/bc3543602da842c68b54f2001be5cbab [2024-11-09 23:58:54,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:58:54,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:58:54,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:58:54,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:58:54,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:58:54,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:58:54" (1/1) ... [2024-11-09 23:58:54,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3de1e7f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:54, skipping insertion in model container [2024-11-09 23:58:54,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:58:54" (1/1) ... [2024-11-09 23:58:54,609 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:58:54,967 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16948,16961] [2024-11-09 23:58:55,004 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[23372,23385] [2024-11-09 23:58:55,026 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[26559,26572] [2024-11-09 23:58:55,036 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[29535,29548] [2024-11-09 23:58:55,056 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33298,33311] [2024-11-09 23:58:55,069 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[36350,36363] [2024-11-09 23:58:55,093 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[39535,39548] [2024-11-09 23:58:55,108 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[42506,42519] [2024-11-09 23:58:55,126 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[45890,45903] [2024-11-09 23:58:55,142 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[48876,48889] [2024-11-09 23:58:55,157 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[52025,52038] [2024-11-09 23:58:55,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:58:55,210 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:58:55,264 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16948,16961] [2024-11-09 23:58:55,283 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[23372,23385] [2024-11-09 23:58:55,298 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[26559,26572] [2024-11-09 23:58:55,308 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[29535,29548] [2024-11-09 23:58:55,321 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33298,33311] [2024-11-09 23:58:55,328 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[36350,36363] [2024-11-09 23:58:55,338 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[39535,39548] [2024-11-09 23:58:55,348 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[42506,42519] [2024-11-09 23:58:55,355 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[45890,45903] [2024-11-09 23:58:55,367 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[48876,48889] [2024-11-09 23:58:55,375 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[52025,52038] [2024-11-09 23:58:55,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:58:55,414 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:58:55,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:55 WrapperNode [2024-11-09 23:58:55,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:58:55,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:58:55,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:58:55,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:58:55,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:55" (1/1) ... [2024-11-09 23:58:55,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:55" (1/1) ... [2024-11-09 23:58:55,530 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2763 [2024-11-09 23:58:55,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:58:55,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:58:55,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:58:55,531 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:58:55,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:55" (1/1) ... [2024-11-09 23:58:55,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:55" (1/1) ... [2024-11-09 23:58:55,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:55" (1/1) ... [2024-11-09 23:58:55,622 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-09 23:58:55,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:55" (1/1) ... [2024-11-09 23:58:55,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:55" (1/1) ... [2024-11-09 23:58:55,651 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:55" (1/1) ... [2024-11-09 23:58:55,656 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:55" (1/1) ... [2024-11-09 23:58:55,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:55" (1/1) ... [2024-11-09 23:58:55,677 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:55" (1/1) ... [2024-11-09 23:58:55,690 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:58:55,691 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:58:55,692 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:58:55,692 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:58:55,692 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:55" (1/1) ... [2024-11-09 23:58:55,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:58:55,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:58:55,724 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-09 23:58:55,731 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-09 23:58:55,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:58:55,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:58:55,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:58:55,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:58:55,937 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:58:55,939 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:58:57,629 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3669: havoc main_~node2__m2~15#1;havoc main_~node1__m1~14#1; [2024-11-09 23:58:57,630 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3669: havoc main_~node2__m2~15#1;havoc main_~node1__m1~14#1; [2024-11-09 23:58:57,630 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3669: havoc main_~node2__m2~15#1;havoc main_~node1__m1~14#1; [2024-11-09 23:58:57,631 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2943: havoc main_~node3__m3~13#1;havoc main_~node2__m2~12#1; [2024-11-09 23:58:57,631 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2943: havoc main_~node3__m3~13#1;havoc main_~node2__m2~12#1; [2024-11-09 23:58:57,631 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2086: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~14#1; [2024-11-09 23:58:57,631 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2086: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~14#1; [2024-11-09 23:58:57,632 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2086: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~14#1; [2024-11-09 23:58:57,632 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2086: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~14#1; [2024-11-09 23:58:57,632 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2682: havoc main_~node3__m3~12#1;havoc main_~node2__m2~11#1; [2024-11-09 23:58:57,632 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2682: havoc main_~node3__m3~12#1;havoc main_~node2__m2~11#1; [2024-11-09 23:58:57,632 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3409: havoc main_~node1__m1~13#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2024-11-09 23:58:57,632 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3409: havoc main_~node1__m1~13#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2024-11-09 23:58:57,632 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3409: havoc main_~node1__m1~13#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2024-11-09 23:58:57,633 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3409: havoc main_~node1__m1~13#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2024-11-09 23:58:57,633 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2154: havoc main_~node4__m4~11#1;havoc main_~node3__m3~9#1; [2024-11-09 23:58:57,633 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2154: havoc main_~node4__m4~11#1;havoc main_~node3__m3~9#1; [2024-11-09 23:58:57,633 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1956: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~13#1;havoc main_~node4__m4~10#1; [2024-11-09 23:58:57,633 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1956: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~13#1;havoc main_~node4__m4~10#1; [2024-11-09 23:58:57,633 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1362: havoc main_~node1__m1~5#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~8#1; [2024-11-09 23:58:57,633 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1362: havoc main_~node1__m1~5#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~8#1; [2024-11-09 23:58:57,634 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1362: havoc main_~node1__m1~5#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~8#1; [2024-11-09 23:58:57,634 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1362: havoc main_~node1__m1~5#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~8#1; [2024-11-09 23:58:57,634 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:58:57,634 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:58:57,634 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:58:57,634 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:58:57,635 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:58:57,635 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:58:57,635 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:58:57,635 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:58:57,635 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:58:57,635 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:58:57,636 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:58:57,636 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:58:57,636 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:58:57,636 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:58:57,636 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:58:57,636 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:58:57,636 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:58:57,636 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:58:57,636 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:58:57,636 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:58:57,637 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:58:57,638 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:58:57,638 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:58:57,639 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:58:57,639 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4469: havoc main_~node1____CPAchecker_TMP_0~1#1; [2024-11-09 23:58:57,639 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2490: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1;havoc main_~node4__m4~13#1; [2024-11-09 23:58:57,639 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2490: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1;havoc main_~node4__m4~13#1; [2024-11-09 23:58:57,639 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2490: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1;havoc main_~node4__m4~13#1; [2024-11-09 23:58:57,640 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2490: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1;havoc main_~node4__m4~13#1; [2024-11-09 23:58:57,640 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3746: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~27#1; [2024-11-09 23:58:57,640 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3746: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~27#1; [2024-11-09 23:58:57,640 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3746: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~27#1; [2024-11-09 23:58:57,640 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1700: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~11#1;havoc main_~node4__m4~8#1; [2024-11-09 23:58:57,640 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1700: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~11#1;havoc main_~node4__m4~8#1; [2024-11-09 23:58:57,641 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1700: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~11#1;havoc main_~node4__m4~8#1; [2024-11-09 23:58:57,641 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1700: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~11#1;havoc main_~node4__m4~8#1; [2024-11-09 23:58:57,641 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L381: havoc main_~check__tmp~1#1;havoc main_~node4__m4~1#1; [2024-11-09 23:58:57,641 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L381: havoc main_~check__tmp~1#1;havoc main_~node4__m4~1#1; [2024-11-09 23:58:57,641 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L381: havoc main_~check__tmp~1#1;havoc main_~node4__m4~1#1; [2024-11-09 23:58:57,641 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L381: havoc main_~check__tmp~1#1;havoc main_~node4__m4~1#1; [2024-11-09 23:58:57,641 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L844: havoc main_~node1__m1~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~4#1; [2024-11-09 23:58:57,641 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L844: havoc main_~node1__m1~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~4#1; [2024-11-09 23:58:57,641 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L844: havoc main_~node1__m1~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~4#1; [2024-11-09 23:58:57,641 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L844: havoc main_~node1__m1~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~4#1; [2024-11-09 23:58:57,641 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2430: havoc main_~node3__m3~11#1;havoc main_~node2__m2~10#1; [2024-11-09 23:58:57,642 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2430: havoc main_~node3__m3~11#1;havoc main_~node2__m2~10#1; [2024-11-09 23:58:57,642 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4412: havoc main_~node3____CPAchecker_TMP_0~4#1; [2024-11-09 23:58:57,642 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L583: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~2#1; [2024-11-09 23:58:57,642 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L583: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~2#1; [2024-11-09 23:58:57,642 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L583: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~2#1; [2024-11-09 23:58:57,642 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L583: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~2#1; [2024-11-09 23:58:57,642 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3160: havoc main_~node2__m2~13#1;havoc main_~node1__m1~12#1; [2024-11-09 23:58:57,642 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3160: havoc main_~node2__m2~13#1;havoc main_~node1__m1~12#1; [2024-11-09 23:58:57,642 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3160: havoc main_~node2__m2~13#1;havoc main_~node1__m1~12#1; [2024-11-09 23:58:57,642 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3887: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~28#1; [2024-11-09 23:58:57,642 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3887: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~28#1; [2024-11-09 23:58:57,643 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3887: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~28#1; [2024-11-09 23:58:57,643 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3887: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~28#1; [2024-11-09 23:58:57,643 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4152: havoc main_~node2__m2~17#1;havoc main_~node1__m1~16#1; [2024-11-09 23:58:57,643 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4152: havoc main_~node2__m2~17#1;havoc main_~node1__m1~16#1; [2024-11-09 23:58:57,643 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4152: havoc main_~node2__m2~17#1;havoc main_~node1__m1~16#1; [2024-11-09 23:58:57,643 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907: havoc main_~node3__m3~8#1;havoc main_~node2__m2~7#1; [2024-11-09 23:58:57,643 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907: havoc main_~node3__m3~8#1;havoc main_~node2__m2~7#1; [2024-11-09 23:58:57,643 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907: havoc main_~node3__m3~8#1;havoc main_~node2__m2~7#1; [2024-11-09 23:58:57,643 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907: havoc main_~node3__m3~8#1;havoc main_~node2__m2~7#1; [2024-11-09 23:58:57,643 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3955: havoc main_~node4__m4~22#1;havoc main_~node3__m3~18#1; [2024-11-09 23:58:57,644 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3955: havoc main_~node4__m4~22#1;havoc main_~node3__m3~18#1; [2024-11-09 23:58:57,644 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1182: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~7#1;havoc main_~node4__m4~5#1; [2024-11-09 23:58:57,644 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1182: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~7#1;havoc main_~node4__m4~5#1; [2024-11-09 23:58:57,644 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4222: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~31#1; [2024-11-09 23:58:57,644 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4222: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~31#1; [2024-11-09 23:58:57,644 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4222: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~31#1; [2024-11-09 23:58:57,649 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4222: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~31#1; [2024-11-09 23:58:57,649 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2901: havoc main_~node1__m1~11#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2024-11-09 23:58:57,649 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2901: havoc main_~node1__m1~11#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2024-11-09 23:58:57,649 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2901: havoc main_~node1__m1~11#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2024-11-09 23:58:57,649 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2901: havoc main_~node1__m1~11#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2024-11-09 23:58:57,650 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1646: havoc main_~node3__m3~7#1;havoc main_~node2__m2~6#1; [2024-11-09 23:58:57,650 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1646: havoc main_~node3__m3~7#1;havoc main_~node2__m2~6#1; [2024-11-09 23:58:57,650 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1646: havoc main_~node3__m3~7#1;havoc main_~node2__m2~6#1; [2024-11-09 23:58:57,650 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1646: havoc main_~node3__m3~7#1;havoc main_~node2__m2~6#1; [2024-11-09 23:58:57,650 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3364: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~18#1;havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~15#1; [2024-11-09 23:58:57,650 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1317: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~6#1;havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__m3~5#1; [2024-11-09 23:58:57,650 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1452: havoc main_~check__tmp~9#1;havoc main_~node4__m4~7#1; [2024-11-09 23:58:57,650 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1452: havoc main_~check__tmp~9#1;havoc main_~node4__m4~7#1; [2024-11-09 23:58:57,650 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1452: havoc main_~check__tmp~9#1;havoc main_~node4__m4~7#1; [2024-11-09 23:58:57,650 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1452: havoc main_~check__tmp~9#1;havoc main_~node4__m4~7#1; [2024-11-09 23:58:57,650 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3699: havoc main_~node4__m4~20#1;havoc main_~node3__m3~17#1; [2024-11-09 23:58:57,650 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3699: havoc main_~node4__m4~20#1;havoc main_~node3__m3~17#1; [2024-11-09 23:58:57,651 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3237: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1; [2024-11-09 23:58:57,651 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3237: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1; [2024-11-09 23:58:57,651 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3237: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1; [2024-11-09 23:58:57,651 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L332: havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1; [2024-11-09 23:58:57,651 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L332: havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1; [2024-11-09 23:58:57,651 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L332: havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1; [2024-11-09 23:58:57,651 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L332: havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1; [2024-11-09 23:58:57,651 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3636: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~26#1; [2024-11-09 23:58:57,651 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3636: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~26#1; [2024-11-09 23:58:57,651 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3636: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~26#1; [2024-11-09 23:58:57,651 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3636: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~26#1; [2024-11-09 23:58:57,651 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2645: havoc main_~node1__m1~10#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2024-11-09 23:58:57,651 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2645: havoc main_~node1__m1~10#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2024-11-09 23:58:57,652 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2645: havoc main_~node1__m1~10#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2024-11-09 23:58:57,652 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2645: havoc main_~node1__m1~10#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2024-11-09 23:58:57,652 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3505: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~25#1;havoc main_~node4__m4~19#1; [2024-11-09 23:58:57,652 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3505: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~25#1;havoc main_~node4__m4~19#1; [2024-11-09 23:58:57,652 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3505: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~25#1;havoc main_~node4__m4~19#1; [2024-11-09 23:58:57,652 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3505: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~25#1;havoc main_~node4__m4~19#1; [2024-11-09 23:58:57,655 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1128: havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1; [2024-11-09 23:58:57,655 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1128: havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1; [2024-11-09 23:58:57,655 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1128: havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1; [2024-11-09 23:58:57,655 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1128: havoc main_~node3__m3~4#1;havoc main_~node2__m2~4#1; [2024-11-09 23:58:57,655 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2119: havoc main_~node2__m2~8#1;havoc main_~node1__m1~8#1; [2024-11-09 23:58:57,656 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2119: havoc main_~node2__m2~8#1;havoc main_~node1__m1~8#1; [2024-11-09 23:58:57,656 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2119: havoc main_~node2__m2~8#1;havoc main_~node1__m1~8#1; [2024-11-09 23:58:57,656 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L799: havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__m4~3#1; [2024-11-09 23:58:57,656 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L934: havoc main_~check__tmp~5#1;havoc main_~node4__m4~4#1; [2024-11-09 23:58:57,656 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L934: havoc main_~check__tmp~5#1;havoc main_~node4__m4~4#1; [2024-11-09 23:58:57,657 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2388: havoc main_~node1__m1~9#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~16#1; [2024-11-09 23:58:57,657 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2388: havoc main_~node1__m1~9#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~16#1; [2024-11-09 23:58:57,657 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2388: havoc main_~node1__m1~9#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~16#1; [2024-11-09 23:58:57,657 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2388: havoc main_~node1__m1~9#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~16#1; [2024-11-09 23:58:57,657 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1860: havoc main_~node1__m1~7#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~12#1; [2024-11-09 23:58:57,657 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1860: havoc main_~node1__m1~7#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~12#1; [2024-11-09 23:58:57,657 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1860: havoc main_~node1__m1~7#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~12#1; [2024-11-09 23:58:57,657 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1860: havoc main_~node1__m1~7#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~12#1; [2024-11-09 23:58:57,658 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L673: havoc main_~check__tmp~3#1;havoc main_~node4__m4~2#1; [2024-11-09 23:58:57,658 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L673: havoc main_~check__tmp~3#1;havoc main_~node4__m4~2#1; [2024-11-09 23:58:57,658 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L673: havoc main_~check__tmp~3#1;havoc main_~node4__m4~2#1; [2024-11-09 23:58:57,659 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L673: havoc main_~check__tmp~3#1;havoc main_~node4__m4~2#1; [2024-11-09 23:58:57,659 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4440: havoc main_~node2____CPAchecker_TMP_0~2#1; [2024-11-09 23:58:57,659 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2856: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~15#1; [2024-11-09 23:58:57,659 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3451: havoc main_~node3__m3~16#1;havoc main_~node2__m2~14#1; [2024-11-09 23:58:57,659 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3451: havoc main_~node3__m3~16#1;havoc main_~node2__m2~14#1; [2024-11-09 23:58:57,659 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2196: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~15#1; [2024-11-09 23:58:57,659 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2196: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~15#1; [2024-11-09 23:58:57,659 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2196: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~15#1; [2024-11-09 23:58:57,660 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1604: havoc main_~node1__m1~6#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~10#1; [2024-11-09 23:58:57,660 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1604: havoc main_~node1__m1~6#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~10#1; [2024-11-09 23:58:57,660 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1604: havoc main_~node1__m1~6#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~10#1; [2024-11-09 23:58:57,660 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1604: havoc main_~node1__m1~6#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~10#1; [2024-11-09 23:58:57,660 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4182: havoc main_~node4__m4~23#1;havoc main_~node3__m3~19#1; [2024-11-09 23:58:57,660 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4182: havoc main_~node4__m4~23#1;havoc main_~node3__m3~19#1; [2024-11-09 23:58:57,660 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L285: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:58:57,660 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L285: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:58:57,661 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L285: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:58:57,661 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L285: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:58:57,661 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3853: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~21#1; [2024-11-09 23:58:57,661 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1409: havoc main_~node3__m3~6#1;havoc main_~node2__m2~5#1; [2024-11-09 23:58:57,661 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1409: havoc main_~node3__m3~6#1;havoc main_~node2__m2~5#1; [2024-11-09 23:58:57,661 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1409: havoc main_~node3__m3~6#1;havoc main_~node2__m2~5#1; [2024-11-09 23:58:57,661 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1409: havoc main_~node3__m3~6#1;havoc main_~node2__m2~5#1; [2024-11-09 23:58:57,661 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3127: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2024-11-09 23:58:57,662 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3127: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2024-11-09 23:58:57,662 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3127: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2024-11-09 23:58:57,662 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3127: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2024-11-09 23:58:57,662 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4119: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~30#1; [2024-11-09 23:58:57,662 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4119: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~30#1; [2024-11-09 23:58:57,662 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4119: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~30#1; [2024-11-09 23:58:57,662 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4119: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~30#1; [2024-11-09 23:58:57,662 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4384: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~24#1;havoc main_~node3__m3~20#1;havoc main_~node2__m2~18#1;havoc main_~node1__m1~17#1; [2024-11-09 23:58:57,663 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4384: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~24#1;havoc main_~node3__m3~20#1;havoc main_~node2__m2~18#1;havoc main_~node1__m1~17#1; [2024-11-09 23:58:57,663 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3195: havoc main_~node4__m4~17#1;havoc main_~node3__m3~14#1; [2024-11-09 23:58:57,663 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3195: havoc main_~node4__m4~17#1;havoc main_~node3__m3~14#1; [2024-11-09 23:58:57,663 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3195: havoc main_~node4__m4~17#1;havoc main_~node3__m3~14#1; [2024-11-09 23:58:57,663 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3195: havoc main_~node4__m4~17#1;havoc main_~node3__m3~14#1; [2024-11-09 23:58:57,663 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2997: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1;havoc main_~node4__m4~16#1; [2024-11-09 23:58:57,663 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2997: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1;havoc main_~node4__m4~16#1; [2024-11-09 23:58:57,663 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3925: havoc main_~node2__m2~16#1;havoc main_~node1__m1~15#1; [2024-11-09 23:58:57,663 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3925: havoc main_~node2__m2~16#1;havoc main_~node1__m1~15#1; [2024-11-09 23:58:57,664 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3925: havoc main_~node2__m2~16#1;havoc main_~node1__m1~15#1; [2024-11-09 23:58:57,664 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3925: havoc main_~node2__m2~16#1;havoc main_~node1__m1~15#1; [2024-11-09 23:58:57,664 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3925: havoc main_~node2__m2~16#1;havoc main_~node1__m1~15#1; [2024-11-09 23:58:57,664 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1086: havoc main_~node1__m1~4#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~6#1; [2024-11-09 23:58:57,664 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1086: havoc main_~node1__m1~4#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~6#1; [2024-11-09 23:58:57,664 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1086: havoc main_~node1__m1~4#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~6#1; [2024-11-09 23:58:57,664 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1086: havoc main_~node1__m1~4#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~6#1; [2024-11-09 23:58:57,664 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L625: havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1; [2024-11-09 23:58:57,664 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L625: havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1; [2024-11-09 23:58:57,665 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L625: havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1; [2024-11-09 23:58:57,665 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L625: havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1; [2024-11-09 23:58:57,665 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2343: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1;havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~10#1;havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__m2~9#1; [2024-11-09 23:58:57,665 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1815: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~9#1; [2024-11-09 23:58:57,665 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L891: havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1; [2024-11-09 23:58:57,665 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L891: havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1; [2024-11-09 23:58:57,665 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L891: havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1; [2024-11-09 23:58:57,665 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L891: havoc main_~node3__m3~3#1;havoc main_~node2__m2~3#1; [2024-11-09 23:58:57,665 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2741: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1;havoc main_~node4__m4~14#1; [2024-11-09 23:58:57,666 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2741: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1;havoc main_~node4__m4~14#1; [2024-11-09 23:58:57,666 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2741: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1;havoc main_~node4__m4~14#1; [2024-11-09 23:58:57,666 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2741: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1;havoc main_~node4__m4~14#1; [2024-11-09 23:58:57,666 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3997: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~29#1; [2024-11-09 23:58:57,666 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3997: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~29#1; [2024-11-09 23:58:57,666 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3997: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~29#1; [2024-11-09 23:58:57,757 INFO L? ?]: Removed 475 outVars from TransFormulas that were not future-live. [2024-11-09 23:58:57,758 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:58:57,786 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:58:57,786 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:58:57,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:58:57 BoogieIcfgContainer [2024-11-09 23:58:57,786 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:58:57,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:58:57,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:58:57,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:58:57,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:58:54" (1/3) ... [2024-11-09 23:58:57,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7905207a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:58:57, skipping insertion in model container [2024-11-09 23:58:57,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:58:55" (2/3) ... [2024-11-09 23:58:57,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7905207a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:58:57, skipping insertion in model container [2024-11-09 23:58:57,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:58:57" (3/3) ... [2024-11-09 23:58:57,794 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-11-09 23:58:57,810 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:58:57,810 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-11-09 23:58:57,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:58:57,905 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;@44157877, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:58:57,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-09 23:58:57,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 584 states, 572 states have (on average 1.7622377622377623) internal successors, (1008), 583 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:57,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 23:58:57,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:57,936 INFO L215 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] [2024-11-09 23:58:57,936 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:58:57,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:57,943 INFO L85 PathProgramCache]: Analyzing trace with hash -923384710, now seen corresponding path program 1 times [2024-11-09 23:58:57,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:57,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193642539] [2024-11-09 23:58:57,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:57,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:58,482 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-09 23:58:58,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:58,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193642539] [2024-11-09 23:58:58,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193642539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:58:58,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:58:58,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:58:58,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921622371] [2024-11-09 23:58:58,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:58:58,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:58:58,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:58,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:58:58,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:58:58,523 INFO L87 Difference]: Start difference. First operand has 584 states, 572 states have (on average 1.7622377622377623) internal successors, (1008), 583 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:59,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:59,008 INFO L93 Difference]: Finished difference Result 731 states and 1231 transitions. [2024-11-09 23:58:59,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:58:59,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-11-09 23:58:59,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:59,026 INFO L225 Difference]: With dead ends: 731 [2024-11-09 23:58:59,026 INFO L226 Difference]: Without dead ends: 416 [2024-11-09 23:58:59,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:58:59,036 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 2033 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2033 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:59,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2033 Valid, 466 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:58:59,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-09 23:58:59,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2024-11-09 23:58:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 405 states have (on average 1.2765432098765432) internal successors, (517), 415 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 517 transitions. [2024-11-09 23:58:59,105 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 517 transitions. Word has length 59 [2024-11-09 23:58:59,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:59,106 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 517 transitions. [2024-11-09 23:58:59,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:59,106 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 517 transitions. [2024-11-09 23:58:59,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 23:58:59,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:59,113 INFO L215 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] [2024-11-09 23:58:59,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:58:59,113 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:58:59,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:59,114 INFO L85 PathProgramCache]: Analyzing trace with hash -729302168, now seen corresponding path program 1 times [2024-11-09 23:58:59,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:59,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843838051] [2024-11-09 23:58:59,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:59,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:59,294 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-09 23:58:59,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:59,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843838051] [2024-11-09 23:58:59,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843838051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:58:59,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:58:59,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:58:59,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011030612] [2024-11-09 23:58:59,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:58:59,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:58:59,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:59,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:58:59,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:58:59,299 INFO L87 Difference]: Start difference. First operand 416 states and 517 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:59,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:59,625 INFO L93 Difference]: Finished difference Result 596 states and 751 transitions. [2024-11-09 23:58:59,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:58:59,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-11-09 23:58:59,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:59,628 INFO L225 Difference]: With dead ends: 596 [2024-11-09 23:58:59,629 INFO L226 Difference]: Without dead ends: 384 [2024-11-09 23:58:59,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:58:59,633 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 1365 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1365 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:59,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1365 Valid, 275 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:58:59,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-09 23:58:59,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2024-11-09 23:58:59,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 373 states have (on average 1.2868632707774799) internal successors, (480), 383 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 480 transitions. [2024-11-09 23:58:59,661 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 480 transitions. Word has length 59 [2024-11-09 23:58:59,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:59,661 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 480 transitions. [2024-11-09 23:58:59,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:59,662 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 480 transitions. [2024-11-09 23:58:59,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 23:58:59,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:59,663 INFO L215 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] [2024-11-09 23:58:59,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:58:59,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:58:59,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:59,668 INFO L85 PathProgramCache]: Analyzing trace with hash -192471347, now seen corresponding path program 1 times [2024-11-09 23:58:59,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:59,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432471023] [2024-11-09 23:58:59,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:59,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:59,823 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-09 23:58:59,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:59,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432471023] [2024-11-09 23:58:59,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432471023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:58:59,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:58:59,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:58:59,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030874162] [2024-11-09 23:58:59,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:58:59,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:58:59,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:59,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:58:59,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:58:59,827 INFO L87 Difference]: Start difference. First operand 384 states and 480 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:00,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:00,163 INFO L93 Difference]: Finished difference Result 724 states and 922 transitions. [2024-11-09 23:59:00,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:59:00,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-11-09 23:59:00,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:00,166 INFO L225 Difference]: With dead ends: 724 [2024-11-09 23:59:00,166 INFO L226 Difference]: Without dead ends: 516 [2024-11-09 23:59:00,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:59:00,168 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 1696 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1696 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:00,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1696 Valid, 381 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:59:00,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-09 23:59:00,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 457. [2024-11-09 23:59:00,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 446 states have (on average 1.3408071748878925) internal successors, (598), 456 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:00,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 598 transitions. [2024-11-09 23:59:00,190 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 598 transitions. Word has length 59 [2024-11-09 23:59:00,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:00,190 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 598 transitions. [2024-11-09 23:59:00,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:00,191 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 598 transitions. [2024-11-09 23:59:00,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 23:59:00,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:00,192 INFO L215 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] [2024-11-09 23:59:00,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:59:00,193 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:00,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:00,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1288625165, now seen corresponding path program 1 times [2024-11-09 23:59:00,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:00,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131824754] [2024-11-09 23:59:00,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:00,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:00,351 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-09 23:59:00,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:00,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131824754] [2024-11-09 23:59:00,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131824754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:00,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:00,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:59:00,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076301459] [2024-11-09 23:59:00,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:00,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:59:00,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:00,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:59:00,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:59:00,354 INFO L87 Difference]: Start difference. First operand 457 states and 598 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:00,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:00,529 INFO L93 Difference]: Finished difference Result 621 states and 813 transitions. [2024-11-09 23:59:00,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:59:00,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-11-09 23:59:00,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:00,531 INFO L225 Difference]: With dead ends: 621 [2024-11-09 23:59:00,532 INFO L226 Difference]: Without dead ends: 364 [2024-11-09 23:59:00,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:59:00,533 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 925 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:00,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 214 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:59:00,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-09 23:59:00,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2024-11-09 23:59:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 353 states have (on average 1.3456090651558075) internal successors, (475), 363 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 475 transitions. [2024-11-09 23:59:00,543 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 475 transitions. Word has length 61 [2024-11-09 23:59:00,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:00,544 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 475 transitions. [2024-11-09 23:59:00,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:00,544 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 475 transitions. [2024-11-09 23:59:00,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 23:59:00,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:00,546 INFO L215 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] [2024-11-09 23:59:00,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:59:00,547 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:00,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:00,548 INFO L85 PathProgramCache]: Analyzing trace with hash 297703047, now seen corresponding path program 1 times [2024-11-09 23:59:00,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:00,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494968273] [2024-11-09 23:59:00,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:00,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:00,896 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-09 23:59:00,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:00,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494968273] [2024-11-09 23:59:00,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494968273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:00,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:00,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:59:00,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263868970] [2024-11-09 23:59:00,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:00,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:59:00,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:00,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:59:00,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:00,899 INFO L87 Difference]: Start difference. First operand 364 states and 475 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:01,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:01,447 INFO L93 Difference]: Finished difference Result 724 states and 966 transitions. [2024-11-09 23:59:01,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:59:01,448 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-11-09 23:59:01,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:01,450 INFO L225 Difference]: With dead ends: 724 [2024-11-09 23:59:01,450 INFO L226 Difference]: Without dead ends: 572 [2024-11-09 23:59:01,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2024-11-09 23:59:01,455 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 1562 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1562 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:01,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1562 Valid, 975 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:59:01,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-11-09 23:59:01,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 364. [2024-11-09 23:59:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 353 states have (on average 1.3427762039660056) internal successors, (474), 363 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:01,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 474 transitions. [2024-11-09 23:59:01,468 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 474 transitions. Word has length 63 [2024-11-09 23:59:01,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:01,469 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 474 transitions. [2024-11-09 23:59:01,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:01,469 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 474 transitions. [2024-11-09 23:59:01,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 23:59:01,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:01,470 INFO L215 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] [2024-11-09 23:59:01,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:59:01,471 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:01,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:01,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1379979929, now seen corresponding path program 1 times [2024-11-09 23:59:01,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:01,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056415154] [2024-11-09 23:59:01,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:01,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:01,741 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-09 23:59:01,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:01,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056415154] [2024-11-09 23:59:01,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056415154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:01,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:01,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:59:01,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373410707] [2024-11-09 23:59:01,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:01,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:59:01,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:01,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:59:01,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:01,745 INFO L87 Difference]: Start difference. First operand 364 states and 474 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:02,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:02,233 INFO L93 Difference]: Finished difference Result 579 states and 752 transitions. [2024-11-09 23:59:02,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 23:59:02,234 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-11-09 23:59:02,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:02,236 INFO L225 Difference]: With dead ends: 579 [2024-11-09 23:59:02,236 INFO L226 Difference]: Without dead ends: 573 [2024-11-09 23:59:02,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-09 23:59:02,237 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 1815 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1815 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:02,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1815 Valid, 825 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:59:02,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2024-11-09 23:59:02,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 364. [2024-11-09 23:59:02,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 353 states have (on average 1.339943342776204) internal successors, (473), 363 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:02,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 473 transitions. [2024-11-09 23:59:02,246 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 473 transitions. Word has length 63 [2024-11-09 23:59:02,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:02,246 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 473 transitions. [2024-11-09 23:59:02,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 8 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:02,247 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 473 transitions. [2024-11-09 23:59:02,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 23:59:02,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:02,248 INFO L215 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] [2024-11-09 23:59:02,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:59:02,248 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:02,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:02,251 INFO L85 PathProgramCache]: Analyzing trace with hash 22291784, now seen corresponding path program 1 times [2024-11-09 23:59:02,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:02,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797975387] [2024-11-09 23:59:02,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:02,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:02,565 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-09 23:59:02,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:02,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797975387] [2024-11-09 23:59:02,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797975387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:02,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:02,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:59:02,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267201978] [2024-11-09 23:59:02,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:02,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:59:02,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:02,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:59:02,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:59:02,569 INFO L87 Difference]: Start difference. First operand 364 states and 473 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:03,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:03,033 INFO L93 Difference]: Finished difference Result 747 states and 975 transitions. [2024-11-09 23:59:03,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:59:03,033 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2024-11-09 23:59:03,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:03,035 INFO L225 Difference]: With dead ends: 747 [2024-11-09 23:59:03,035 INFO L226 Difference]: Without dead ends: 546 [2024-11-09 23:59:03,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:59:03,037 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 1360 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:03,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 867 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:59:03,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-11-09 23:59:03,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 364. [2024-11-09 23:59:03,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 353 states have (on average 1.3371104815864023) internal successors, (472), 363 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:03,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 472 transitions. [2024-11-09 23:59:03,045 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 472 transitions. Word has length 63 [2024-11-09 23:59:03,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:03,045 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 472 transitions. [2024-11-09 23:59:03,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:03,046 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 472 transitions. [2024-11-09 23:59:03,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 23:59:03,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:03,046 INFO L215 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] [2024-11-09 23:59:03,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:59:03,047 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:03,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:03,047 INFO L85 PathProgramCache]: Analyzing trace with hash 775769127, now seen corresponding path program 1 times [2024-11-09 23:59:03,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:03,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350349013] [2024-11-09 23:59:03,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:03,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:03,292 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-09 23:59:03,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:03,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350349013] [2024-11-09 23:59:03,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350349013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:03,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:03,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:59:03,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637849278] [2024-11-09 23:59:03,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:03,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:59:03,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:03,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:59:03,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:03,294 INFO L87 Difference]: Start difference. First operand 364 states and 472 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:03,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:03,769 INFO L93 Difference]: Finished difference Result 722 states and 964 transitions. [2024-11-09 23:59:03,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:59:03,770 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-09 23:59:03,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:03,772 INFO L225 Difference]: With dead ends: 722 [2024-11-09 23:59:03,772 INFO L226 Difference]: Without dead ends: 594 [2024-11-09 23:59:03,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-09 23:59:03,776 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 1138 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:03,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 1102 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:59:03,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2024-11-09 23:59:03,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 364. [2024-11-09 23:59:03,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 353 states have (on average 1.3342776203966005) internal successors, (471), 363 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:03,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 471 transitions. [2024-11-09 23:59:03,789 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 471 transitions. Word has length 64 [2024-11-09 23:59:03,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:03,789 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 471 transitions. [2024-11-09 23:59:03,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:03,790 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 471 transitions. [2024-11-09 23:59:03,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 23:59:03,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:03,791 INFO L215 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] [2024-11-09 23:59:03,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:59:03,792 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:03,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:03,792 INFO L85 PathProgramCache]: Analyzing trace with hash 565596678, now seen corresponding path program 1 times [2024-11-09 23:59:03,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:03,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779738513] [2024-11-09 23:59:03,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:03,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:04,030 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-09 23:59:04,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:04,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779738513] [2024-11-09 23:59:04,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779738513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:04,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:04,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:59:04,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552030839] [2024-11-09 23:59:04,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:04,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:59:04,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:04,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:59:04,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:04,032 INFO L87 Difference]: Start difference. First operand 364 states and 471 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:04,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:04,430 INFO L93 Difference]: Finished difference Result 690 states and 914 transitions. [2024-11-09 23:59:04,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:59:04,430 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-09 23:59:04,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:04,433 INFO L225 Difference]: With dead ends: 690 [2024-11-09 23:59:04,433 INFO L226 Difference]: Without dead ends: 573 [2024-11-09 23:59:04,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-09 23:59:04,434 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 1316 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1316 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:04,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1316 Valid, 867 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:59:04,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2024-11-09 23:59:04,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 364. [2024-11-09 23:59:04,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 353 states have (on average 1.3314447592067988) internal successors, (470), 363 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:04,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 470 transitions. [2024-11-09 23:59:04,443 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 470 transitions. Word has length 64 [2024-11-09 23:59:04,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:04,443 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 470 transitions. [2024-11-09 23:59:04,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 470 transitions. [2024-11-09 23:59:04,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 23:59:04,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:04,444 INFO L215 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] [2024-11-09 23:59:04,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:59:04,445 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:04,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:04,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1037247705, now seen corresponding path program 1 times [2024-11-09 23:59:04,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:04,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255003963] [2024-11-09 23:59:04,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:04,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:04,708 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-09 23:59:04,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:04,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255003963] [2024-11-09 23:59:04,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255003963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:04,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:04,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:59:04,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800807208] [2024-11-09 23:59:04,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:04,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:59:04,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:04,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:59:04,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:04,710 INFO L87 Difference]: Start difference. First operand 364 states and 470 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:05,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:05,120 INFO L93 Difference]: Finished difference Result 611 states and 814 transitions. [2024-11-09 23:59:05,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:59:05,120 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-09 23:59:05,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:05,122 INFO L225 Difference]: With dead ends: 611 [2024-11-09 23:59:05,122 INFO L226 Difference]: Without dead ends: 426 [2024-11-09 23:59:05,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2024-11-09 23:59:05,123 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 641 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:05,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 877 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:59:05,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-09 23:59:05,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 364. [2024-11-09 23:59:05,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 353 states have (on average 1.3257790368271956) internal successors, (468), 363 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 468 transitions. [2024-11-09 23:59:05,132 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 468 transitions. Word has length 65 [2024-11-09 23:59:05,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:05,132 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 468 transitions. [2024-11-09 23:59:05,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:05,132 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 468 transitions. [2024-11-09 23:59:05,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 23:59:05,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:05,135 INFO L215 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] [2024-11-09 23:59:05,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 23:59:05,135 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:05,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:05,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1125296887, now seen corresponding path program 1 times [2024-11-09 23:59:05,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:05,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779760754] [2024-11-09 23:59:05,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:05,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:05,423 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-09 23:59:05,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:05,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779760754] [2024-11-09 23:59:05,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779760754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:05,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:05,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:59:05,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673700994] [2024-11-09 23:59:05,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:05,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:59:05,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:05,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:59:05,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:05,426 INFO L87 Difference]: Start difference. First operand 364 states and 468 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:05,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:05,986 INFO L93 Difference]: Finished difference Result 613 states and 797 transitions. [2024-11-09 23:59:05,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:59:05,986 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-09 23:59:05,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:05,988 INFO L225 Difference]: With dead ends: 613 [2024-11-09 23:59:05,989 INFO L226 Difference]: Without dead ends: 594 [2024-11-09 23:59:05,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-09 23:59:05,990 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 1319 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:05,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1319 Valid, 1498 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:59:05,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2024-11-09 23:59:05,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 364. [2024-11-09 23:59:05,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 353 states have (on average 1.320113314447592) internal successors, (466), 363 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:05,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 466 transitions. [2024-11-09 23:59:05,999 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 466 transitions. Word has length 65 [2024-11-09 23:59:05,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:05,999 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 466 transitions. [2024-11-09 23:59:05,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:06,000 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 466 transitions. [2024-11-09 23:59:06,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 23:59:06,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:06,000 INFO L215 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] [2024-11-09 23:59:06,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:59:06,001 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:06,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:06,001 INFO L85 PathProgramCache]: Analyzing trace with hash -17396936, now seen corresponding path program 1 times [2024-11-09 23:59:06,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:06,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205227397] [2024-11-09 23:59:06,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:06,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:06,224 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-09 23:59:06,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:06,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205227397] [2024-11-09 23:59:06,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205227397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:06,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:06,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:59:06,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7229770] [2024-11-09 23:59:06,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:06,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:59:06,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:06,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:59:06,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:06,227 INFO L87 Difference]: Start difference. First operand 364 states and 466 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:06,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:06,642 INFO L93 Difference]: Finished difference Result 579 states and 743 transitions. [2024-11-09 23:59:06,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:59:06,642 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-09 23:59:06,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:06,644 INFO L225 Difference]: With dead ends: 579 [2024-11-09 23:59:06,644 INFO L226 Difference]: Without dead ends: 573 [2024-11-09 23:59:06,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-09 23:59:06,645 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 1240 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:06,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1240 Valid, 922 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:59:06,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2024-11-09 23:59:06,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 364. [2024-11-09 23:59:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 353 states have (on average 1.3144475920679888) internal successors, (464), 363 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:06,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 464 transitions. [2024-11-09 23:59:06,653 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 464 transitions. Word has length 65 [2024-11-09 23:59:06,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:06,653 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 464 transitions. [2024-11-09 23:59:06,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:06,653 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 464 transitions. [2024-11-09 23:59:06,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 23:59:06,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:06,654 INFO L215 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] [2024-11-09 23:59:06,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 23:59:06,654 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:06,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:06,655 INFO L85 PathProgramCache]: Analyzing trace with hash 299381227, now seen corresponding path program 1 times [2024-11-09 23:59:06,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:06,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007031937] [2024-11-09 23:59:06,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:06,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:07,111 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-09 23:59:07,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:07,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007031937] [2024-11-09 23:59:07,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007031937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:07,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:07,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 23:59:07,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814757100] [2024-11-09 23:59:07,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:07,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 23:59:07,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:07,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 23:59:07,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:59:07,114 INFO L87 Difference]: Start difference. First operand 364 states and 464 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:08,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:08,185 INFO L93 Difference]: Finished difference Result 1103 states and 1510 transitions. [2024-11-09 23:59:08,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 23:59:08,185 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-09 23:59:08,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:08,188 INFO L225 Difference]: With dead ends: 1103 [2024-11-09 23:59:08,188 INFO L226 Difference]: Without dead ends: 970 [2024-11-09 23:59:08,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-09 23:59:08,189 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 2066 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2066 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:08,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2066 Valid, 1634 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 23:59:08,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2024-11-09 23:59:08,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 369. [2024-11-09 23:59:08,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 358 states have (on average 1.3100558659217878) internal successors, (469), 368 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:08,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 469 transitions. [2024-11-09 23:59:08,199 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 469 transitions. Word has length 65 [2024-11-09 23:59:08,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:08,199 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 469 transitions. [2024-11-09 23:59:08,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:08,199 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 469 transitions. [2024-11-09 23:59:08,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 23:59:08,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:08,200 INFO L215 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] [2024-11-09 23:59:08,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 23:59:08,201 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:08,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:08,201 INFO L85 PathProgramCache]: Analyzing trace with hash 181484269, now seen corresponding path program 1 times [2024-11-09 23:59:08,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:08,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823326994] [2024-11-09 23:59:08,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:08,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:08,418 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-09 23:59:08,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:08,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823326994] [2024-11-09 23:59:08,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823326994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:08,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:08,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:59:08,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93360726] [2024-11-09 23:59:08,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:08,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:59:08,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:08,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:59:08,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:08,421 INFO L87 Difference]: Start difference. First operand 369 states and 469 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:08,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:08,898 INFO L93 Difference]: Finished difference Result 698 states and 915 transitions. [2024-11-09 23:59:08,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:59:08,899 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-09 23:59:08,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:08,901 INFO L225 Difference]: With dead ends: 698 [2024-11-09 23:59:08,901 INFO L226 Difference]: Without dead ends: 578 [2024-11-09 23:59:08,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-09 23:59:08,902 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 1707 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1707 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:08,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1707 Valid, 922 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:59:08,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2024-11-09 23:59:08,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 369. [2024-11-09 23:59:08,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 358 states have (on average 1.3072625698324023) internal successors, (468), 368 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 468 transitions. [2024-11-09 23:59:08,909 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 468 transitions. Word has length 65 [2024-11-09 23:59:08,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:08,909 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 468 transitions. [2024-11-09 23:59:08,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:08,909 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 468 transitions. [2024-11-09 23:59:08,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 23:59:08,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:08,910 INFO L215 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] [2024-11-09 23:59:08,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 23:59:08,910 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:08,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:08,911 INFO L85 PathProgramCache]: Analyzing trace with hash 69334422, now seen corresponding path program 1 times [2024-11-09 23:59:08,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:08,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82399083] [2024-11-09 23:59:08,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:08,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:09,448 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-09 23:59:09,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:09,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82399083] [2024-11-09 23:59:09,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82399083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:09,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:09,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 23:59:09,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215640345] [2024-11-09 23:59:09,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:09,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 23:59:09,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:09,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 23:59:09,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:59:09,450 INFO L87 Difference]: Start difference. First operand 369 states and 468 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:10,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:10,286 INFO L93 Difference]: Finished difference Result 1025 states and 1341 transitions. [2024-11-09 23:59:10,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:59:10,287 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-09 23:59:10,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:10,289 INFO L225 Difference]: With dead ends: 1025 [2024-11-09 23:59:10,289 INFO L226 Difference]: Without dead ends: 909 [2024-11-09 23:59:10,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:59:10,290 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 2256 mSDsluCounter, 2039 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2256 SdHoareTripleChecker+Valid, 2347 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:10,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2256 Valid, 2347 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 23:59:10,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2024-11-09 23:59:10,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 359. [2024-11-09 23:59:10,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 348 states have (on average 1.3017241379310345) internal successors, (453), 358 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:10,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 453 transitions. [2024-11-09 23:59:10,299 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 453 transitions. Word has length 66 [2024-11-09 23:59:10,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:10,300 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 453 transitions. [2024-11-09 23:59:10,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:10,300 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 453 transitions. [2024-11-09 23:59:10,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 23:59:10,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:10,301 INFO L215 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] [2024-11-09 23:59:10,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 23:59:10,301 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:10,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:10,302 INFO L85 PathProgramCache]: Analyzing trace with hash 934559339, now seen corresponding path program 1 times [2024-11-09 23:59:10,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:10,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203294463] [2024-11-09 23:59:10,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:10,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:11,314 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-09 23:59:11,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:11,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203294463] [2024-11-09 23:59:11,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203294463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:11,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:11,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 23:59:11,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613825922] [2024-11-09 23:59:11,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:11,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 23:59:11,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:11,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 23:59:11,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:59:11,316 INFO L87 Difference]: Start difference. First operand 359 states and 453 transitions. Second operand has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:12,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:12,957 INFO L93 Difference]: Finished difference Result 771 states and 1027 transitions. [2024-11-09 23:59:12,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 23:59:12,958 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-09 23:59:12,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:12,959 INFO L225 Difference]: With dead ends: 771 [2024-11-09 23:59:12,959 INFO L226 Difference]: Without dead ends: 630 [2024-11-09 23:59:12,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=270, Invalid=786, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 23:59:12,961 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 2298 mSDsluCounter, 2387 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2298 SdHoareTripleChecker+Valid, 2656 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:12,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2298 Valid, 2656 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 23:59:12,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2024-11-09 23:59:12,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 332. [2024-11-09 23:59:12,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 322 states have (on average 1.3043478260869565) internal successors, (420), 331 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:12,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 420 transitions. [2024-11-09 23:59:12,973 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 420 transitions. Word has length 66 [2024-11-09 23:59:12,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:12,974 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 420 transitions. [2024-11-09 23:59:12,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:12,974 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 420 transitions. [2024-11-09 23:59:12,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 23:59:12,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:12,975 INFO L215 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] [2024-11-09 23:59:12,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 23:59:12,975 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:12,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:12,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1230481478, now seen corresponding path program 1 times [2024-11-09 23:59:12,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:12,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342777807] [2024-11-09 23:59:12,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:12,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:13,224 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-09 23:59:13,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:13,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342777807] [2024-11-09 23:59:13,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342777807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:13,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:13,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:59:13,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331953705] [2024-11-09 23:59:13,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:13,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:59:13,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:13,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:59:13,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:13,227 INFO L87 Difference]: Start difference. First operand 332 states and 420 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:13,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:13,710 INFO L93 Difference]: Finished difference Result 690 states and 911 transitions. [2024-11-09 23:59:13,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 23:59:13,711 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-09 23:59:13,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:13,712 INFO L225 Difference]: With dead ends: 690 [2024-11-09 23:59:13,713 INFO L226 Difference]: Without dead ends: 557 [2024-11-09 23:59:13,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-09 23:59:13,714 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 775 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:13,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 1220 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:59:13,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-09 23:59:13,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 327. [2024-11-09 23:59:13,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 317 states have (on average 1.3059936908517351) internal successors, (414), 326 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 414 transitions. [2024-11-09 23:59:13,720 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 414 transitions. Word has length 66 [2024-11-09 23:59:13,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:13,721 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 414 transitions. [2024-11-09 23:59:13,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 8 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:13,721 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 414 transitions. [2024-11-09 23:59:13,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 23:59:13,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:13,722 INFO L215 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] [2024-11-09 23:59:13,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 23:59:13,722 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:13,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:13,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1939893731, now seen corresponding path program 1 times [2024-11-09 23:59:13,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:13,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502788614] [2024-11-09 23:59:13,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:13,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:14,255 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-09 23:59:14,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:14,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502788614] [2024-11-09 23:59:14,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502788614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:14,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:14,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 23:59:14,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522581574] [2024-11-09 23:59:14,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:14,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 23:59:14,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:14,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 23:59:14,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:59:14,258 INFO L87 Difference]: Start difference. First operand 327 states and 414 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:14,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:14,991 INFO L93 Difference]: Finished difference Result 950 states and 1255 transitions. [2024-11-09 23:59:14,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:59:14,991 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-09 23:59:14,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:14,994 INFO L225 Difference]: With dead ends: 950 [2024-11-09 23:59:14,994 INFO L226 Difference]: Without dead ends: 835 [2024-11-09 23:59:14,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:59:14,995 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 1999 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1999 SdHoareTripleChecker+Valid, 2125 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:14,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1999 Valid, 2125 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:59:14,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2024-11-09 23:59:15,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 326. [2024-11-09 23:59:15,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 316 states have (on average 1.3037974683544304) internal successors, (412), 325 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:15,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 412 transitions. [2024-11-09 23:59:15,004 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 412 transitions. Word has length 66 [2024-11-09 23:59:15,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:15,004 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 412 transitions. [2024-11-09 23:59:15,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:15,005 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 412 transitions. [2024-11-09 23:59:15,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 23:59:15,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:15,005 INFO L215 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] [2024-11-09 23:59:15,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 23:59:15,006 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:15,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:15,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1026447535, now seen corresponding path program 1 times [2024-11-09 23:59:15,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:15,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227030999] [2024-11-09 23:59:15,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:15,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:16,178 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-09 23:59:16,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:16,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227030999] [2024-11-09 23:59:16,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227030999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:16,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:16,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-11-09 23:59:16,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793489272] [2024-11-09 23:59:16,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:16,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 23:59:16,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:16,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 23:59:16,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:59:16,180 INFO L87 Difference]: Start difference. First operand 326 states and 412 transitions. Second operand has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:18,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:18,310 INFO L93 Difference]: Finished difference Result 651 states and 849 transitions. [2024-11-09 23:59:18,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 23:59:18,310 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-09 23:59:18,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:18,312 INFO L225 Difference]: With dead ends: 651 [2024-11-09 23:59:18,312 INFO L226 Difference]: Without dead ends: 644 [2024-11-09 23:59:18,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=302, Invalid=1420, Unknown=0, NotChecked=0, Total=1722 [2024-11-09 23:59:18,314 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 1589 mSDsluCounter, 6167 mSDsCounter, 0 mSdLazyCounter, 3016 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 6710 SdHoareTripleChecker+Invalid, 3031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:18,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 6710 Invalid, 3031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3016 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 23:59:18,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-11-09 23:59:18,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 333. [2024-11-09 23:59:18,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 323 states have (on average 1.303405572755418) internal successors, (421), 332 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:18,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 421 transitions. [2024-11-09 23:59:18,321 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 421 transitions. Word has length 67 [2024-11-09 23:59:18,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:18,321 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 421 transitions. [2024-11-09 23:59:18,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:18,322 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 421 transitions. [2024-11-09 23:59:18,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 23:59:18,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:18,323 INFO L215 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] [2024-11-09 23:59:18,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 23:59:18,323 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:18,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:18,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1439377435, now seen corresponding path program 1 times [2024-11-09 23:59:18,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:18,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903978093] [2024-11-09 23:59:18,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:18,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:18,842 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-09 23:59:18,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:18,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903978093] [2024-11-09 23:59:18,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903978093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:18,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:18,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 23:59:18,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161914704] [2024-11-09 23:59:18,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:18,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 23:59:18,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:18,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 23:59:18,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:59:18,845 INFO L87 Difference]: Start difference. First operand 333 states and 421 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:19,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:19,618 INFO L93 Difference]: Finished difference Result 838 states and 1091 transitions. [2024-11-09 23:59:19,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 23:59:19,618 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-09 23:59:19,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:19,621 INFO L225 Difference]: With dead ends: 838 [2024-11-09 23:59:19,621 INFO L226 Difference]: Without dead ends: 834 [2024-11-09 23:59:19,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-11-09 23:59:19,622 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 1988 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1988 SdHoareTripleChecker+Valid, 2028 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:19,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1988 Valid, 2028 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:59:19,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2024-11-09 23:59:19,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 329. [2024-11-09 23:59:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 320 states have (on average 1.303125) internal successors, (417), 328 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 417 transitions. [2024-11-09 23:59:19,632 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 417 transitions. Word has length 67 [2024-11-09 23:59:19,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:19,632 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 417 transitions. [2024-11-09 23:59:19,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:19,633 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 417 transitions. [2024-11-09 23:59:19,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 23:59:19,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:19,633 INFO L215 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] [2024-11-09 23:59:19,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 23:59:19,634 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:19,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:19,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1229000238, now seen corresponding path program 1 times [2024-11-09 23:59:19,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:19,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727841272] [2024-11-09 23:59:19,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:19,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:20,407 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-09 23:59:20,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:20,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727841272] [2024-11-09 23:59:20,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727841272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:20,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:20,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 23:59:20,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409322602] [2024-11-09 23:59:20,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:20,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 23:59:20,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:20,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 23:59:20,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-11-09 23:59:20,411 INFO L87 Difference]: Start difference. First operand 329 states and 417 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:21,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:21,603 INFO L93 Difference]: Finished difference Result 810 states and 1063 transitions. [2024-11-09 23:59:21,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 23:59:21,604 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-09 23:59:21,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:21,605 INFO L225 Difference]: With dead ends: 810 [2024-11-09 23:59:21,606 INFO L226 Difference]: Without dead ends: 692 [2024-11-09 23:59:21,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=204, Invalid=608, Unknown=0, NotChecked=0, Total=812 [2024-11-09 23:59:21,607 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 1844 mSDsluCounter, 2544 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1844 SdHoareTripleChecker+Valid, 2856 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:21,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1844 Valid, 2856 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 23:59:21,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2024-11-09 23:59:21,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 327. [2024-11-09 23:59:21,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 318 states have (on average 1.29874213836478) internal successors, (413), 326 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:21,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 413 transitions. [2024-11-09 23:59:21,614 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 413 transitions. Word has length 67 [2024-11-09 23:59:21,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:21,614 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 413 transitions. [2024-11-09 23:59:21,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:21,615 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 413 transitions. [2024-11-09 23:59:21,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 23:59:21,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:21,616 INFO L215 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] [2024-11-09 23:59:21,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 23:59:21,616 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:21,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:21,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1583156102, now seen corresponding path program 1 times [2024-11-09 23:59:21,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:21,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122555212] [2024-11-09 23:59:21,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:21,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:22,045 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-09 23:59:22,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:22,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122555212] [2024-11-09 23:59:22,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122555212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:22,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:22,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 23:59:22,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631811658] [2024-11-09 23:59:22,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:22,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 23:59:22,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:22,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 23:59:22,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:59:22,047 INFO L87 Difference]: Start difference. First operand 327 states and 413 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:22,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:22,468 INFO L93 Difference]: Finished difference Result 596 states and 787 transitions. [2024-11-09 23:59:22,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 23:59:22,470 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-09 23:59:22,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:22,472 INFO L225 Difference]: With dead ends: 596 [2024-11-09 23:59:22,472 INFO L226 Difference]: Without dead ends: 440 [2024-11-09 23:59:22,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-09 23:59:22,473 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 1046 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:22,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 986 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:59:22,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-09 23:59:22,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 285. [2024-11-09 23:59:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 279 states have (on average 1.3046594982078854) internal successors, (364), 284 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:22,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 364 transitions. [2024-11-09 23:59:22,479 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 364 transitions. Word has length 67 [2024-11-09 23:59:22,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:22,479 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 364 transitions. [2024-11-09 23:59:22,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:22,479 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 364 transitions. [2024-11-09 23:59:22,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 23:59:22,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:22,480 INFO L215 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] [2024-11-09 23:59:22,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 23:59:22,480 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:22,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:22,481 INFO L85 PathProgramCache]: Analyzing trace with hash -13117108, now seen corresponding path program 1 times [2024-11-09 23:59:22,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:22,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024251713] [2024-11-09 23:59:22,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:22,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:23,012 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-09 23:59:23,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:23,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024251713] [2024-11-09 23:59:23,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024251713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:23,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:23,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 23:59:23,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909996191] [2024-11-09 23:59:23,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:23,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 23:59:23,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:23,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 23:59:23,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:59:23,015 INFO L87 Difference]: Start difference. First operand 285 states and 364 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:23,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:23,447 INFO L93 Difference]: Finished difference Result 309 states and 388 transitions. [2024-11-09 23:59:23,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 23:59:23,448 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-09 23:59:23,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:23,448 INFO L225 Difference]: With dead ends: 309 [2024-11-09 23:59:23,448 INFO L226 Difference]: Without dead ends: 278 [2024-11-09 23:59:23,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:59:23,449 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 528 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:23,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 1467 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:59:23,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-09 23:59:23,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2024-11-09 23:59:23,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 272 states have (on average 1.3014705882352942) internal successors, (354), 277 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 354 transitions. [2024-11-09 23:59:23,454 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 354 transitions. Word has length 68 [2024-11-09 23:59:23,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:23,454 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 354 transitions. [2024-11-09 23:59:23,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:23,455 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 354 transitions. [2024-11-09 23:59:23,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 23:59:23,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:23,455 INFO L215 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] [2024-11-09 23:59:23,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 23:59:23,456 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:23,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:23,456 INFO L85 PathProgramCache]: Analyzing trace with hash 755588846, now seen corresponding path program 1 times [2024-11-09 23:59:23,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:23,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398218853] [2024-11-09 23:59:23,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:23,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:23,843 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-09 23:59:23,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:23,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398218853] [2024-11-09 23:59:23,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398218853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:23,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:23,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 23:59:23,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455148959] [2024-11-09 23:59:23,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:23,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 23:59:23,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:23,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 23:59:23,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:59:23,845 INFO L87 Difference]: Start difference. First operand 278 states and 354 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:24,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:24,148 INFO L93 Difference]: Finished difference Result 278 states and 354 transitions. [2024-11-09 23:59:24,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:59:24,149 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-09 23:59:24,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:24,150 INFO L225 Difference]: With dead ends: 278 [2024-11-09 23:59:24,150 INFO L226 Difference]: Without dead ends: 247 [2024-11-09 23:59:24,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2024-11-09 23:59:24,151 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 444 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:24,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1174 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:59:24,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-09 23:59:24,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-11-09 23:59:24,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 243 states have (on average 1.3127572016460904) internal successors, (319), 246 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 319 transitions. [2024-11-09 23:59:24,155 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 319 transitions. Word has length 68 [2024-11-09 23:59:24,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:24,155 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 319 transitions. [2024-11-09 23:59:24,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:24,156 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 319 transitions. [2024-11-09 23:59:24,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-09 23:59:24,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:24,156 INFO L215 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] [2024-11-09 23:59:24,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 23:59:24,157 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:24,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:24,158 INFO L85 PathProgramCache]: Analyzing trace with hash 958141549, now seen corresponding path program 1 times [2024-11-09 23:59:24,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:24,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856583004] [2024-11-09 23:59:24,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:24,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:24,635 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-09 23:59:24,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:24,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856583004] [2024-11-09 23:59:24,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856583004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:24,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:24,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 23:59:24,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480321384] [2024-11-09 23:59:24,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:24,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 23:59:24,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:24,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 23:59:24,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:59:24,637 INFO L87 Difference]: Start difference. First operand 247 states and 319 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:25,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:25,091 INFO L93 Difference]: Finished difference Result 780 states and 1072 transitions. [2024-11-09 23:59:25,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:59:25,092 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-09 23:59:25,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:25,093 INFO L225 Difference]: With dead ends: 780 [2024-11-09 23:59:25,093 INFO L226 Difference]: Without dead ends: 662 [2024-11-09 23:59:25,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:59:25,094 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1166 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:25,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 1148 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:59:25,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-09 23:59:25,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 239. [2024-11-09 23:59:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 236 states have (on average 1.305084745762712) internal successors, (308), 238 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:25,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 308 transitions. [2024-11-09 23:59:25,100 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 308 transitions. Word has length 68 [2024-11-09 23:59:25,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:25,101 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 308 transitions. [2024-11-09 23:59:25,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:25,101 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 308 transitions. [2024-11-09 23:59:25,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 23:59:25,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:25,102 INFO L215 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] [2024-11-09 23:59:25,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 23:59:25,102 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:25,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:25,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1915094128, now seen corresponding path program 1 times [2024-11-09 23:59:25,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:25,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105353569] [2024-11-09 23:59:25,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:25,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:25,431 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-09 23:59:25,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:25,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105353569] [2024-11-09 23:59:25,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105353569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:25,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:25,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 23:59:25,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222384612] [2024-11-09 23:59:25,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:25,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 23:59:25,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:25,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 23:59:25,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:59:25,433 INFO L87 Difference]: Start difference. First operand 239 states and 308 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:26,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:26,022 INFO L93 Difference]: Finished difference Result 944 states and 1310 transitions. [2024-11-09 23:59:26,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 23:59:26,022 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-11-09 23:59:26,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:26,025 INFO L225 Difference]: With dead ends: 944 [2024-11-09 23:59:26,025 INFO L226 Difference]: Without dead ends: 796 [2024-11-09 23:59:26,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2024-11-09 23:59:26,026 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 1650 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1650 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:26,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1650 Valid, 1030 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:59:26,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2024-11-09 23:59:26,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 249. [2024-11-09 23:59:26,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 246 states have (on average 1.2926829268292683) internal successors, (318), 248 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:26,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 318 transitions. [2024-11-09 23:59:26,032 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 318 transitions. Word has length 69 [2024-11-09 23:59:26,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:26,032 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 318 transitions. [2024-11-09 23:59:26,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 318 transitions. [2024-11-09 23:59:26,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 23:59:26,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:26,033 INFO L215 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] [2024-11-09 23:59:26,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 23:59:26,033 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:26,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:26,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1770767249, now seen corresponding path program 1 times [2024-11-09 23:59:26,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:26,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616671146] [2024-11-09 23:59:26,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:26,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:26,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-09 23:59:26,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:26,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616671146] [2024-11-09 23:59:26,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616671146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:26,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:26,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:59:26,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237014974] [2024-11-09 23:59:26,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:26,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:59:26,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:26,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:59:26,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:26,279 INFO L87 Difference]: Start difference. First operand 249 states and 318 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:26,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:26,585 INFO L93 Difference]: Finished difference Result 411 states and 538 transitions. [2024-11-09 23:59:26,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:59:26,585 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2024-11-09 23:59:26,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:26,587 INFO L225 Difference]: With dead ends: 411 [2024-11-09 23:59:26,587 INFO L226 Difference]: Without dead ends: 403 [2024-11-09 23:59:26,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-11-09 23:59:26,587 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 1076 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:26,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 484 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:59:26,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-09 23:59:26,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 249. [2024-11-09 23:59:26,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 246 states have (on average 1.2886178861788617) internal successors, (317), 248 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:26,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 317 transitions. [2024-11-09 23:59:26,592 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 317 transitions. Word has length 69 [2024-11-09 23:59:26,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:26,592 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 317 transitions. [2024-11-09 23:59:26,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:26,593 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 317 transitions. [2024-11-09 23:59:26,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 23:59:26,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:26,593 INFO L215 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] [2024-11-09 23:59:26,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 23:59:26,594 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:26,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:26,594 INFO L85 PathProgramCache]: Analyzing trace with hash 722138891, now seen corresponding path program 1 times [2024-11-09 23:59:26,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:26,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950529483] [2024-11-09 23:59:26,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:26,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:26,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:26,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:26,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950529483] [2024-11-09 23:59:26,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950529483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:26,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:26,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:59:26,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398248376] [2024-11-09 23:59:26,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:26,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:59:26,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:26,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:59:26,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:26,812 INFO L87 Difference]: Start difference. First operand 249 states and 317 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:27,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:27,208 INFO L93 Difference]: Finished difference Result 568 states and 758 transitions. [2024-11-09 23:59:27,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 23:59:27,208 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-09 23:59:27,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:27,209 INFO L225 Difference]: With dead ends: 568 [2024-11-09 23:59:27,210 INFO L226 Difference]: Without dead ends: 420 [2024-11-09 23:59:27,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2024-11-09 23:59:27,211 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 572 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:27,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 805 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:59:27,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-09 23:59:27,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 239. [2024-11-09 23:59:27,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 236 states have (on average 1.2923728813559323) internal successors, (305), 238 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:27,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 305 transitions. [2024-11-09 23:59:27,216 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 305 transitions. Word has length 70 [2024-11-09 23:59:27,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:27,216 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 305 transitions. [2024-11-09 23:59:27,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:27,217 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 305 transitions. [2024-11-09 23:59:27,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 23:59:27,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:27,217 INFO L215 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] [2024-11-09 23:59:27,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 23:59:27,218 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:27,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:27,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1341732820, now seen corresponding path program 1 times [2024-11-09 23:59:27,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:27,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034793673] [2024-11-09 23:59:27,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:27,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:28,106 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-09 23:59:28,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:28,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034793673] [2024-11-09 23:59:28,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034793673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:28,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:28,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2024-11-09 23:59:28,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833661893] [2024-11-09 23:59:28,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:28,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 23:59:28,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:28,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 23:59:28,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:59:28,108 INFO L87 Difference]: Start difference. First operand 239 states and 305 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:29,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:29,075 INFO L93 Difference]: Finished difference Result 399 states and 522 transitions. [2024-11-09 23:59:29,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 23:59:29,076 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-11-09 23:59:29,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:29,077 INFO L225 Difference]: With dead ends: 399 [2024-11-09 23:59:29,077 INFO L226 Difference]: Without dead ends: 393 [2024-11-09 23:59:29,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=275, Invalid=1365, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 23:59:29,078 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 438 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 2097 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:29,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 2097 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:59:29,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-09 23:59:29,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 252. [2024-11-09 23:59:29,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 249 states have (on average 1.2891566265060241) internal successors, (321), 251 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:29,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 321 transitions. [2024-11-09 23:59:29,083 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 321 transitions. Word has length 71 [2024-11-09 23:59:29,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:29,083 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 321 transitions. [2024-11-09 23:59:29,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:29,083 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 321 transitions. [2024-11-09 23:59:29,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 23:59:29,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:29,084 INFO L215 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] [2024-11-09 23:59:29,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 23:59:29,085 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:29,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:29,085 INFO L85 PathProgramCache]: Analyzing trace with hash -746435426, now seen corresponding path program 1 times [2024-11-09 23:59:29,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:29,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059582775] [2024-11-09 23:59:29,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:29,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:29,794 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-09 23:59:29,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:29,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059582775] [2024-11-09 23:59:29,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059582775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:29,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:29,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-09 23:59:29,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244476842] [2024-11-09 23:59:29,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:29,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 23:59:29,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:29,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 23:59:29,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2024-11-09 23:59:29,796 INFO L87 Difference]: Start difference. First operand 252 states and 321 transitions. Second operand has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 21 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:30,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:30,700 INFO L93 Difference]: Finished difference Result 266 states and 336 transitions. [2024-11-09 23:59:30,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 23:59:30,700 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 21 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-11-09 23:59:30,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:30,701 INFO L225 Difference]: With dead ends: 266 [2024-11-09 23:59:30,701 INFO L226 Difference]: Without dead ends: 257 [2024-11-09 23:59:30,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=232, Invalid=1174, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 23:59:30,702 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 301 mSDsluCounter, 2026 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 2170 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:30,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 2170 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 23:59:30,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-09 23:59:30,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2024-11-09 23:59:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 253 states have (on average 1.2885375494071147) internal successors, (326), 255 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:30,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 326 transitions. [2024-11-09 23:59:30,706 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 326 transitions. Word has length 71 [2024-11-09 23:59:30,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:30,707 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 326 transitions. [2024-11-09 23:59:30,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 21 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:30,707 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 326 transitions. [2024-11-09 23:59:30,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 23:59:30,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:30,708 INFO L215 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] [2024-11-09 23:59:30,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 23:59:30,708 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:30,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:30,708 INFO L85 PathProgramCache]: Analyzing trace with hash -991506201, now seen corresponding path program 1 times [2024-11-09 23:59:30,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:30,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039941807] [2024-11-09 23:59:30,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:30,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:31,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:31,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:31,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039941807] [2024-11-09 23:59:31,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039941807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:31,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:31,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 23:59:31,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043645016] [2024-11-09 23:59:31,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:31,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 23:59:31,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:31,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 23:59:31,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:59:31,178 INFO L87 Difference]: Start difference. First operand 256 states and 326 transitions. Second operand has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:31,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:31,713 INFO L93 Difference]: Finished difference Result 669 states and 906 transitions. [2024-11-09 23:59:31,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 23:59:31,713 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-09 23:59:31,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:31,715 INFO L225 Difference]: With dead ends: 669 [2024-11-09 23:59:31,715 INFO L226 Difference]: Without dead ends: 663 [2024-11-09 23:59:31,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2024-11-09 23:59:31,716 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 969 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:31,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 1712 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:59:31,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2024-11-09 23:59:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 243. [2024-11-09 23:59:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 241 states have (on average 1.2863070539419088) internal successors, (310), 242 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 310 transitions. [2024-11-09 23:59:31,721 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 310 transitions. Word has length 72 [2024-11-09 23:59:31,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:31,721 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 310 transitions. [2024-11-09 23:59:31,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.538461538461538) internal successors, (72), 13 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:31,721 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 310 transitions. [2024-11-09 23:59:31,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 23:59:31,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:31,722 INFO L215 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] [2024-11-09 23:59:31,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 23:59:31,722 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:31,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:31,723 INFO L85 PathProgramCache]: Analyzing trace with hash -396208807, now seen corresponding path program 1 times [2024-11-09 23:59:31,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:31,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039702123] [2024-11-09 23:59:31,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:31,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:32,092 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-09 23:59:32,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:32,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039702123] [2024-11-09 23:59:32,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039702123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:32,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:32,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 23:59:32,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812642718] [2024-11-09 23:59:32,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:32,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 23:59:32,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:32,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 23:59:32,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:59:32,095 INFO L87 Difference]: Start difference. First operand 243 states and 310 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:32,320 INFO L93 Difference]: Finished difference Result 394 states and 521 transitions. [2024-11-09 23:59:32,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 23:59:32,320 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-09 23:59:32,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:32,321 INFO L225 Difference]: With dead ends: 394 [2024-11-09 23:59:32,321 INFO L226 Difference]: Without dead ends: 378 [2024-11-09 23:59:32,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-09 23:59:32,322 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 425 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:32,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1445 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:59:32,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-09 23:59:32,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 220. [2024-11-09 23:59:32,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.2922374429223744) internal successors, (283), 219 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:32,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 283 transitions. [2024-11-09 23:59:32,326 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 283 transitions. Word has length 72 [2024-11-09 23:59:32,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:32,326 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 283 transitions. [2024-11-09 23:59:32,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:32,326 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 283 transitions. [2024-11-09 23:59:32,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 23:59:32,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:32,327 INFO L215 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] [2024-11-09 23:59:32,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 23:59:32,327 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:32,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:32,328 INFO L85 PathProgramCache]: Analyzing trace with hash 337906215, now seen corresponding path program 1 times [2024-11-09 23:59:32,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:32,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69929014] [2024-11-09 23:59:32,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:32,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:32,427 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-09 23:59:32,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:32,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69929014] [2024-11-09 23:59:32,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69929014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:32,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:32,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:59:32,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956353169] [2024-11-09 23:59:32,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:32,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:59:32,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:32,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:59:32,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:59:32,429 INFO L87 Difference]: Start difference. First operand 220 states and 283 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:32,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:32,532 INFO L93 Difference]: Finished difference Result 1132 states and 1627 transitions. [2024-11-09 23:59:32,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:59:32,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-09 23:59:32,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:32,536 INFO L225 Difference]: With dead ends: 1132 [2024-11-09 23:59:32,536 INFO L226 Difference]: Without dead ends: 1018 [2024-11-09 23:59:32,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:59:32,537 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 873 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:32,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 1082 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:59:32,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2024-11-09 23:59:32,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 332. [2024-11-09 23:59:32,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.3474320241691844) internal successors, (446), 331 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:32,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 446 transitions. [2024-11-09 23:59:32,544 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 446 transitions. Word has length 95 [2024-11-09 23:59:32,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:32,544 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 446 transitions. [2024-11-09 23:59:32,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:32,544 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 446 transitions. [2024-11-09 23:59:32,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 23:59:32,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:32,545 INFO L215 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] [2024-11-09 23:59:32,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 23:59:32,546 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:32,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:32,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2041893475, now seen corresponding path program 1 times [2024-11-09 23:59:32,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:32,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562957650] [2024-11-09 23:59:32,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:32,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:32,650 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-09 23:59:32,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:32,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562957650] [2024-11-09 23:59:32,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562957650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:32,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:32,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:59:32,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619049198] [2024-11-09 23:59:32,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:32,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:59:32,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:32,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:59:32,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:59:32,652 INFO L87 Difference]: Start difference. First operand 332 states and 446 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:32,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:32,728 INFO L93 Difference]: Finished difference Result 1350 states and 1934 transitions. [2024-11-09 23:59:32,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:59:32,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-11-09 23:59:32,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:32,730 INFO L225 Difference]: With dead ends: 1350 [2024-11-09 23:59:32,731 INFO L226 Difference]: Without dead ends: 1124 [2024-11-09 23:59:32,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:32,732 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 607 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:32,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 772 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:59:32,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2024-11-09 23:59:32,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 556. [2024-11-09 23:59:32,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 1.3945945945945946) internal successors, (774), 555 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 774 transitions. [2024-11-09 23:59:32,741 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 774 transitions. Word has length 97 [2024-11-09 23:59:32,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:32,742 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 774 transitions. [2024-11-09 23:59:32,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:32,742 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 774 transitions. [2024-11-09 23:59:32,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 23:59:32,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:32,743 INFO L215 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] [2024-11-09 23:59:32,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-09 23:59:32,743 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:32,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:32,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1691275741, now seen corresponding path program 1 times [2024-11-09 23:59:32,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:32,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650860607] [2024-11-09 23:59:32,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:32,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:32,860 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-09 23:59:32,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:32,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650860607] [2024-11-09 23:59:32,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650860607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:32,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:32,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:59:32,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45357007] [2024-11-09 23:59:32,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:32,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:59:32,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:32,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:59:32,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:59:32,862 INFO L87 Difference]: Start difference. First operand 556 states and 774 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:32,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:32,951 INFO L93 Difference]: Finished difference Result 1574 states and 2262 transitions. [2024-11-09 23:59:32,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:59:32,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-11-09 23:59:32,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:32,955 INFO L225 Difference]: With dead ends: 1574 [2024-11-09 23:59:32,955 INFO L226 Difference]: Without dead ends: 1348 [2024-11-09 23:59:32,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:32,956 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 649 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:32,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 718 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:59:32,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2024-11-09 23:59:32,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 892. [2024-11-09 23:59:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 891 states have (on average 1.4197530864197532) internal successors, (1265), 891 states have internal predecessors, (1265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1265 transitions. [2024-11-09 23:59:32,970 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1265 transitions. Word has length 97 [2024-11-09 23:59:32,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:32,970 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1265 transitions. [2024-11-09 23:59:32,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:32,970 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1265 transitions. [2024-11-09 23:59:32,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 23:59:32,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:32,971 INFO L215 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] [2024-11-09 23:59:32,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-09 23:59:32,972 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:32,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:32,972 INFO L85 PathProgramCache]: Analyzing trace with hash 464504227, now seen corresponding path program 1 times [2024-11-09 23:59:32,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:32,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792886515] [2024-11-09 23:59:32,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:32,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:33,072 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-09 23:59:33,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:33,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792886515] [2024-11-09 23:59:33,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792886515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:33,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:33,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:59:33,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057171056] [2024-11-09 23:59:33,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:33,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:59:33,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:33,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:59:33,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:59:33,076 INFO L87 Difference]: Start difference. First operand 892 states and 1265 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:33,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:33,169 INFO L93 Difference]: Finished difference Result 1798 states and 2590 transitions. [2024-11-09 23:59:33,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:59:33,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-11-09 23:59:33,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:33,174 INFO L225 Difference]: With dead ends: 1798 [2024-11-09 23:59:33,174 INFO L226 Difference]: Without dead ends: 1572 [2024-11-09 23:59:33,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:33,175 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 624 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:33,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [624 Valid, 780 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:59:33,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2024-11-09 23:59:33,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1116. [2024-11-09 23:59:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.4286995515695067) internal successors, (1593), 1115 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:33,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1593 transitions. [2024-11-09 23:59:33,191 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1593 transitions. Word has length 97 [2024-11-09 23:59:33,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:33,192 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1593 transitions. [2024-11-09 23:59:33,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:33,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1593 transitions. [2024-11-09 23:59:33,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 23:59:33,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:33,193 INFO L215 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] [2024-11-09 23:59:33,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-09 23:59:33,193 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:33,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:33,194 INFO L85 PathProgramCache]: Analyzing trace with hash 376519577, now seen corresponding path program 1 times [2024-11-09 23:59:33,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:33,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969848896] [2024-11-09 23:59:33,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:33,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:33,341 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-09 23:59:33,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:33,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969848896] [2024-11-09 23:59:33,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969848896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:33,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:33,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:59:33,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549828988] [2024-11-09 23:59:33,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:33,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:59:33,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:33,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:59:33,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:59:33,342 INFO L87 Difference]: Start difference. First operand 1116 states and 1593 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:33,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:33,403 INFO L93 Difference]: Finished difference Result 2128 states and 3072 transitions. [2024-11-09 23:59:33,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:59:33,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-11-09 23:59:33,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:33,405 INFO L225 Difference]: With dead ends: 2128 [2024-11-09 23:59:33,405 INFO L226 Difference]: Without dead ends: 1118 [2024-11-09 23:59:33,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:59:33,407 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 216 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:33,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 407 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:59:33,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2024-11-09 23:59:33,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1116. [2024-11-09 23:59:33,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.4197309417040358) internal successors, (1583), 1115 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1583 transitions. [2024-11-09 23:59:33,420 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1583 transitions. Word has length 98 [2024-11-09 23:59:33,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:33,420 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1583 transitions. [2024-11-09 23:59:33,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:33,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1583 transitions. [2024-11-09 23:59:33,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 23:59:33,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:33,422 INFO L215 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] [2024-11-09 23:59:33,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-09 23:59:33,422 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:33,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:33,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1688900296, now seen corresponding path program 1 times [2024-11-09 23:59:33,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:33,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429319948] [2024-11-09 23:59:33,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:33,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:33,479 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-09 23:59:33,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:33,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429319948] [2024-11-09 23:59:33,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429319948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:33,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:33,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:59:33,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468231007] [2024-11-09 23:59:33,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:33,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:59:33,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:33,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:59:33,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:59:33,481 INFO L87 Difference]: Start difference. First operand 1116 states and 1583 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:33,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:33,510 INFO L93 Difference]: Finished difference Result 3012 states and 4317 transitions. [2024-11-09 23:59:33,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:59:33,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-11-09 23:59:33,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:33,515 INFO L225 Difference]: With dead ends: 3012 [2024-11-09 23:59:33,516 INFO L226 Difference]: Without dead ends: 2002 [2024-11-09 23:59:33,517 INFO L431 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-09 23:59:33,517 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 111 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:33,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 275 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:59:33,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2024-11-09 23:59:33,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1982. [2024-11-09 23:59:33,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1981 states have (on average 1.4053508329126703) internal successors, (2784), 1981 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:33,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 2784 transitions. [2024-11-09 23:59:33,540 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 2784 transitions. Word has length 98 [2024-11-09 23:59:33,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:33,540 INFO L471 AbstractCegarLoop]: Abstraction has 1982 states and 2784 transitions. [2024-11-09 23:59:33,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:33,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 2784 transitions. [2024-11-09 23:59:33,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-09 23:59:33,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:33,542 INFO L215 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] [2024-11-09 23:59:33,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-09 23:59:33,542 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:33,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:33,542 INFO L85 PathProgramCache]: Analyzing trace with hash 340819858, now seen corresponding path program 1 times [2024-11-09 23:59:33,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:33,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601217981] [2024-11-09 23:59:33,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:33,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:33,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-09 23:59:33,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:33,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601217981] [2024-11-09 23:59:33,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601217981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:33,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:33,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:59:33,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16289753] [2024-11-09 23:59:33,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:33,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:59:33,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:33,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:59:33,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:59:33,663 INFO L87 Difference]: Start difference. First operand 1982 states and 2784 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:33,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:33,740 INFO L93 Difference]: Finished difference Result 3656 states and 5173 transitions. [2024-11-09 23:59:33,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:59:33,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-11-09 23:59:33,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:33,749 INFO L225 Difference]: With dead ends: 3656 [2024-11-09 23:59:33,750 INFO L226 Difference]: Without dead ends: 3238 [2024-11-09 23:59:33,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:33,751 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 598 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:33,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 920 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:59:33,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3238 states. [2024-11-09 23:59:33,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3238 to 2398. [2024-11-09 23:59:33,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2398 states, 2397 states have (on average 1.408427200667501) internal successors, (3376), 2397 states have internal predecessors, (3376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:33,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 3376 transitions. [2024-11-09 23:59:33,778 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 3376 transitions. Word has length 98 [2024-11-09 23:59:33,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:33,779 INFO L471 AbstractCegarLoop]: Abstraction has 2398 states and 3376 transitions. [2024-11-09 23:59:33,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 3376 transitions. [2024-11-09 23:59:33,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 23:59:33,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:33,780 INFO L215 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] [2024-11-09 23:59:33,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-09 23:59:33,781 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:33,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:33,781 INFO L85 PathProgramCache]: Analyzing trace with hash -542058657, now seen corresponding path program 1 times [2024-11-09 23:59:33,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:33,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138550134] [2024-11-09 23:59:33,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:33,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:33,885 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-09 23:59:33,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:33,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138550134] [2024-11-09 23:59:33,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138550134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:33,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:33,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:59:33,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531967409] [2024-11-09 23:59:33,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:33,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:59:33,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:33,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:59:33,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:59:33,887 INFO L87 Difference]: Start difference. First operand 2398 states and 3376 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:34,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:34,090 INFO L93 Difference]: Finished difference Result 8214 states and 11788 transitions. [2024-11-09 23:59:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:59:34,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-11-09 23:59:34,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:34,101 INFO L225 Difference]: With dead ends: 8214 [2024-11-09 23:59:34,101 INFO L226 Difference]: Without dead ends: 5922 [2024-11-09 23:59:34,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:59:34,105 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 702 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:34,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 415 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:59:34,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5922 states. [2024-11-09 23:59:34,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5922 to 4270. [2024-11-09 23:59:34,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4270 states, 4269 states have (on average 1.4096978215038651) internal successors, (6018), 4269 states have internal predecessors, (6018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:34,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4270 states to 4270 states and 6018 transitions. [2024-11-09 23:59:34,150 INFO L78 Accepts]: Start accepts. Automaton has 4270 states and 6018 transitions. Word has length 99 [2024-11-09 23:59:34,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:34,151 INFO L471 AbstractCegarLoop]: Abstraction has 4270 states and 6018 transitions. [2024-11-09 23:59:34,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:34,151 INFO L276 IsEmpty]: Start isEmpty. Operand 4270 states and 6018 transitions. [2024-11-09 23:59:34,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 23:59:34,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:34,152 INFO L215 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] [2024-11-09 23:59:34,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-09 23:59:34,153 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:34,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:34,153 INFO L85 PathProgramCache]: Analyzing trace with hash 335796895, now seen corresponding path program 1 times [2024-11-09 23:59:34,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:34,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882498894] [2024-11-09 23:59:34,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:34,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:34,253 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-09 23:59:34,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:34,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882498894] [2024-11-09 23:59:34,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882498894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:34,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:34,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:59:34,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976155814] [2024-11-09 23:59:34,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:34,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:59:34,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:34,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:59:34,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:59:34,254 INFO L87 Difference]: Start difference. First operand 4270 states and 6018 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:34,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:34,429 INFO L93 Difference]: Finished difference Result 15238 states and 21784 transitions. [2024-11-09 23:59:34,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:59:34,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-11-09 23:59:34,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:34,446 INFO L225 Difference]: With dead ends: 15238 [2024-11-09 23:59:34,447 INFO L226 Difference]: Without dead ends: 11074 [2024-11-09 23:59:34,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:59:34,454 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 887 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:34,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 324 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:59:34,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11074 states. [2024-11-09 23:59:34,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11074 to 9092. [2024-11-09 23:59:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9092 states, 9091 states have (on average 1.4128258717412825) internal successors, (12844), 9091 states have internal predecessors, (12844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:34,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9092 states to 9092 states and 12844 transitions. [2024-11-09 23:59:34,623 INFO L78 Accepts]: Start accepts. Automaton has 9092 states and 12844 transitions. Word has length 99 [2024-11-09 23:59:34,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:34,623 INFO L471 AbstractCegarLoop]: Abstraction has 9092 states and 12844 transitions. [2024-11-09 23:59:34,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:34,624 INFO L276 IsEmpty]: Start isEmpty. Operand 9092 states and 12844 transitions. [2024-11-09 23:59:34,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 23:59:34,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:34,626 INFO L215 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] [2024-11-09 23:59:34,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-09 23:59:34,627 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:34,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:34,627 INFO L85 PathProgramCache]: Analyzing trace with hash 876609181, now seen corresponding path program 1 times [2024-11-09 23:59:34,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:34,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541969066] [2024-11-09 23:59:34,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:34,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:34,778 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-09 23:59:34,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:34,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541969066] [2024-11-09 23:59:34,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541969066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:34,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:34,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:59:34,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230252776] [2024-11-09 23:59:34,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:34,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:59:34,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:34,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:59:34,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:59:34,780 INFO L87 Difference]: Start difference. First operand 9092 states and 12844 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:35,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:35,042 INFO L93 Difference]: Finished difference Result 29704 states and 42262 transitions. [2024-11-09 23:59:35,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:59:35,042 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-11-09 23:59:35,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:35,070 INFO L225 Difference]: With dead ends: 29704 [2024-11-09 23:59:35,070 INFO L226 Difference]: Without dead ends: 20718 [2024-11-09 23:59:35,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:59:35,084 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 799 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:35,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 324 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:59:35,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20718 states. [2024-11-09 23:59:35,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20718 to 19396. [2024-11-09 23:59:35,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19396 states, 19395 states have (on average 1.4137664346481051) internal successors, (27420), 19395 states have internal predecessors, (27420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:35,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19396 states to 19396 states and 27420 transitions. [2024-11-09 23:59:35,302 INFO L78 Accepts]: Start accepts. Automaton has 19396 states and 27420 transitions. Word has length 100 [2024-11-09 23:59:35,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:35,303 INFO L471 AbstractCegarLoop]: Abstraction has 19396 states and 27420 transitions. [2024-11-09 23:59:35,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:35,303 INFO L276 IsEmpty]: Start isEmpty. Operand 19396 states and 27420 transitions. [2024-11-09 23:59:35,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 23:59:35,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:35,308 INFO L215 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] [2024-11-09 23:59:35,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-09 23:59:35,308 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:35,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:35,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1909387452, now seen corresponding path program 1 times [2024-11-09 23:59:35,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:35,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052708928] [2024-11-09 23:59:35,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:35,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:35,394 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-09 23:59:35,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:35,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052708928] [2024-11-09 23:59:35,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052708928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:35,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:35,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:59:35,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279869915] [2024-11-09 23:59:35,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:35,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:59:35,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:35,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:59:35,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:59:35,449 INFO L87 Difference]: Start difference. First operand 19396 states and 27420 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:35,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:35,532 INFO L93 Difference]: Finished difference Result 37104 states and 52350 transitions. [2024-11-09 23:59:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:59:35,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-11-09 23:59:35,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:35,557 INFO L225 Difference]: With dead ends: 37104 [2024-11-09 23:59:35,557 INFO L226 Difference]: Without dead ends: 17814 [2024-11-09 23:59:35,576 INFO L431 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-09 23:59:35,577 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 77 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:35,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 345 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:59:35,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17814 states. [2024-11-09 23:59:35,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17814 to 14376. [2024-11-09 23:59:35,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14376 states, 14375 states have (on average 1.3929739130434782) internal successors, (20024), 14375 states have internal predecessors, (20024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:35,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14376 states to 14376 states and 20024 transitions. [2024-11-09 23:59:35,758 INFO L78 Accepts]: Start accepts. Automaton has 14376 states and 20024 transitions. Word has length 101 [2024-11-09 23:59:35,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:35,758 INFO L471 AbstractCegarLoop]: Abstraction has 14376 states and 20024 transitions. [2024-11-09 23:59:35,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:35,759 INFO L276 IsEmpty]: Start isEmpty. Operand 14376 states and 20024 transitions. [2024-11-09 23:59:35,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 23:59:35,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:35,760 INFO L215 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] [2024-11-09 23:59:35,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-09 23:59:35,760 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:35,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:35,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1756962837, now seen corresponding path program 1 times [2024-11-09 23:59:35,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:35,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037091409] [2024-11-09 23:59:35,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:35,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:35,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:35,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:35,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037091409] [2024-11-09 23:59:35,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037091409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:35,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:35,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:59:35,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276201386] [2024-11-09 23:59:35,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:35,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:59:35,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:35,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:59:35,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:59:35,851 INFO L87 Difference]: Start difference. First operand 14376 states and 20024 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:35,918 INFO L93 Difference]: Finished difference Result 27460 states and 38130 transitions. [2024-11-09 23:59:35,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:59:35,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-11-09 23:59:35,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:35,937 INFO L225 Difference]: With dead ends: 27460 [2024-11-09 23:59:35,937 INFO L226 Difference]: Without dead ends: 13190 [2024-11-09 23:59:35,950 INFO L431 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-09 23:59:35,951 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 70 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:35,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 348 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:59:35,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13190 states. [2024-11-09 23:59:36,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13190 to 12792. [2024-11-09 23:59:36,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12792 states, 12791 states have (on average 1.3745602376671098) internal successors, (17582), 12791 states have internal predecessors, (17582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:36,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12792 states to 12792 states and 17582 transitions. [2024-11-09 23:59:36,072 INFO L78 Accepts]: Start accepts. Automaton has 12792 states and 17582 transitions. Word has length 102 [2024-11-09 23:59:36,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:36,072 INFO L471 AbstractCegarLoop]: Abstraction has 12792 states and 17582 transitions. [2024-11-09 23:59:36,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:36,072 INFO L276 IsEmpty]: Start isEmpty. Operand 12792 states and 17582 transitions. [2024-11-09 23:59:36,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 23:59:36,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:36,074 INFO L215 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] [2024-11-09 23:59:36,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-09 23:59:36,074 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:36,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:36,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1776354695, now seen corresponding path program 1 times [2024-11-09 23:59:36,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:36,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241297316] [2024-11-09 23:59:36,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:36,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:36,198 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-09 23:59:36,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:36,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241297316] [2024-11-09 23:59:36,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241297316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:36,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:36,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:59:36,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654402578] [2024-11-09 23:59:36,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:36,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:59:36,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:36,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:59:36,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:59:36,199 INFO L87 Difference]: Start difference. First operand 12792 states and 17582 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:36,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:36,254 INFO L93 Difference]: Finished difference Result 36954 states and 50536 transitions. [2024-11-09 23:59:36,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:59:36,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-11-09 23:59:36,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:36,288 INFO L225 Difference]: With dead ends: 36954 [2024-11-09 23:59:36,288 INFO L226 Difference]: Without dead ends: 24268 [2024-11-09 23:59:36,303 INFO L431 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-09 23:59:36,304 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 60 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:36,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 351 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:59:36,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24268 states. [2024-11-09 23:59:36,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24268 to 22726. [2024-11-09 23:59:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22726 states, 22725 states have (on average 1.3583278327832784) internal successors, (30868), 22725 states have internal predecessors, (30868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:36,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22726 states to 22726 states and 30868 transitions. [2024-11-09 23:59:36,562 INFO L78 Accepts]: Start accepts. Automaton has 22726 states and 30868 transitions. Word has length 103 [2024-11-09 23:59:36,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:36,563 INFO L471 AbstractCegarLoop]: Abstraction has 22726 states and 30868 transitions. [2024-11-09 23:59:36,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:36,563 INFO L276 IsEmpty]: Start isEmpty. Operand 22726 states and 30868 transitions. [2024-11-09 23:59:36,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 23:59:36,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:36,564 INFO L215 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] [2024-11-09 23:59:36,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-09 23:59:36,564 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:36,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:36,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1196621385, now seen corresponding path program 1 times [2024-11-09 23:59:36,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:36,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431447625] [2024-11-09 23:59:36,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:36,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:36,858 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-09 23:59:36,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:36,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431447625] [2024-11-09 23:59:36,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431447625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:36,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:36,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:59:36,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30104019] [2024-11-09 23:59:36,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:36,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:59:36,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:36,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:59:36,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:59:36,861 INFO L87 Difference]: Start difference. First operand 22726 states and 30868 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:36,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:36,926 INFO L93 Difference]: Finished difference Result 23808 states and 32189 transitions. [2024-11-09 23:59:36,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:59:36,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-11-09 23:59:36,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:36,953 INFO L225 Difference]: With dead ends: 23808 [2024-11-09 23:59:36,954 INFO L226 Difference]: Without dead ends: 23806 [2024-11-09 23:59:36,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:59:36,965 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:36,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 804 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:59:36,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23806 states. [2024-11-09 23:59:37,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23806 to 23806. [2024-11-09 23:59:37,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23806 states, 23805 states have (on average 1.3360218441503886) internal successors, (31804), 23805 states have internal predecessors, (31804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:37,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23806 states to 23806 states and 31804 transitions. [2024-11-09 23:59:37,208 INFO L78 Accepts]: Start accepts. Automaton has 23806 states and 31804 transitions. Word has length 104 [2024-11-09 23:59:37,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:37,208 INFO L471 AbstractCegarLoop]: Abstraction has 23806 states and 31804 transitions. [2024-11-09 23:59:37,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:37,208 INFO L276 IsEmpty]: Start isEmpty. Operand 23806 states and 31804 transitions. [2024-11-09 23:59:37,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 23:59:37,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:37,209 INFO L215 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] [2024-11-09 23:59:37,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-09 23:59:37,209 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:37,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:37,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1260409889, now seen corresponding path program 1 times [2024-11-09 23:59:37,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:37,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217390384] [2024-11-09 23:59:37,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:37,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:37,310 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-09 23:59:37,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:37,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217390384] [2024-11-09 23:59:37,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217390384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:37,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:37,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:59:37,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931903801] [2024-11-09 23:59:37,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:37,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:59:37,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:37,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:59:37,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:59:37,312 INFO L87 Difference]: Start difference. First operand 23806 states and 31804 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:37,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:37,629 INFO L93 Difference]: Finished difference Result 49466 states and 66156 transitions. [2024-11-09 23:59:37,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:59:37,630 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-11-09 23:59:37,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:37,662 INFO L225 Difference]: With dead ends: 49466 [2024-11-09 23:59:37,662 INFO L226 Difference]: Without dead ends: 25766 [2024-11-09 23:59:37,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:59:37,671 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 650 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:37,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 358 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:59:37,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25766 states. [2024-11-09 23:59:37,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25766 to 23674. [2024-11-09 23:59:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23674 states, 23673 states have (on average 1.326743547501373) internal successors, (31408), 23673 states have internal predecessors, (31408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23674 states to 23674 states and 31408 transitions. [2024-11-09 23:59:37,991 INFO L78 Accepts]: Start accepts. Automaton has 23674 states and 31408 transitions. Word has length 104 [2024-11-09 23:59:37,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:37,991 INFO L471 AbstractCegarLoop]: Abstraction has 23674 states and 31408 transitions. [2024-11-09 23:59:37,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:37,991 INFO L276 IsEmpty]: Start isEmpty. Operand 23674 states and 31408 transitions. [2024-11-09 23:59:37,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 23:59:37,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:37,992 INFO L215 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] [2024-11-09 23:59:37,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-09 23:59:37,993 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:37,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:37,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2108037309, now seen corresponding path program 1 times [2024-11-09 23:59:37,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:37,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236945683] [2024-11-09 23:59:37,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:37,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:38,119 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-09 23:59:38,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:38,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236945683] [2024-11-09 23:59:38,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236945683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:38,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:38,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:59:38,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870283116] [2024-11-09 23:59:38,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:38,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:59:38,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:38,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:59:38,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:59:38,122 INFO L87 Difference]: Start difference. First operand 23674 states and 31408 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:38,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:38,222 INFO L93 Difference]: Finished difference Result 51374 states and 68082 transitions. [2024-11-09 23:59:38,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:59:38,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-11-09 23:59:38,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:38,257 INFO L225 Difference]: With dead ends: 51374 [2024-11-09 23:59:38,257 INFO L226 Difference]: Without dead ends: 27806 [2024-11-09 23:59:38,277 INFO L431 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-09 23:59:38,277 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 81 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:38,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 352 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:59:38,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27806 states. [2024-11-09 23:59:38,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27806 to 27100. [2024-11-09 23:59:38,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27100 states, 27099 states have (on average 1.3088305841543968) internal successors, (35468), 27099 states have internal predecessors, (35468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:38,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27100 states to 27100 states and 35468 transitions. [2024-11-09 23:59:38,511 INFO L78 Accepts]: Start accepts. Automaton has 27100 states and 35468 transitions. Word has length 105 [2024-11-09 23:59:38,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:38,511 INFO L471 AbstractCegarLoop]: Abstraction has 27100 states and 35468 transitions. [2024-11-09 23:59:38,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:38,512 INFO L276 IsEmpty]: Start isEmpty. Operand 27100 states and 35468 transitions. [2024-11-09 23:59:38,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 23:59:38,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:38,617 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:59:38,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-09 23:59:38,617 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:38,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:38,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1101536275, now seen corresponding path program 1 times [2024-11-09 23:59:38,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:38,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609968054] [2024-11-09 23:59:38,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:38,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:38,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:38,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609968054] [2024-11-09 23:59:38,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609968054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:38,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:38,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:59:38,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955235461] [2024-11-09 23:59:38,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:38,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:59:38,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:38,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:59:38,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:59:38,702 INFO L87 Difference]: Start difference. First operand 27100 states and 35468 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:38,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:38,786 INFO L93 Difference]: Finished difference Result 52512 states and 68270 transitions. [2024-11-09 23:59:38,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:59:38,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2024-11-09 23:59:38,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:38,806 INFO L225 Difference]: With dead ends: 52512 [2024-11-09 23:59:38,806 INFO L226 Difference]: Without dead ends: 25518 [2024-11-09 23:59:38,825 INFO L431 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-09 23:59:38,826 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 66 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 324 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-09 23:59:38,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 324 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:59:38,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25518 states. [2024-11-09 23:59:38,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25518 to 25516. [2024-11-09 23:59:38,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25516 states, 25515 states have (on average 1.2762688614540467) internal successors, (32564), 25515 states have internal predecessors, (32564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:39,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25516 states to 25516 states and 32564 transitions. [2024-11-09 23:59:39,010 INFO L78 Accepts]: Start accepts. Automaton has 25516 states and 32564 transitions. Word has length 132 [2024-11-09 23:59:39,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:39,010 INFO L471 AbstractCegarLoop]: Abstraction has 25516 states and 32564 transitions. [2024-11-09 23:59:39,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:39,011 INFO L276 IsEmpty]: Start isEmpty. Operand 25516 states and 32564 transitions. [2024-11-09 23:59:39,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 23:59:39,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:39,014 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:59:39,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-09 23:59:39,015 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:39,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:39,015 INFO L85 PathProgramCache]: Analyzing trace with hash 383000128, now seen corresponding path program 1 times [2024-11-09 23:59:39,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:39,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176680036] [2024-11-09 23:59:39,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:39,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:39,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:39,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176680036] [2024-11-09 23:59:39,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176680036] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:59:39,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125889303] [2024-11-09 23:59:39,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:39,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:59:39,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:59:39,521 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:59:39,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 23:59:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:39,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 23:59:39,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:59:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:40,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:59:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:41,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125889303] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:59:41,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:59:41,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 27 [2024-11-09 23:59:41,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006635179] [2024-11-09 23:59:41,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:59:41,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 23:59:41,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:41,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 23:59:41,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2024-11-09 23:59:41,214 INFO L87 Difference]: Start difference. First operand 25516 states and 32564 transitions. Second operand has 27 states, 27 states have (on average 13.518518518518519) internal successors, (365), 27 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:47,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:47,334 INFO L93 Difference]: Finished difference Result 207926 states and 264821 transitions. [2024-11-09 23:59:47,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2024-11-09 23:59:47,334 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 13.518518518518519) internal successors, (365), 27 states have internal predecessors, (365), 0 states have call successors, (0), 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 133 [2024-11-09 23:59:47,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:47,550 INFO L225 Difference]: With dead ends: 207926 [2024-11-09 23:59:47,550 INFO L226 Difference]: Without dead ends: 182516 [2024-11-09 23:59:47,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5734 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2803, Invalid=15829, Unknown=0, NotChecked=0, Total=18632 [2024-11-09 23:59:47,611 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 4071 mSDsluCounter, 2291 mSDsCounter, 0 mSdLazyCounter, 3223 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4071 SdHoareTripleChecker+Valid, 2439 SdHoareTripleChecker+Invalid, 3303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 3223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:47,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4071 Valid, 2439 Invalid, 3303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 3223 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 23:59:47,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182516 states. [2024-11-09 23:59:49,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182516 to 125290. [2024-11-09 23:59:49,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125290 states, 125289 states have (on average 1.2732801762325503) internal successors, (159528), 125289 states have internal predecessors, (159528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125290 states to 125290 states and 159528 transitions. [2024-11-09 23:59:49,630 INFO L78 Accepts]: Start accepts. Automaton has 125290 states and 159528 transitions. Word has length 133 [2024-11-09 23:59:49,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:49,630 INFO L471 AbstractCegarLoop]: Abstraction has 125290 states and 159528 transitions. [2024-11-09 23:59:49,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 13.518518518518519) internal successors, (365), 27 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:49,630 INFO L276 IsEmpty]: Start isEmpty. Operand 125290 states and 159528 transitions. [2024-11-09 23:59:49,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 23:59:49,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:49,643 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:59:49,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 23:59:49,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2024-11-09 23:59:49,844 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:49,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:49,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2094135852, now seen corresponding path program 1 times [2024-11-09 23:59:49,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:49,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953890479] [2024-11-09 23:59:49,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:49,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:50,387 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 23:59:50,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:50,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953890479] [2024-11-09 23:59:50,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953890479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:59:50,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:59:50,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:59:50,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7025215] [2024-11-09 23:59:50,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:59:50,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:59:50,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:50,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:59:50,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:59:50,393 INFO L87 Difference]: Start difference. First operand 125290 states and 159528 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:51,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:59:51,568 INFO L93 Difference]: Finished difference Result 304626 states and 387412 transitions. [2024-11-09 23:59:51,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 23:59:51,569 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 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 134 [2024-11-09 23:59:51,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:59:51,985 INFO L225 Difference]: With dead ends: 304626 [2024-11-09 23:59:51,985 INFO L226 Difference]: Without dead ends: 179460 [2024-11-09 23:59:52,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-09 23:59:52,053 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 340 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:59:52,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 649 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:59:52,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179460 states. [2024-11-09 23:59:53,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179460 to 125290. [2024-11-09 23:59:53,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125290 states, 125289 states have (on average 1.273248250045894) internal successors, (159524), 125289 states have internal predecessors, (159524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:53,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125290 states to 125290 states and 159524 transitions. [2024-11-09 23:59:53,997 INFO L78 Accepts]: Start accepts. Automaton has 125290 states and 159524 transitions. Word has length 134 [2024-11-09 23:59:53,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:59:53,997 INFO L471 AbstractCegarLoop]: Abstraction has 125290 states and 159524 transitions. [2024-11-09 23:59:53,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:59:53,997 INFO L276 IsEmpty]: Start isEmpty. Operand 125290 states and 159524 transitions. [2024-11-09 23:59:54,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 23:59:54,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:59:54,008 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 23:59:54,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-09 23:59:54,009 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-11-09 23:59:54,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:59:54,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1185794471, now seen corresponding path program 1 times [2024-11-09 23:59:54,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:59:54,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548906809] [2024-11-09 23:59:54,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:54,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:59:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:54,725 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:54,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:59:54,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548906809] [2024-11-09 23:59:54,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548906809] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:59:54,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146232165] [2024-11-09 23:59:54,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:59:54,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:59:54,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:59:54,728 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:59:54,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 23:59:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:59:54,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 23:59:54,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:59:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:55,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:59:57,321 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:59:57,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146232165] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:59:57,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:59:57,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2024-11-09 23:59:57,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659584348] [2024-11-09 23:59:57,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:59:57,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 23:59:57,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:59:57,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 23:59:57,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2024-11-09 23:59:57,327 INFO L87 Difference]: Start difference. First operand 125290 states and 159524 transitions. Second operand has 32 states, 32 states have (on average 11.75) internal successors, (376), 31 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)