./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 5a17c5e6b377f57a67eda09046c4807c6b84e7806fd109e4ef14e9498a7cb447 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:47:52,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:47:52,424 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:47:52,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:47:52,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:47:52,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:47:52,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:47:52,463 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:47:52,464 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:47:52,465 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:47:52,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:47:52,466 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:47:52,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:47:52,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:47:52,469 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:47:52,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:47:52,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:47:52,470 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:47:52,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:47:52,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:47:52,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:47:52,473 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:47:52,473 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:47:52,473 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:47:52,474 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:47:52,474 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:47:52,474 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:47:52,474 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:47:52,475 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:47:52,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:47:52,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:47:52,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:47:52,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:47:52,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:47:52,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:47:52,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:47:52,478 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:47:52,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:47:52,479 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:47:52,479 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:47:52,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:47:52,480 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:47:52,480 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-clean/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-clean/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 -> 5a17c5e6b377f57a67eda09046c4807c6b84e7806fd109e4ef14e9498a7cb447 [2024-10-11 03:47:52,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:47:52,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:47:52,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:47:52,762 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:47:52,763 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:47:52,764 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-10-11 03:47:54,171 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:47:54,465 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:47:54,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-10-11 03:47:54,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/27b2fbd90/3c0f329ad8fc4f5f82c34f2db41e25aa/FLAGd840e8bd2 [2024-10-11 03:47:54,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/27b2fbd90/3c0f329ad8fc4f5f82c34f2db41e25aa [2024-10-11 03:47:54,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:47:54,505 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:47:54,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:47:54,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:47:54,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:47:54,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:47:54" (1/1) ... [2024-10-11 03:47:54,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1504ba07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:54, skipping insertion in model container [2024-10-11 03:47:54,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:47:54" (1/1) ... [2024-10-11 03:47:54,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:47:54,930 WARN L248 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16906,16919] [2024-10-11 03:47:54,965 WARN L248 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[23310,23323] [2024-10-11 03:47:54,980 WARN L248 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[26497,26510] [2024-10-11 03:47:54,992 WARN L248 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[29453,29466] [2024-10-11 03:47:55,026 WARN L248 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33216,33229] [2024-10-11 03:47:55,042 WARN L248 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[36248,36261] [2024-10-11 03:47:55,059 WARN L248 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[39433,39446] [2024-10-11 03:47:55,069 WARN L248 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[42384,42397] [2024-10-11 03:47:55,086 WARN L248 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[45768,45781] [2024-10-11 03:47:55,096 WARN L248 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[48734,48747] [2024-10-11 03:47:55,118 WARN L248 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[51883,51896] [2024-10-11 03:47:55,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:47:55,196 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:47:55,277 WARN L248 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[16906,16919] [2024-10-11 03:47:55,302 WARN L248 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[23310,23323] [2024-10-11 03:47:55,310 WARN L248 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[26497,26510] [2024-10-11 03:47:55,317 WARN L248 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[29453,29466] [2024-10-11 03:47:55,326 WARN L248 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33216,33229] [2024-10-11 03:47:55,337 WARN L248 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[36248,36261] [2024-10-11 03:47:55,345 WARN L248 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[39433,39446] [2024-10-11 03:47:55,353 WARN L248 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[42384,42397] [2024-10-11 03:47:55,361 WARN L248 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[45768,45781] [2024-10-11 03:47:55,368 WARN L248 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[48734,48747] [2024-10-11 03:47:55,374 WARN L248 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[51883,51896] [2024-10-11 03:47:55,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:47:55,415 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:47:55,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:55 WrapperNode [2024-10-11 03:47:55,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:47:55,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:47:55,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:47:55,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:47:55,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:55" (1/1) ... [2024-10-11 03:47:55,464 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:55" (1/1) ... [2024-10-11 03:47:55,554 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2754 [2024-10-11 03:47:55,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:47:55,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:47:55,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:47:55,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:47:55,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:55" (1/1) ... [2024-10-11 03:47:55,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:55" (1/1) ... [2024-10-11 03:47:55,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:55" (1/1) ... [2024-10-11 03:47:55,623 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-10-11 03:47:55,624 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:55" (1/1) ... [2024-10-11 03:47:55,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:55" (1/1) ... [2024-10-11 03:47:55,663 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:55" (1/1) ... [2024-10-11 03:47:55,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:55" (1/1) ... [2024-10-11 03:47:55,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:55" (1/1) ... [2024-10-11 03:47:55,700 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:55" (1/1) ... [2024-10-11 03:47:55,712 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:47:55,714 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:47:55,715 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:47:55,715 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:47:55,715 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:55" (1/1) ... [2024-10-11 03:47:55,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:47:55,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:47:55,746 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:47:55,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:47:55,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:47:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:47:55,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:47:55,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:47:55,957 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:47:55,960 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:47:57,523 INFO L? ?]: Removed 475 outVars from TransFormulas that were not future-live. [2024-10-11 03:47:57,523 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:47:57,585 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:47:57,585 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:47:57,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:47:57 BoogieIcfgContainer [2024-10-11 03:47:57,586 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:47:57,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:47:57,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:47:57,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:47:57,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:47:54" (1/3) ... [2024-10-11 03:47:57,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a35c3aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:47:57, skipping insertion in model container [2024-10-11 03:47:57,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:47:55" (2/3) ... [2024-10-11 03:47:57,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a35c3aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:47:57, skipping insertion in model container [2024-10-11 03:47:57,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:47:57" (3/3) ... [2024-10-11 03:47:57,595 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2024-10-11 03:47:57,608 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:47:57,608 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-10-11 03:47:57,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:47:57,690 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;@37ce9b80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:47:57,690 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-10-11 03:47:57,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 535 states, 523 states have (on average 1.8336520076481835) internal successors, (959), 534 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:57,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 03:47:57,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:57,720 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] [2024-10-11 03:47:57,720 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:57,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:57,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1216794109, now seen corresponding path program 1 times [2024-10-11 03:47:57,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:57,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340072253] [2024-10-11 03:47:57,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:57,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:58,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:47:58,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:58,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340072253] [2024-10-11 03:47:58,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340072253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:58,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:58,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:47:58,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691967041] [2024-10-11 03:47:58,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:58,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:47:58,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:58,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:47:58,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:47:58,353 INFO L87 Difference]: Start difference. First operand has 535 states, 523 states have (on average 1.8336520076481835) internal successors, (959), 534 states have internal predecessors, (959), 0 states have call successors, (0), 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.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:58,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:58,906 INFO L93 Difference]: Finished difference Result 735 states and 1283 transitions. [2024-10-11 03:47:58,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:47:58,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-11 03:47:58,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:58,922 INFO L225 Difference]: With dead ends: 735 [2024-10-11 03:47:58,922 INFO L226 Difference]: Without dead ends: 469 [2024-10-11 03:47:58,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:47:58,928 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 2331 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2331 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:58,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2331 Valid, 504 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:47:58,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-10-11 03:47:58,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2024-10-11 03:47:58,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 458 states have (on average 1.296943231441048) internal successors, (594), 468 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:58,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 594 transitions. [2024-10-11 03:47:58,984 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 594 transitions. Word has length 58 [2024-10-11 03:47:58,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:58,985 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 594 transitions. [2024-10-11 03:47:58,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:58,985 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 594 transitions. [2024-10-11 03:47:58,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 03:47:58,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:58,991 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] [2024-10-11 03:47:58,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:47:58,995 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:58,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:58,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1191017074, now seen corresponding path program 1 times [2024-10-11 03:47:58,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:58,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864039496] [2024-10-11 03:47:58,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:58,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:59,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:47:59,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:59,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864039496] [2024-10-11 03:47:59,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864039496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:59,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:59,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:47:59,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904742996] [2024-10-11 03:47:59,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:59,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:47:59,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:59,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:47:59,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:47:59,237 INFO L87 Difference]: Start difference. First operand 469 states and 594 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:59,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:59,509 INFO L93 Difference]: Finished difference Result 567 states and 716 transitions. [2024-10-11 03:47:59,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:47:59,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-11 03:47:59,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:59,513 INFO L225 Difference]: With dead ends: 567 [2024-10-11 03:47:59,515 INFO L226 Difference]: Without dead ends: 329 [2024-10-11 03:47:59,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:47:59,517 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 1181 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:59,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 235 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:47:59,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-11 03:47:59,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2024-10-11 03:47:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 318 states have (on average 1.29874213836478) internal successors, (413), 328 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-10-11 03:47:59,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 413 transitions. [2024-10-11 03:47:59,537 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 413 transitions. Word has length 58 [2024-10-11 03:47:59,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:59,538 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 413 transitions. [2024-10-11 03:47:59,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:59,538 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 413 transitions. [2024-10-11 03:47:59,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 03:47:59,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:59,540 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] [2024-10-11 03:47:59,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:47:59,540 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:59,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:59,541 INFO L85 PathProgramCache]: Analyzing trace with hash 53020530, now seen corresponding path program 1 times [2024-10-11 03:47:59,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:59,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953005620] [2024-10-11 03:47:59,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:59,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:47:59,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:47:59,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:47:59,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953005620] [2024-10-11 03:47:59,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953005620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:47:59,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:47:59,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:47:59,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648706187] [2024-10-11 03:47:59,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:47:59,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:47:59,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:47:59,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:47:59,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:47:59,715 INFO L87 Difference]: Start difference. First operand 329 states and 413 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:59,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:47:59,905 INFO L93 Difference]: Finished difference Result 463 states and 590 transitions. [2024-10-11 03:47:59,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:47:59,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-11 03:47:59,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:47:59,907 INFO L225 Difference]: With dead ends: 463 [2024-10-11 03:47:59,907 INFO L226 Difference]: Without dead ends: 282 [2024-10-11 03:47:59,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:47:59,909 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 1036 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:47:59,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 202 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:47:59,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-11 03:47:59,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-10-11 03:47:59,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 271 states have (on average 1.3173431734317342) internal successors, (357), 281 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:59,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 357 transitions. [2024-10-11 03:47:59,918 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 357 transitions. Word has length 58 [2024-10-11 03:47:59,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:47:59,918 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 357 transitions. [2024-10-11 03:47:59,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:47:59,918 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 357 transitions. [2024-10-11 03:47:59,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 03:47:59,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:47:59,920 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-10-11 03:47:59,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:47:59,920 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:47:59,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:47:59,921 INFO L85 PathProgramCache]: Analyzing trace with hash 84136005, now seen corresponding path program 1 times [2024-10-11 03:47:59,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:47:59,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385923675] [2024-10-11 03:47:59,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:47:59,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:47:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:00,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:00,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385923675] [2024-10-11 03:48:00,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385923675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:00,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:00,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:48:00,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956099186] [2024-10-11 03:48:00,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:00,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:48:00,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:00,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:48:00,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:48:00,064 INFO L87 Difference]: Start difference. First operand 282 states and 357 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-10-11 03:48:00,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:00,217 INFO L93 Difference]: Finished difference Result 400 states and 509 transitions. [2024-10-11 03:48:00,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:48:00,217 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-10-11 03:48:00,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:00,218 INFO L225 Difference]: With dead ends: 400 [2024-10-11 03:48:00,219 INFO L226 Difference]: Without dead ends: 244 [2024-10-11 03:48:00,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:48:00,220 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 878 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:00,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 191 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:48:00,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-11 03:48:00,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2024-10-11 03:48:00,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 233 states have (on average 1.3218884120171674) internal successors, (308), 243 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-10-11 03:48:00,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 308 transitions. [2024-10-11 03:48:00,242 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 308 transitions. Word has length 59 [2024-10-11 03:48:00,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:00,243 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 308 transitions. [2024-10-11 03:48:00,243 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-10-11 03:48:00,243 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 308 transitions. [2024-10-11 03:48:00,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 03:48:00,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:00,245 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] [2024-10-11 03:48:00,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:48:00,245 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:00,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:00,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1322654244, now seen corresponding path program 1 times [2024-10-11 03:48:00,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:00,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096992732] [2024-10-11 03:48:00,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:00,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:00,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:00,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096992732] [2024-10-11 03:48:00,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096992732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:00,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:00,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:48:00,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463303772] [2024-10-11 03:48:00,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:00,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:48:00,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:00,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:48:00,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:48:00,646 INFO L87 Difference]: Start difference. First operand 244 states and 308 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:01,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:01,181 INFO L93 Difference]: Finished difference Result 442 states and 575 transitions. [2024-10-11 03:48:01,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:48:01,181 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-10-11 03:48:01,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:01,183 INFO L225 Difference]: With dead ends: 442 [2024-10-11 03:48:01,183 INFO L226 Difference]: Without dead ends: 376 [2024-10-11 03:48:01,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:48:01,185 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 1283 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:01,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1283 Valid, 772 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:48:01,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-10-11 03:48:01,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 244. [2024-10-11 03:48:01,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 233 states have (on average 1.3175965665236051) internal successors, (307), 243 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:01,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 307 transitions. [2024-10-11 03:48:01,191 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 307 transitions. Word has length 60 [2024-10-11 03:48:01,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:01,191 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 307 transitions. [2024-10-11 03:48:01,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:01,192 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 307 transitions. [2024-10-11 03:48:01,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 03:48:01,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:01,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] [2024-10-11 03:48:01,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:48:01,193 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:01,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:01,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1579426260, now seen corresponding path program 1 times [2024-10-11 03:48:01,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:01,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427001477] [2024-10-11 03:48:01,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:01,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:01,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:01,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:01,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427001477] [2024-10-11 03:48:01,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427001477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:01,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:01,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:48:01,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048651934] [2024-10-11 03:48:01,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:01,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:48:01,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:01,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:48:01,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:48:01,517 INFO L87 Difference]: Start difference. First operand 244 states and 307 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:02,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:02,026 INFO L93 Difference]: Finished difference Result 468 states and 607 transitions. [2024-10-11 03:48:02,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:48:02,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-10-11 03:48:02,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:02,028 INFO L225 Difference]: With dead ends: 468 [2024-10-11 03:48:02,028 INFO L226 Difference]: Without dead ends: 380 [2024-10-11 03:48:02,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:48:02,029 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 1289 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:02,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 778 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:48:02,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-10-11 03:48:02,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 244. [2024-10-11 03:48:02,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 233 states have (on average 1.3133047210300428) internal successors, (306), 243 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:02,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 306 transitions. [2024-10-11 03:48:02,036 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 306 transitions. Word has length 60 [2024-10-11 03:48:02,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:02,036 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 306 transitions. [2024-10-11 03:48:02,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:02,036 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 306 transitions. [2024-10-11 03:48:02,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 03:48:02,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:02,037 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] [2024-10-11 03:48:02,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:48:02,038 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:02,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:02,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1013492058, now seen corresponding path program 1 times [2024-10-11 03:48:02,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:02,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370584926] [2024-10-11 03:48:02,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:02,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:02,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-10-11 03:48:02,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:02,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370584926] [2024-10-11 03:48:02,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370584926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:02,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:02,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:48:02,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837362360] [2024-10-11 03:48:02,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:02,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:48:02,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:02,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:48:02,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:48:02,313 INFO L87 Difference]: Start difference. First operand 244 states and 306 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:02,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:02,727 INFO L93 Difference]: Finished difference Result 483 states and 608 transitions. [2024-10-11 03:48:02,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:48:02,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2024-10-11 03:48:02,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:02,729 INFO L225 Difference]: With dead ends: 483 [2024-10-11 03:48:02,730 INFO L226 Difference]: Without dead ends: 350 [2024-10-11 03:48:02,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:48:02,731 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 847 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:02,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 760 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:48:02,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-10-11 03:48:02,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 244. [2024-10-11 03:48:02,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 233 states have (on average 1.3090128755364807) internal successors, (305), 243 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-10-11 03:48:02,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 305 transitions. [2024-10-11 03:48:02,737 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 305 transitions. Word has length 60 [2024-10-11 03:48:02,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:02,737 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 305 transitions. [2024-10-11 03:48:02,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:02,738 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 305 transitions. [2024-10-11 03:48:02,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 03:48:02,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:02,739 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] [2024-10-11 03:48:02,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:48:02,739 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:02,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:02,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1005199851, now seen corresponding path program 1 times [2024-10-11 03:48:02,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:02,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164292897] [2024-10-11 03:48:02,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:02,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:03,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:03,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:03,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164292897] [2024-10-11 03:48:03,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164292897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:03,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:03,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:48:03,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765019498] [2024-10-11 03:48:03,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:03,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:48:03,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:03,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:48:03,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:48:03,022 INFO L87 Difference]: Start difference. First operand 244 states and 305 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:03,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:03,533 INFO L93 Difference]: Finished difference Result 393 states and 496 transitions. [2024-10-11 03:48:03,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:48:03,534 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-11 03:48:03,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:03,536 INFO L225 Difference]: With dead ends: 393 [2024-10-11 03:48:03,536 INFO L226 Difference]: Without dead ends: 376 [2024-10-11 03:48:03,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:48:03,538 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 1186 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:03,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 876 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:48:03,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-10-11 03:48:03,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 244. [2024-10-11 03:48:03,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 233 states have (on average 1.3047210300429184) internal successors, (304), 243 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:03,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 304 transitions. [2024-10-11 03:48:03,544 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 304 transitions. Word has length 62 [2024-10-11 03:48:03,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:03,544 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 304 transitions. [2024-10-11 03:48:03,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:03,545 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 304 transitions. [2024-10-11 03:48:03,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 03:48:03,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:03,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] [2024-10-11 03:48:03,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:48:03,546 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:03,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:03,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1319054290, now seen corresponding path program 1 times [2024-10-11 03:48:03,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:03,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670153456] [2024-10-11 03:48:03,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:03,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:03,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:03,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670153456] [2024-10-11 03:48:03,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670153456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:03,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:03,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:48:03,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914844079] [2024-10-11 03:48:03,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:03,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:48:03,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:03,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:48:03,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:48:03,773 INFO L87 Difference]: Start difference. First operand 244 states and 304 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:04,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:04,225 INFO L93 Difference]: Finished difference Result 373 states and 465 transitions. [2024-10-11 03:48:04,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:48:04,225 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-11 03:48:04,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:04,227 INFO L225 Difference]: With dead ends: 373 [2024-10-11 03:48:04,227 INFO L226 Difference]: Without dead ends: 368 [2024-10-11 03:48:04,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:48:04,228 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1183 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1183 SdHoareTripleChecker+Valid, 825 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:04,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1183 Valid, 825 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:48:04,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-10-11 03:48:04,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 244. [2024-10-11 03:48:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 233 states have (on average 1.3004291845493563) internal successors, (303), 243 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:04,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 303 transitions. [2024-10-11 03:48:04,235 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 303 transitions. Word has length 62 [2024-10-11 03:48:04,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:04,235 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 303 transitions. [2024-10-11 03:48:04,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:04,236 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 303 transitions. [2024-10-11 03:48:04,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 03:48:04,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:04,237 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] [2024-10-11 03:48:04,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:48:04,237 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-10-11 03:48:04,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:04,238 INFO L85 PathProgramCache]: Analyzing trace with hash -806955644, now seen corresponding path program 1 times [2024-10-11 03:48:04,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:04,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518567873] [2024-10-11 03:48:04,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:04,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:04,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:04,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:04,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518567873] [2024-10-11 03:48:04,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518567873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:04,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:04,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:48:04,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423869664] [2024-10-11 03:48:04,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:04,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:48:04,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:04,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:48:04,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:48:04,668 INFO L87 Difference]: Start difference. First operand 244 states and 303 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:05,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:05,432 INFO L93 Difference]: Finished difference Result 528 states and 684 transitions. [2024-10-11 03:48:05,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:48:05,433 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-11 03:48:05,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:05,434 INFO L225 Difference]: With dead ends: 528 [2024-10-11 03:48:05,435 INFO L226 Difference]: Without dead ends: 434 [2024-10-11 03:48:05,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2024-10-11 03:48:05,436 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 1251 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:05,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 1299 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:48:05,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-10-11 03:48:05,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 244. [2024-10-11 03:48:05,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 233 states have (on average 1.296137339055794) internal successors, (302), 243 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:05,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 302 transitions. [2024-10-11 03:48:05,442 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 302 transitions. Word has length 62 [2024-10-11 03:48:05,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:05,442 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 302 transitions. [2024-10-11 03:48:05,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:05,443 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 302 transitions. [2024-10-11 03:48:05,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 03:48:05,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:05,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] [2024-10-11 03:48:05,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:48:05,444 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:05,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:05,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2033918897, now seen corresponding path program 1 times [2024-10-11 03:48:05,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:05,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745986815] [2024-10-11 03:48:05,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:05,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:05,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:05,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745986815] [2024-10-11 03:48:05,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745986815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:05,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:05,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:48:05,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877604306] [2024-10-11 03:48:05,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:05,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:48:05,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:05,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:48:05,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:48:05,693 INFO L87 Difference]: Start difference. First operand 244 states and 302 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:06,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:06,205 INFO L93 Difference]: Finished difference Result 447 states and 574 transitions. [2024-10-11 03:48:06,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:48:06,206 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-11 03:48:06,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:06,207 INFO L225 Difference]: With dead ends: 447 [2024-10-11 03:48:06,207 INFO L226 Difference]: Without dead ends: 376 [2024-10-11 03:48:06,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:48:06,208 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 641 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:06,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 1107 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:48:06,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-10-11 03:48:06,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 244. [2024-10-11 03:48:06,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 233 states have (on average 1.2918454935622317) internal successors, (301), 243 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 301 transitions. [2024-10-11 03:48:06,214 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 301 transitions. Word has length 62 [2024-10-11 03:48:06,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:06,215 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 301 transitions. [2024-10-11 03:48:06,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:06,215 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 301 transitions. [2024-10-11 03:48:06,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 03:48:06,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:06,216 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] [2024-10-11 03:48:06,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:48:06,217 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:06,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:06,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1443459928, now seen corresponding path program 1 times [2024-10-11 03:48:06,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:06,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681185350] [2024-10-11 03:48:06,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:06,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:06,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:06,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:06,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681185350] [2024-10-11 03:48:06,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681185350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:06,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:06,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:48:06,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803241454] [2024-10-11 03:48:06,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:06,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:48:06,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:06,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:48:06,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:48:06,451 INFO L87 Difference]: Start difference. First operand 244 states and 301 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:06,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:06,895 INFO L93 Difference]: Finished difference Result 427 states and 543 transitions. [2024-10-11 03:48:06,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:48:06,896 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-11 03:48:06,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:06,898 INFO L225 Difference]: With dead ends: 427 [2024-10-11 03:48:06,898 INFO L226 Difference]: Without dead ends: 368 [2024-10-11 03:48:06,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:48:06,900 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 640 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:06,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 993 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:48:06,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-10-11 03:48:06,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 244. [2024-10-11 03:48:06,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 233 states have (on average 1.2875536480686696) internal successors, (300), 243 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:06,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 300 transitions. [2024-10-11 03:48:06,907 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 300 transitions. Word has length 62 [2024-10-11 03:48:06,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:06,908 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 300 transitions. [2024-10-11 03:48:06,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:06,908 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 300 transitions. [2024-10-11 03:48:06,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 03:48:06,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:06,909 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] [2024-10-11 03:48:06,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:48:06,909 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:06,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:06,910 INFO L85 PathProgramCache]: Analyzing trace with hash 823720425, now seen corresponding path program 1 times [2024-10-11 03:48:06,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:06,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184038553] [2024-10-11 03:48:06,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:06,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:07,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:07,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:07,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184038553] [2024-10-11 03:48:07,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184038553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:07,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:07,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:48:07,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206946360] [2024-10-11 03:48:07,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:07,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:48:07,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:07,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:48:07,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:48:07,153 INFO L87 Difference]: Start difference. First operand 244 states and 300 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:07,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:07,556 INFO L93 Difference]: Finished difference Result 373 states and 461 transitions. [2024-10-11 03:48:07,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:48:07,557 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-11 03:48:07,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:07,558 INFO L225 Difference]: With dead ends: 373 [2024-10-11 03:48:07,558 INFO L226 Difference]: Without dead ends: 368 [2024-10-11 03:48:07,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-11 03:48:07,559 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 638 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:07,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 1070 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:48:07,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-10-11 03:48:07,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 244. [2024-10-11 03:48:07,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 233 states have (on average 1.2832618025751072) internal successors, (299), 243 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:07,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 299 transitions. [2024-10-11 03:48:07,564 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 299 transitions. Word has length 62 [2024-10-11 03:48:07,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:07,565 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 299 transitions. [2024-10-11 03:48:07,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:07,565 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 299 transitions. [2024-10-11 03:48:07,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-11 03:48:07,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:07,566 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] [2024-10-11 03:48:07,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:48:07,566 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:07,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:07,567 INFO L85 PathProgramCache]: Analyzing trace with hash 2020699465, now seen corresponding path program 1 times [2024-10-11 03:48:07,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:07,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987365935] [2024-10-11 03:48:07,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:07,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:07,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:07,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987365935] [2024-10-11 03:48:07,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987365935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:07,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:07,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:48:07,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979419190] [2024-10-11 03:48:07,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:07,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:48:07,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:07,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:48:07,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:48:07,804 INFO L87 Difference]: Start difference. First operand 244 states and 299 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:08,275 INFO L93 Difference]: Finished difference Result 424 states and 537 transitions. [2024-10-11 03:48:08,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:48:08,276 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-11 03:48:08,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:08,277 INFO L225 Difference]: With dead ends: 424 [2024-10-11 03:48:08,277 INFO L226 Difference]: Without dead ends: 368 [2024-10-11 03:48:08,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:48:08,278 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 1130 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 877 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:08,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 877 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 03:48:08,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-10-11 03:48:08,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 244. [2024-10-11 03:48:08,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 233 states have (on average 1.2789699570815452) internal successors, (298), 243 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:08,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 298 transitions. [2024-10-11 03:48:08,284 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 298 transitions. Word has length 62 [2024-10-11 03:48:08,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:08,284 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 298 transitions. [2024-10-11 03:48:08,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:08,285 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 298 transitions. [2024-10-11 03:48:08,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 03:48:08,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:08,286 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-10-11 03:48:08,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:48:08,286 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:08,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:08,286 INFO L85 PathProgramCache]: Analyzing trace with hash -29192250, now seen corresponding path program 1 times [2024-10-11 03:48:08,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:08,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267893650] [2024-10-11 03:48:08,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:08,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:08,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:08,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:08,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267893650] [2024-10-11 03:48:08,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267893650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:08,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:08,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 03:48:08,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648078768] [2024-10-11 03:48:08,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:08,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:48:08,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:08,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:48:08,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:48:08,900 INFO L87 Difference]: Start difference. First operand 244 states and 298 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 12 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-10-11 03:48:09,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:09,701 INFO L93 Difference]: Finished difference Result 551 states and 682 transitions. [2024-10-11 03:48:09,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:48:09,702 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 12 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-10-11 03:48:09,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:09,704 INFO L225 Difference]: With dead ends: 551 [2024-10-11 03:48:09,704 INFO L226 Difference]: Without dead ends: 547 [2024-10-11 03:48:09,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:48:09,706 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 1817 mSDsluCounter, 1920 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1817 SdHoareTripleChecker+Valid, 2203 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:09,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1817 Valid, 2203 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:48:09,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-10-11 03:48:09,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 240. [2024-10-11 03:48:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 230 states have (on average 1.2782608695652173) internal successors, (294), 239 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:09,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 294 transitions. [2024-10-11 03:48:09,713 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 294 transitions. Word has length 64 [2024-10-11 03:48:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:09,714 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 294 transitions. [2024-10-11 03:48:09,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 12 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-10-11 03:48:09,714 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 294 transitions. [2024-10-11 03:48:09,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 03:48:09,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:09,715 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-10-11 03:48:09,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:48:09,715 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:09,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:09,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2063869805, now seen corresponding path program 1 times [2024-10-11 03:48:09,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:09,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821823476] [2024-10-11 03:48:09,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:09,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:10,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:10,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:10,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821823476] [2024-10-11 03:48:10,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821823476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:10,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:10,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 03:48:10,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569134701] [2024-10-11 03:48:10,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:10,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:48:10,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:10,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:48:10,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:48:10,246 INFO L87 Difference]: Start difference. First operand 240 states and 294 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 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-10-11 03:48:10,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:10,780 INFO L93 Difference]: Finished difference Result 395 states and 510 transitions. [2024-10-11 03:48:10,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:48:10,781 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 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-10-11 03:48:10,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:10,782 INFO L225 Difference]: With dead ends: 395 [2024-10-11 03:48:10,782 INFO L226 Difference]: Without dead ends: 312 [2024-10-11 03:48:10,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:48:10,783 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 1038 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1957 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:10,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 1957 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:48:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-11 03:48:10,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 211. [2024-10-11 03:48:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 203 states have (on average 1.2807881773399015) internal successors, (260), 210 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:10,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 260 transitions. [2024-10-11 03:48:10,788 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 260 transitions. Word has length 64 [2024-10-11 03:48:10,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:10,788 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 260 transitions. [2024-10-11 03:48:10,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 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-10-11 03:48:10,788 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 260 transitions. [2024-10-11 03:48:10,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 03:48:10,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:10,789 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-10-11 03:48:10,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:48:10,790 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:10,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:10,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1085248927, now seen corresponding path program 1 times [2024-10-11 03:48:10,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:10,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783471597] [2024-10-11 03:48:10,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:10,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:11,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:11,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783471597] [2024-10-11 03:48:11,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783471597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:11,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:11,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 03:48:11,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36670858] [2024-10-11 03:48:11,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:11,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:48:11,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:11,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:48:11,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:48:11,392 INFO L87 Difference]: Start difference. First operand 211 states and 260 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 12 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-10-11 03:48:12,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:12,111 INFO L93 Difference]: Finished difference Result 536 states and 689 transitions. [2024-10-11 03:48:12,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:48:12,112 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 12 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-10-11 03:48:12,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:12,113 INFO L225 Difference]: With dead ends: 536 [2024-10-11 03:48:12,113 INFO L226 Difference]: Without dead ends: 478 [2024-10-11 03:48:12,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:48:12,114 INFO L432 NwaCegarLoop]: 300 mSDtfsCounter, 1701 mSDsluCounter, 1661 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1701 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:12,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1701 Valid, 1961 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:48:12,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-10-11 03:48:12,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 207. [2024-10-11 03:48:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 200 states have (on average 1.275) internal successors, (255), 206 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:12,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 255 transitions. [2024-10-11 03:48:12,120 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 255 transitions. Word has length 64 [2024-10-11 03:48:12,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:12,120 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 255 transitions. [2024-10-11 03:48:12,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 12 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-10-11 03:48:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 255 transitions. [2024-10-11 03:48:12,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 03:48:12,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:12,121 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-10-11 03:48:12,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:48:12,122 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:12,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:12,122 INFO L85 PathProgramCache]: Analyzing trace with hash 632833740, now seen corresponding path program 1 times [2024-10-11 03:48:12,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:12,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408711231] [2024-10-11 03:48:12,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:12,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:12,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:12,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408711231] [2024-10-11 03:48:12,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408711231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:12,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:12,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:48:12,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739370056] [2024-10-11 03:48:12,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:12,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:48:12,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:12,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:48:12,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:48:12,527 INFO L87 Difference]: Start difference. First operand 207 states and 255 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 9 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-10-11 03:48:12,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:12,817 INFO L93 Difference]: Finished difference Result 330 states and 429 transitions. [2024-10-11 03:48:12,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 03:48:12,818 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 9 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-10-11 03:48:12,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:12,819 INFO L225 Difference]: With dead ends: 330 [2024-10-11 03:48:12,819 INFO L226 Difference]: Without dead ends: 213 [2024-10-11 03:48:12,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2024-10-11 03:48:12,820 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 897 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:12,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 756 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:48:12,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-11 03:48:12,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 144. [2024-10-11 03:48:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 141 states have (on average 1.2624113475177305) internal successors, (178), 143 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 178 transitions. [2024-10-11 03:48:12,823 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 178 transitions. Word has length 64 [2024-10-11 03:48:12,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:12,823 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 178 transitions. [2024-10-11 03:48:12,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 9 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-10-11 03:48:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 178 transitions. [2024-10-11 03:48:12,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 03:48:12,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:12,824 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-10-11 03:48:12,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:48:12,825 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:12,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:12,825 INFO L85 PathProgramCache]: Analyzing trace with hash -547497208, now seen corresponding path program 1 times [2024-10-11 03:48:12,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:12,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888857324] [2024-10-11 03:48:12,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:12,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:13,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:13,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:13,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888857324] [2024-10-11 03:48:13,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888857324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:13,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:13,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:48:13,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741124104] [2024-10-11 03:48:13,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:13,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:48:13,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:13,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:48:13,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:48:13,060 INFO L87 Difference]: Start difference. First operand 144 states and 178 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 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-10-11 03:48:13,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:13,349 INFO L93 Difference]: Finished difference Result 226 states and 287 transitions. [2024-10-11 03:48:13,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:48:13,349 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 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-10-11 03:48:13,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:13,350 INFO L225 Difference]: With dead ends: 226 [2024-10-11 03:48:13,350 INFO L226 Difference]: Without dead ends: 219 [2024-10-11 03:48:13,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:48:13,351 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 734 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:13,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 443 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:48:13,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-11 03:48:13,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 144. [2024-10-11 03:48:13,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 141 states have (on average 1.2553191489361701) internal successors, (177), 143 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:13,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 177 transitions. [2024-10-11 03:48:13,356 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 177 transitions. Word has length 65 [2024-10-11 03:48:13,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:13,356 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 177 transitions. [2024-10-11 03:48:13,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 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-10-11 03:48:13,356 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 177 transitions. [2024-10-11 03:48:13,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 03:48:13,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:13,357 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-10-11 03:48:13,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:48:13,357 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:13,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:13,358 INFO L85 PathProgramCache]: Analyzing trace with hash 2125205281, now seen corresponding path program 1 times [2024-10-11 03:48:13,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:13,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011155670] [2024-10-11 03:48:13,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:13,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:13,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:13,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011155670] [2024-10-11 03:48:13,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011155670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:13,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:13,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:48:13,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604347032] [2024-10-11 03:48:13,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:13,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:48:13,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:13,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:48:13,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:48:13,725 INFO L87 Difference]: Start difference. First operand 144 states and 177 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 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-10-11 03:48:14,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:14,470 INFO L93 Difference]: Finished difference Result 491 states and 667 transitions. [2024-10-11 03:48:14,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:48:14,471 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 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-10-11 03:48:14,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:14,472 INFO L225 Difference]: With dead ends: 491 [2024-10-11 03:48:14,472 INFO L226 Difference]: Without dead ends: 419 [2024-10-11 03:48:14,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:48:14,474 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 1574 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1574 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:14,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1574 Valid, 928 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:48:14,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-11 03:48:14,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 148. [2024-10-11 03:48:14,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 145 states have (on average 1.2482758620689656) internal successors, (181), 147 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:14,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 181 transitions. [2024-10-11 03:48:14,482 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 181 transitions. Word has length 65 [2024-10-11 03:48:14,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:14,482 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 181 transitions. [2024-10-11 03:48:14,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 10 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-10-11 03:48:14,482 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 181 transitions. [2024-10-11 03:48:14,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 03:48:14,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:14,483 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-10-11 03:48:14,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:48:14,484 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:14,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:14,484 INFO L85 PathProgramCache]: Analyzing trace with hash 256967796, now seen corresponding path program 1 times [2024-10-11 03:48:14,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:14,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912489373] [2024-10-11 03:48:14,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:14,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:14,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:14,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912489373] [2024-10-11 03:48:14,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912489373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:14,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:14,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:48:14,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549793442] [2024-10-11 03:48:14,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:14,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:48:14,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:14,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:48:14,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:48:14,685 INFO L87 Difference]: Start difference. First operand 148 states and 181 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 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-10-11 03:48:15,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:15,036 INFO L93 Difference]: Finished difference Result 309 states and 400 transitions. [2024-10-11 03:48:15,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:48:15,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 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-10-11 03:48:15,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:15,038 INFO L225 Difference]: With dead ends: 309 [2024-10-11 03:48:15,038 INFO L226 Difference]: Without dead ends: 237 [2024-10-11 03:48:15,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:48:15,038 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 364 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:15,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 730 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:48:15,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-11 03:48:15,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 144. [2024-10-11 03:48:15,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 141 states have (on average 1.24822695035461) internal successors, (176), 143 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:15,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 176 transitions. [2024-10-11 03:48:15,042 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 176 transitions. Word has length 66 [2024-10-11 03:48:15,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:15,042 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 176 transitions. [2024-10-11 03:48:15,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 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-10-11 03:48:15,043 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 176 transitions. [2024-10-11 03:48:15,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 03:48:15,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:15,043 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-10-11 03:48:15,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:48:15,044 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:15,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:15,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1404417789, now seen corresponding path program 1 times [2024-10-11 03:48:15,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:15,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881582988] [2024-10-11 03:48:15,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:15,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:16,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:16,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:16,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881582988] [2024-10-11 03:48:16,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881582988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:16,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:16,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-10-11 03:48:16,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31512179] [2024-10-11 03:48:16,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:16,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 03:48:16,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:16,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 03:48:16,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2024-10-11 03:48:16,084 INFO L87 Difference]: Start difference. First operand 144 states and 176 transitions. Second operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 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-10-11 03:48:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:17,896 INFO L93 Difference]: Finished difference Result 492 states and 640 transitions. [2024-10-11 03:48:17,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 03:48:17,896 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 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-10-11 03:48:17,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:17,898 INFO L225 Difference]: With dead ends: 492 [2024-10-11 03:48:17,898 INFO L226 Difference]: Without dead ends: 484 [2024-10-11 03:48:17,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=219, Invalid=1263, Unknown=0, NotChecked=0, Total=1482 [2024-10-11 03:48:17,899 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 1305 mSDsluCounter, 5323 mSDsCounter, 0 mSdLazyCounter, 2658 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1305 SdHoareTripleChecker+Valid, 5750 SdHoareTripleChecker+Invalid, 2658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:17,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1305 Valid, 5750 Invalid, 2658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2658 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:48:17,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-10-11 03:48:17,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 158. [2024-10-11 03:48:17,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 155 states have (on average 1.2451612903225806) internal successors, (193), 157 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 193 transitions. [2024-10-11 03:48:17,905 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 193 transitions. Word has length 67 [2024-10-11 03:48:17,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:17,905 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 193 transitions. [2024-10-11 03:48:17,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 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-10-11 03:48:17,906 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 193 transitions. [2024-10-11 03:48:17,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 03:48:17,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:17,907 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-10-11 03:48:17,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:48:17,907 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:17,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:17,907 INFO L85 PathProgramCache]: Analyzing trace with hash 846749532, now seen corresponding path program 1 times [2024-10-11 03:48:17,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:17,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223131053] [2024-10-11 03:48:17,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:17,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:18,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:18,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:18,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223131053] [2024-10-11 03:48:18,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223131053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:18,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:18,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-10-11 03:48:19,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725114003] [2024-10-11 03:48:19,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:19,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 03:48:19,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:19,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 03:48:19,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:48:19,001 INFO L87 Difference]: Start difference. First operand 158 states and 193 transitions. Second operand has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 22 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-10-11 03:48:20,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:20,765 INFO L93 Difference]: Finished difference Result 495 states and 645 transitions. [2024-10-11 03:48:20,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 03:48:20,766 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 22 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-10-11 03:48:20,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:20,768 INFO L225 Difference]: With dead ends: 495 [2024-10-11 03:48:20,768 INFO L226 Difference]: Without dead ends: 489 [2024-10-11 03:48:20,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=266, Invalid=1294, Unknown=0, NotChecked=0, Total=1560 [2024-10-11 03:48:20,769 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 1110 mSDsluCounter, 4190 mSDsCounter, 0 mSdLazyCounter, 2221 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 4608 SdHoareTripleChecker+Invalid, 2223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:20,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 4608 Invalid, 2223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2221 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:48:20,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-10-11 03:48:20,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 164. [2024-10-11 03:48:20,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 161 states have (on average 1.2484472049689441) internal successors, (201), 163 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:20,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 201 transitions. [2024-10-11 03:48:20,774 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 201 transitions. Word has length 67 [2024-10-11 03:48:20,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:20,774 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 201 transitions. [2024-10-11 03:48:20,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 22 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-10-11 03:48:20,774 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 201 transitions. [2024-10-11 03:48:20,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 03:48:20,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:20,775 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-10-11 03:48:20,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:48:20,775 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:20,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:20,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1484311146, now seen corresponding path program 1 times [2024-10-11 03:48:20,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:20,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38702553] [2024-10-11 03:48:20,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:20,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:21,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:21,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:21,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38702553] [2024-10-11 03:48:21,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38702553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:21,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:21,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 03:48:21,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044893028] [2024-10-11 03:48:21,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:21,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:48:21,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:21,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:48:21,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:48:21,212 INFO L87 Difference]: Start difference. First operand 164 states and 201 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 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-10-11 03:48:21,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:21,682 INFO L93 Difference]: Finished difference Result 243 states and 310 transitions. [2024-10-11 03:48:21,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:48:21,682 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 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-10-11 03:48:21,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:21,683 INFO L225 Difference]: With dead ends: 243 [2024-10-11 03:48:21,683 INFO L226 Difference]: Without dead ends: 228 [2024-10-11 03:48:21,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:48:21,685 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 560 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:21,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 1344 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:48:21,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-11 03:48:21,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 148. [2024-10-11 03:48:21,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 146 states have (on average 1.2534246575342465) internal successors, (183), 147 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:21,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 183 transitions. [2024-10-11 03:48:21,689 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 183 transitions. Word has length 68 [2024-10-11 03:48:21,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:21,690 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 183 transitions. [2024-10-11 03:48:21,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 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-10-11 03:48:21,690 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 183 transitions. [2024-10-11 03:48:21,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 03:48:21,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:21,691 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-10-11 03:48:21,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:48:21,691 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:21,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:21,691 INFO L85 PathProgramCache]: Analyzing trace with hash 766856175, now seen corresponding path program 1 times [2024-10-11 03:48:21,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:21,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049480450] [2024-10-11 03:48:21,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:21,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:22,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:22,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049480450] [2024-10-11 03:48:22,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049480450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:22,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:22,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 03:48:22,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354637127] [2024-10-11 03:48:22,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:22,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 03:48:22,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:22,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 03:48:22,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 03:48:22,237 INFO L87 Difference]: Start difference. First operand 148 states and 183 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) 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-10-11 03:48:23,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:23,021 INFO L93 Difference]: Finished difference Result 337 states and 453 transitions. [2024-10-11 03:48:23,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 03:48:23,022 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) 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-10-11 03:48:23,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:23,024 INFO L225 Difference]: With dead ends: 337 [2024-10-11 03:48:23,024 INFO L226 Difference]: Without dead ends: 331 [2024-10-11 03:48:23,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:48:23,025 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 984 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:23,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 1708 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:48:23,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-10-11 03:48:23,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 126. [2024-10-11 03:48:23,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.256) internal successors, (157), 125 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:23,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 157 transitions. [2024-10-11 03:48:23,029 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 157 transitions. Word has length 68 [2024-10-11 03:48:23,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:23,029 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 157 transitions. [2024-10-11 03:48:23,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) 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-10-11 03:48:23,030 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 157 transitions. [2024-10-11 03:48:23,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 03:48:23,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:23,031 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] [2024-10-11 03:48:23,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 03:48:23,031 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:23,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:23,032 INFO L85 PathProgramCache]: Analyzing trace with hash -482876882, now seen corresponding path program 1 times [2024-10-11 03:48:23,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:23,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541188627] [2024-10-11 03:48:23,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:23,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:23,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:23,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541188627] [2024-10-11 03:48:23,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541188627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:23,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:23,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:48:23,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602079803] [2024-10-11 03:48:23,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:23,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:48:23,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:23,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:48:23,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:48:23,138 INFO L87 Difference]: Start difference. First operand 126 states and 157 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:23,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:23,250 INFO L93 Difference]: Finished difference Result 558 states and 797 transitions. [2024-10-11 03:48:23,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 03:48:23,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-10-11 03:48:23,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:23,252 INFO L225 Difference]: With dead ends: 558 [2024-10-11 03:48:23,252 INFO L226 Difference]: Without dead ends: 504 [2024-10-11 03:48:23,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:48:23,253 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 892 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:23,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 947 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:48:23,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-10-11 03:48:23,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 178. [2024-10-11 03:48:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.3220338983050848) internal successors, (234), 177 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:23,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 234 transitions. [2024-10-11 03:48:23,261 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 234 transitions. Word has length 90 [2024-10-11 03:48:23,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:23,262 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 234 transitions. [2024-10-11 03:48:23,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:23,262 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 234 transitions. [2024-10-11 03:48:23,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:48:23,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:23,263 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] [2024-10-11 03:48:23,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 03:48:23,263 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:23,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:23,263 INFO L85 PathProgramCache]: Analyzing trace with hash 736076837, now seen corresponding path program 1 times [2024-10-11 03:48:23,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:23,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825883554] [2024-10-11 03:48:23,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:23,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:23,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:23,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:23,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825883554] [2024-10-11 03:48:23,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825883554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:23,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:23,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:48:23,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464917599] [2024-10-11 03:48:23,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:23,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:48:23,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:23,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:48:23,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:48:23,375 INFO L87 Difference]: Start difference. First operand 178 states and 234 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:23,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:23,452 INFO L93 Difference]: Finished difference Result 656 states and 940 transitions. [2024-10-11 03:48:23,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:48:23,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:48:23,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:23,454 INFO L225 Difference]: With dead ends: 656 [2024-10-11 03:48:23,454 INFO L226 Difference]: Without dead ends: 550 [2024-10-11 03:48:23,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:48:23,455 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 645 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:23,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 658 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:48:23,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-10-11 03:48:23,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 282. [2024-10-11 03:48:23,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.3843416370106763) internal successors, (389), 281 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:23,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 389 transitions. [2024-10-11 03:48:23,463 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 389 transitions. Word has length 92 [2024-10-11 03:48:23,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:23,464 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 389 transitions. [2024-10-11 03:48:23,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:23,464 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 389 transitions. [2024-10-11 03:48:23,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:48:23,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:23,465 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] [2024-10-11 03:48:23,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 03:48:23,465 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:23,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:23,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1778526310, now seen corresponding path program 1 times [2024-10-11 03:48:23,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:23,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896423215] [2024-10-11 03:48:23,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:23,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:23,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:23,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:23,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896423215] [2024-10-11 03:48:23,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896423215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:23,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:23,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:48:23,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131099019] [2024-10-11 03:48:23,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:23,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:48:23,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:23,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:48:23,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:48:23,655 INFO L87 Difference]: Start difference. First operand 282 states and 389 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:23,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:23,762 INFO L93 Difference]: Finished difference Result 494 states and 702 transitions. [2024-10-11 03:48:23,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:48:23,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:48:23,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:23,764 INFO L225 Difference]: With dead ends: 494 [2024-10-11 03:48:23,764 INFO L226 Difference]: Without dead ends: 284 [2024-10-11 03:48:23,765 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-10-11 03:48:23,765 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 75 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:23,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 452 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:48:23,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-11 03:48:23,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2024-10-11 03:48:23,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.3772241992882561) internal successors, (387), 281 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:23,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 387 transitions. [2024-10-11 03:48:23,770 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 387 transitions. Word has length 92 [2024-10-11 03:48:23,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:23,770 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 387 transitions. [2024-10-11 03:48:23,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:23,771 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 387 transitions. [2024-10-11 03:48:23,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:48:23,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:23,772 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] [2024-10-11 03:48:23,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 03:48:23,772 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:23,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:23,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1712032798, now seen corresponding path program 1 times [2024-10-11 03:48:23,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:23,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078968080] [2024-10-11 03:48:23,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:23,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:23,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:23,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:23,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078968080] [2024-10-11 03:48:23,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078968080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:23,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:23,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:48:23,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728896923] [2024-10-11 03:48:23,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:23,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:48:23,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:23,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:48:23,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:48:23,834 INFO L87 Difference]: Start difference. First operand 282 states and 387 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:23,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:23,862 INFO L93 Difference]: Finished difference Result 676 states and 963 transitions. [2024-10-11 03:48:23,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:48:23,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:48:23,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:23,864 INFO L225 Difference]: With dead ends: 676 [2024-10-11 03:48:23,864 INFO L226 Difference]: Without dead ends: 466 [2024-10-11 03:48:23,865 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-10-11 03:48:23,865 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 88 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:23,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 248 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:48:23,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-10-11 03:48:23,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 460. [2024-10-11 03:48:23,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 1.3899782135076253) internal successors, (638), 459 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:23,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 638 transitions. [2024-10-11 03:48:23,873 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 638 transitions. Word has length 92 [2024-10-11 03:48:23,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:23,874 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 638 transitions. [2024-10-11 03:48:23,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:23,874 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 638 transitions. [2024-10-11 03:48:23,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:48:23,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:23,875 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] [2024-10-11 03:48:23,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 03:48:23,875 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:23,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:23,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1503158235, now seen corresponding path program 1 times [2024-10-11 03:48:23,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:23,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631840594] [2024-10-11 03:48:23,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:23,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:23,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:23,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:23,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631840594] [2024-10-11 03:48:23,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631840594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:23,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:23,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:48:23,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278660865] [2024-10-11 03:48:23,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:23,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:48:23,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:23,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:48:23,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:48:23,988 INFO L87 Difference]: Start difference. First operand 460 states and 638 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:24,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:24,066 INFO L93 Difference]: Finished difference Result 1339 states and 1906 transitions. [2024-10-11 03:48:24,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:48:24,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:48:24,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:24,069 INFO L225 Difference]: With dead ends: 1339 [2024-10-11 03:48:24,070 INFO L226 Difference]: Without dead ends: 1144 [2024-10-11 03:48:24,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:48:24,072 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 612 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:24,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 672 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:48:24,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2024-10-11 03:48:24,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 750. [2024-10-11 03:48:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 749 states have (on average 1.4098798397863819) internal successors, (1056), 749 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:24,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1056 transitions. [2024-10-11 03:48:24,084 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1056 transitions. Word has length 92 [2024-10-11 03:48:24,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:24,084 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 1056 transitions. [2024-10-11 03:48:24,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:24,085 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1056 transitions. [2024-10-11 03:48:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:48:24,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:24,086 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] [2024-10-11 03:48:24,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 03:48:24,086 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:24,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:24,087 INFO L85 PathProgramCache]: Analyzing trace with hash 371991077, now seen corresponding path program 1 times [2024-10-11 03:48:24,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:24,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196937548] [2024-10-11 03:48:24,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:24,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:24,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:24,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:24,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196937548] [2024-10-11 03:48:24,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196937548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:24,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:24,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:48:24,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807682073] [2024-10-11 03:48:24,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:24,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:48:24,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:24,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:48:24,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:48:24,202 INFO L87 Difference]: Start difference. First operand 750 states and 1056 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:24,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:24,294 INFO L93 Difference]: Finished difference Result 1532 states and 2185 transitions. [2024-10-11 03:48:24,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:48:24,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-11 03:48:24,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:24,298 INFO L225 Difference]: With dead ends: 1532 [2024-10-11 03:48:24,299 INFO L226 Difference]: Without dead ends: 1337 [2024-10-11 03:48:24,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:48:24,300 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 579 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:24,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 737 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:48:24,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2024-10-11 03:48:24,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 943. [2024-10-11 03:48:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 942 states have (on average 1.4171974522292994) internal successors, (1335), 942 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:24,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1335 transitions. [2024-10-11 03:48:24,316 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1335 transitions. Word has length 92 [2024-10-11 03:48:24,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:24,317 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1335 transitions. [2024-10-11 03:48:24,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:24,317 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1335 transitions. [2024-10-11 03:48:24,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 03:48:24,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:24,318 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] [2024-10-11 03:48:24,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 03:48:24,319 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-11 03:48:24,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:24,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1145576757, now seen corresponding path program 1 times [2024-10-11 03:48:24,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:24,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682258694] [2024-10-11 03:48:24,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:24,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:24,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:24,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:24,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682258694] [2024-10-11 03:48:24,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682258694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:24,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:24,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:48:24,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163859108] [2024-10-11 03:48:24,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:24,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:48:24,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:24,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:48:24,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:48:24,422 INFO L87 Difference]: Start difference. First operand 943 states and 1335 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:24,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:24,443 INFO L93 Difference]: Finished difference Result 2613 states and 3725 transitions. [2024-10-11 03:48:24,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:48:24,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-10-11 03:48:24,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:24,448 INFO L225 Difference]: With dead ends: 2613 [2024-10-11 03:48:24,449 INFO L226 Difference]: Without dead ends: 1742 [2024-10-11 03:48:24,451 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-10-11 03:48:24,451 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 72 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:24,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 329 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:48:24,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2024-10-11 03:48:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1668. [2024-10-11 03:48:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1667 states have (on average 1.414517096580684) internal successors, (2358), 1667 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:24,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2358 transitions. [2024-10-11 03:48:24,477 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2358 transitions. Word has length 93 [2024-10-11 03:48:24,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:24,478 INFO L471 AbstractCegarLoop]: Abstraction has 1668 states and 2358 transitions. [2024-10-11 03:48:24,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:24,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2358 transitions. [2024-10-11 03:48:24,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:48:24,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:24,479 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] [2024-10-11 03:48:24,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 03:48:24,480 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-10-11 03:48:24,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:24,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1230483478, now seen corresponding path program 1 times [2024-10-11 03:48:24,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:24,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35100058] [2024-10-11 03:48:24,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:24,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:24,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:24,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:24,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35100058] [2024-10-11 03:48:24,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35100058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:24,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:24,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:48:24,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214730209] [2024-10-11 03:48:24,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:24,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:48:24,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:24,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:48:24,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:48:24,593 INFO L87 Difference]: Start difference. First operand 1668 states and 2358 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:24,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:24,618 INFO L93 Difference]: Finished difference Result 4716 states and 6668 transitions. [2024-10-11 03:48:24,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:48:24,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:48:24,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:24,628 INFO L225 Difference]: With dead ends: 4716 [2024-10-11 03:48:24,629 INFO L226 Difference]: Without dead ends: 3120 [2024-10-11 03:48:24,632 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-10-11 03:48:24,632 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 65 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:24,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 329 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:48:24,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2024-10-11 03:48:24,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2974. [2024-10-11 03:48:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2974 states, 2973 states have (on average 1.4026236125126135) internal successors, (4170), 2973 states have internal predecessors, (4170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:24,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 4170 transitions. [2024-10-11 03:48:24,676 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 4170 transitions. Word has length 94 [2024-10-11 03:48:24,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:24,677 INFO L471 AbstractCegarLoop]: Abstraction has 2974 states and 4170 transitions. [2024-10-11 03:48:24,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:24,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 4170 transitions. [2024-10-11 03:48:24,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:48:24,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:24,678 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-10-11 03:48:24,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 03:48:24,679 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-10-11 03:48:24,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:24,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1771587671, now seen corresponding path program 1 times [2024-10-11 03:48:24,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:24,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89235762] [2024-10-11 03:48:24,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:24,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:24,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:24,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:24,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89235762] [2024-10-11 03:48:24,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89235762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:24,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:24,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:48:24,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911210678] [2024-10-11 03:48:24,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:24,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:48:24,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:24,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:48:24,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:48:24,788 INFO L87 Difference]: Start difference. First operand 2974 states and 4170 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:24,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:24,826 INFO L93 Difference]: Finished difference Result 8490 states and 11852 transitions. [2024-10-11 03:48:24,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:48:24,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-10-11 03:48:24,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:24,843 INFO L225 Difference]: With dead ends: 8490 [2024-10-11 03:48:24,843 INFO L226 Difference]: Without dead ends: 5588 [2024-10-11 03:48:24,848 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-10-11 03:48:24,849 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 55 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:24,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 329 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:48:24,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5588 states. [2024-10-11 03:48:24,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5588 to 5298. [2024-10-11 03:48:24,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5298 states, 5297 states have (on average 1.3830470077402304) internal successors, (7326), 5297 states have internal predecessors, (7326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:24,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5298 states to 5298 states and 7326 transitions. [2024-10-11 03:48:24,940 INFO L78 Accepts]: Start accepts. Automaton has 5298 states and 7326 transitions. Word has length 95 [2024-10-11 03:48:24,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:24,940 INFO L471 AbstractCegarLoop]: Abstraction has 5298 states and 7326 transitions. [2024-10-11 03:48:24,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:24,941 INFO L276 IsEmpty]: Start isEmpty. Operand 5298 states and 7326 transitions. [2024-10-11 03:48:24,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:48:24,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:24,942 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] [2024-10-11 03:48:24,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 03:48:24,942 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-10-11 03:48:24,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:24,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1383443042, now seen corresponding path program 1 times [2024-10-11 03:48:24,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:24,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709645548] [2024-10-11 03:48:24,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:24,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:25,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:25,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:25,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709645548] [2024-10-11 03:48:25,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709645548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:25,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:25,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:48:25,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541290516] [2024-10-11 03:48:25,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:25,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:48:25,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:25,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:48:25,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:48:25,240 INFO L87 Difference]: Start difference. First operand 5298 states and 7326 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:25,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:25,604 INFO L93 Difference]: Finished difference Result 15913 states and 21989 transitions. [2024-10-11 03:48:25,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:48:25,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-11 03:48:25,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:25,637 INFO L225 Difference]: With dead ends: 15913 [2024-10-11 03:48:25,641 INFO L226 Difference]: Without dead ends: 10681 [2024-10-11 03:48:25,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:48:25,694 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 320 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:25,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 589 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 03:48:25,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10681 states. [2024-10-11 03:48:25,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10681 to 5298. [2024-10-11 03:48:25,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5298 states, 5297 states have (on average 1.3828582216348877) internal successors, (7325), 5297 states have internal predecessors, (7325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:25,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5298 states to 5298 states and 7325 transitions. [2024-10-11 03:48:25,790 INFO L78 Accepts]: Start accepts. Automaton has 5298 states and 7325 transitions. Word has length 96 [2024-10-11 03:48:25,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:25,790 INFO L471 AbstractCegarLoop]: Abstraction has 5298 states and 7325 transitions. [2024-10-11 03:48:25,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:25,791 INFO L276 IsEmpty]: Start isEmpty. Operand 5298 states and 7325 transitions. [2024-10-11 03:48:25,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 03:48:25,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:25,792 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-10-11 03:48:25,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 03:48:25,792 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-10-11 03:48:25,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:25,793 INFO L85 PathProgramCache]: Analyzing trace with hash -246828035, now seen corresponding path program 1 times [2024-10-11 03:48:25,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:25,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870049349] [2024-10-11 03:48:25,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:25,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:26,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:26,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870049349] [2024-10-11 03:48:26,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870049349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:26,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:26,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:48:26,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813201958] [2024-10-11 03:48:26,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:26,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:48:26,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:26,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:48:26,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:48:26,065 INFO L87 Difference]: Start difference. First operand 5298 states and 7325 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-10-11 03:48:26,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:26,104 INFO L93 Difference]: Finished difference Result 5492 states and 7582 transitions. [2024-10-11 03:48:26,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:48:26,105 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-10-11 03:48:26,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:26,114 INFO L225 Difference]: With dead ends: 5492 [2024-10-11 03:48:26,115 INFO L226 Difference]: Without dead ends: 5490 [2024-10-11 03:48:26,117 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-10-11 03:48:26,118 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:26,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 747 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:48:26,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5490 states. [2024-10-11 03:48:26,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5490 to 5490. [2024-10-11 03:48:26,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5490 states, 5489 states have (on average 1.3621789032610676) internal successors, (7477), 5489 states have internal predecessors, (7477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5490 states to 5490 states and 7477 transitions. [2024-10-11 03:48:26,186 INFO L78 Accepts]: Start accepts. Automaton has 5490 states and 7477 transitions. Word has length 98 [2024-10-11 03:48:26,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:26,187 INFO L471 AbstractCegarLoop]: Abstraction has 5490 states and 7477 transitions. [2024-10-11 03:48:26,187 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-10-11 03:48:26,187 INFO L276 IsEmpty]: Start isEmpty. Operand 5490 states and 7477 transitions. [2024-10-11 03:48:26,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 03:48:26,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:26,188 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-10-11 03:48:26,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 03:48:26,188 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-10-11 03:48:26,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:26,189 INFO L85 PathProgramCache]: Analyzing trace with hash -98576331, now seen corresponding path program 1 times [2024-10-11 03:48:26,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:26,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2282245] [2024-10-11 03:48:26,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:26,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:26,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:26,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2282245] [2024-10-11 03:48:26,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2282245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:26,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:26,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:48:26,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452689779] [2024-10-11 03:48:26,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:26,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 03:48:26,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:26,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 03:48:26,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 03:48:26,314 INFO L87 Difference]: Start difference. First operand 5490 states and 7477 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-10-11 03:48:26,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:26,424 INFO L93 Difference]: Finished difference Result 10332 states and 14138 transitions. [2024-10-11 03:48:26,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:48:26,425 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-10-11 03:48:26,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:26,441 INFO L225 Difference]: With dead ends: 10332 [2024-10-11 03:48:26,442 INFO L226 Difference]: Without dead ends: 9122 [2024-10-11 03:48:26,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 03:48:26,446 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 632 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:26,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 746 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:48:26,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9122 states. [2024-10-11 03:48:26,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9122 to 6698. [2024-10-11 03:48:26,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6698 states, 6697 states have (on average 1.362550395699567) internal successors, (9125), 6697 states have internal predecessors, (9125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:26,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6698 states to 6698 states and 9125 transitions. [2024-10-11 03:48:26,553 INFO L78 Accepts]: Start accepts. Automaton has 6698 states and 9125 transitions. Word has length 98 [2024-10-11 03:48:26,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:26,553 INFO L471 AbstractCegarLoop]: Abstraction has 6698 states and 9125 transitions. [2024-10-11 03:48:26,553 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-10-11 03:48:26,554 INFO L276 IsEmpty]: Start isEmpty. Operand 6698 states and 9125 transitions. [2024-10-11 03:48:26,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 03:48:26,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:26,555 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-10-11 03:48:26,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 03:48:26,555 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-10-11 03:48:26,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:26,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1913813716, now seen corresponding path program 1 times [2024-10-11 03:48:26,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:26,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844487149] [2024-10-11 03:48:26,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:26,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:26,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:26,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:26,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844487149] [2024-10-11 03:48:26,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844487149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:26,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:26,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:48:26,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463338088] [2024-10-11 03:48:26,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:26,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:48:26,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:26,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:48:26,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:48:26,660 INFO L87 Difference]: Start difference. First operand 6698 states and 9125 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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-10-11 03:48:26,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:26,711 INFO L93 Difference]: Finished difference Result 17398 states and 23651 transitions. [2024-10-11 03:48:26,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:48:26,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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-10-11 03:48:26,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:26,729 INFO L225 Difference]: With dead ends: 17398 [2024-10-11 03:48:26,730 INFO L226 Difference]: Without dead ends: 10772 [2024-10-11 03:48:26,739 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-10-11 03:48:26,740 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 73 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:26,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 331 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:48:26,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10772 states. [2024-10-11 03:48:26,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10772 to 10066. [2024-10-11 03:48:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10066 states, 10065 states have (on average 1.34575260804769) internal successors, (13545), 10065 states have internal predecessors, (13545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10066 states to 10066 states and 13545 transitions. [2024-10-11 03:48:26,869 INFO L78 Accepts]: Start accepts. Automaton has 10066 states and 13545 transitions. Word has length 99 [2024-10-11 03:48:26,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:26,870 INFO L471 AbstractCegarLoop]: Abstraction has 10066 states and 13545 transitions. [2024-10-11 03:48:26,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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-10-11 03:48:26,870 INFO L276 IsEmpty]: Start isEmpty. Operand 10066 states and 13545 transitions. [2024-10-11 03:48:26,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 03:48:26,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:26,873 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 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] [2024-10-11 03:48:26,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-11 03:48:26,873 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-10-11 03:48:26,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:26,874 INFO L85 PathProgramCache]: Analyzing trace with hash -383146164, now seen corresponding path program 1 times [2024-10-11 03:48:26,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:26,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138868163] [2024-10-11 03:48:26,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:26,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:26,968 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:26,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:26,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138868163] [2024-10-11 03:48:26,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138868163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:48:26,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:48:26,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:48:26,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667202157] [2024-10-11 03:48:26,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:48:26,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:48:26,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:26,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:48:26,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:48:26,970 INFO L87 Difference]: Start difference. First operand 10066 states and 13545 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:27,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:27,071 INFO L93 Difference]: Finished difference Result 20062 states and 27015 transitions. [2024-10-11 03:48:27,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:48:27,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-10-11 03:48:27,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:27,090 INFO L225 Difference]: With dead ends: 20062 [2024-10-11 03:48:27,091 INFO L226 Difference]: Without dead ends: 10068 [2024-10-11 03:48:27,102 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-10-11 03:48:27,103 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 68 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 304 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-10-11 03:48:27,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 304 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:48:27,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10068 states. [2024-10-11 03:48:27,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10068 to 10066. [2024-10-11 03:48:27,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10066 states, 10065 states have (on average 1.328266269249876) internal successors, (13369), 10065 states have internal predecessors, (13369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10066 states to 10066 states and 13369 transitions. [2024-10-11 03:48:27,266 INFO L78 Accepts]: Start accepts. Automaton has 10066 states and 13369 transitions. Word has length 125 [2024-10-11 03:48:27,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:27,267 INFO L471 AbstractCegarLoop]: Abstraction has 10066 states and 13369 transitions. [2024-10-11 03:48:27,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:27,268 INFO L276 IsEmpty]: Start isEmpty. Operand 10066 states and 13369 transitions. [2024-10-11 03:48:27,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 03:48:27,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:27,271 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:48:27,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-11 03:48:27,271 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-10-11 03:48:27,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:27,272 INFO L85 PathProgramCache]: Analyzing trace with hash -171587149, now seen corresponding path program 1 times [2024-10-11 03:48:27,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:27,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293464751] [2024-10-11 03:48:27,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:27,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:27,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:27,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:27,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293464751] [2024-10-11 03:48:27,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293464751] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:48:27,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524677518] [2024-10-11 03:48:27,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:27,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:48:27,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:48:27,762 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:48:27,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:48:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:28,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:48:28,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:48:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:48:28,286 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:48:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:48:28,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524677518] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:48:28,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:48:28,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5, 5] total 18 [2024-10-11 03:48:28,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076710034] [2024-10-11 03:48:28,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:48:28,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 03:48:28,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:28,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 03:48:28,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:48:28,579 INFO L87 Difference]: Start difference. First operand 10066 states and 13369 transitions. Second operand has 18 states, 18 states have (on average 20.0) internal successors, (360), 18 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:31,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:48:31,162 INFO L93 Difference]: Finished difference Result 59399 states and 78973 transitions. [2024-10-11 03:48:31,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-11 03:48:31,163 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 20.0) internal successors, (360), 18 states have internal predecessors, (360), 0 states have call successors, (0), 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 125 [2024-10-11 03:48:31,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:48:31,255 INFO L225 Difference]: With dead ends: 59399 [2024-10-11 03:48:31,256 INFO L226 Difference]: Without dead ends: 49405 [2024-10-11 03:48:31,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=766, Invalid=3394, Unknown=0, NotChecked=0, Total=4160 [2024-10-11 03:48:31,274 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 2606 mSDsluCounter, 1418 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2606 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:48:31,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2606 Valid, 1564 Invalid, 1692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:48:31,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49405 states. [2024-10-11 03:48:31,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49405 to 37244. [2024-10-11 03:48:31,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37244 states, 37243 states have (on average 1.3193620277636067) internal successors, (49137), 37243 states have internal predecessors, (49137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37244 states to 37244 states and 49137 transitions. [2024-10-11 03:48:31,968 INFO L78 Accepts]: Start accepts. Automaton has 37244 states and 49137 transitions. Word has length 125 [2024-10-11 03:48:31,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:48:31,968 INFO L471 AbstractCegarLoop]: Abstraction has 37244 states and 49137 transitions. [2024-10-11 03:48:31,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 20.0) internal successors, (360), 18 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:48:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 37244 states and 49137 transitions. [2024-10-11 03:48:31,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 03:48:31,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:48:31,981 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] [2024-10-11 03:48:32,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:48:32,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-10-11 03:48:32,186 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-10-11 03:48:32,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:48:32,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1644511827, now seen corresponding path program 1 times [2024-10-11 03:48:32,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:48:32,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787687923] [2024-10-11 03:48:32,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:32,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:48:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:32,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:48:32,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787687923] [2024-10-11 03:48:32,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787687923] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:48:32,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496787478] [2024-10-11 03:48:32,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:48:32,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:48:32,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:48:32,926 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:48:32,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:48:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:48:33,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-11 03:48:33,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:48:36,918 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:36,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:48:39,490 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:48:39,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496787478] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:48:39,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:48:39,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21, 21] total 51 [2024-10-11 03:48:39,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062385772] [2024-10-11 03:48:39,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:48:39,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-10-11 03:48:39,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:48:39,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-10-11 03:48:39,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=2290, Unknown=0, NotChecked=0, Total=2550 [2024-10-11 03:48:39,496 INFO L87 Difference]: Start difference. First operand 37244 states and 49137 transitions. Second operand has 51 states, 51 states have (on average 6.901960784313726) internal successors, (352), 51 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)