./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+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6fcbb6774587cda7a5d573623a9a47b3e351563c8bea7eebdf86bc25d20b8061 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:56:37,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:56:37,781 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:56:37,788 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:56:37,789 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:56:37,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:56:37,816 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:56:37,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:56:37,817 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:56:37,819 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:56:37,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:56:37,820 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:56:37,820 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:56:37,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:56:37,822 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:56:37,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:56:37,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:56:37,823 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:56:37,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:56:37,824 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:56:37,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:56:37,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:56:37,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:56:37,825 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:56:37,825 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:56:37,825 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:56:37,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:56:37,826 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:56:37,826 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:56:37,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:56:37,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:56:37,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:56:37,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:56:37,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:56:37,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:56:37,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:56:37,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:56:37,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:56:37,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:56:37,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:56:37,833 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:56:37,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:56:37,834 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6fcbb6774587cda7a5d573623a9a47b3e351563c8bea7eebdf86bc25d20b8061 [2024-10-14 03:56:38,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:56:38,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:56:38,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:56:38,120 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:56:38,121 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:56:38,121 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+lhb-reducer.c [2024-10-14 03:56:39,597 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:56:39,892 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:56:39,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-14 03:56:39,926 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f187d5a5/bca47b0cd33a47de9b52b81e66fa2004/FLAG6a6cbe654 [2024-10-14 03:56:40,185 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f187d5a5/bca47b0cd33a47de9b52b81e66fa2004 [2024-10-14 03:56:40,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:56:40,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:56:40,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:56:40,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:56:40,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:56:40,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:56:40" (1/1) ... [2024-10-14 03:56:40,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@444856e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:56:40, skipping insertion in model container [2024-10-14 03:56:40,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:56:40" (1/1) ... [2024-10-14 03:56:40,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:56:40,558 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+lhb-reducer.c[8891,8904] [2024-10-14 03:56:40,582 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+lhb-reducer.c[12143,12156] [2024-10-14 03:56:40,594 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+lhb-reducer.c[13299,13312] [2024-10-14 03:56:40,605 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+lhb-reducer.c[13955,13968] [2024-10-14 03:56:40,614 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+lhb-reducer.c[15434,15447] [2024-10-14 03:56:40,618 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+lhb-reducer.c[16090,16103] [2024-10-14 03:56:40,631 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+lhb-reducer.c[17074,17087] [2024-10-14 03:56:40,649 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+lhb-reducer.c[19370,19383] [2024-10-14 03:56:40,655 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+lhb-reducer.c[20029,20042] [2024-10-14 03:56:40,661 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+lhb-reducer.c[21011,21024] [2024-10-14 03:56:40,670 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+lhb-reducer.c[22802,22815] [2024-10-14 03:56:40,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:56:40,764 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:56:40,837 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+lhb-reducer.c[8891,8904] [2024-10-14 03:56:40,855 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+lhb-reducer.c[12143,12156] [2024-10-14 03:56:40,865 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+lhb-reducer.c[13299,13312] [2024-10-14 03:56:40,870 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+lhb-reducer.c[13955,13968] [2024-10-14 03:56:40,880 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+lhb-reducer.c[15434,15447] [2024-10-14 03:56:40,886 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+lhb-reducer.c[16090,16103] [2024-10-14 03:56:40,893 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+lhb-reducer.c[17074,17087] [2024-10-14 03:56:40,903 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+lhb-reducer.c[19370,19383] [2024-10-14 03:56:40,907 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+lhb-reducer.c[20029,20042] [2024-10-14 03:56:40,911 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+lhb-reducer.c[21011,21024] [2024-10-14 03:56:40,919 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+lhb-reducer.c[22802,22815] [2024-10-14 03:56:40,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:56:41,001 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:56:41,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:56:41 WrapperNode [2024-10-14 03:56:41,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:56:41,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:56:41,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:56:41,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:56:41,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:56:41" (1/1) ... [2024-10-14 03:56:41,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:56:41" (1/1) ... [2024-10-14 03:56:41,094 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1922 [2024-10-14 03:56:41,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:56:41,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:56:41,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:56:41,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:56:41,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:56:41" (1/1) ... [2024-10-14 03:56:41,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:56:41" (1/1) ... [2024-10-14 03:56:41,117 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:56:41" (1/1) ... [2024-10-14 03:56:41,159 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-14 03:56:41,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:56:41" (1/1) ... [2024-10-14 03:56:41,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:56:41" (1/1) ... [2024-10-14 03:56:41,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:56:41" (1/1) ... [2024-10-14 03:56:41,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:56:41" (1/1) ... [2024-10-14 03:56:41,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:56:41" (1/1) ... [2024-10-14 03:56:41,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:56:41" (1/1) ... [2024-10-14 03:56:41,247 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:56:41,248 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:56:41,248 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:56:41,249 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:56:41,250 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:56:41" (1/1) ... [2024-10-14 03:56:41,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:56:41,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:56:41,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:56:41,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:56:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:56:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:56:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:56:41,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:56:41,508 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:56:41,510 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:56:42,801 INFO L? ?]: Removed 294 outVars from TransFormulas that were not future-live. [2024-10-14 03:56:42,801 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:56:42,859 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:56:42,859 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 03:56:42,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:56:42 BoogieIcfgContainer [2024-10-14 03:56:42,862 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:56:42,864 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:56:42,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:56:42,868 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:56:42,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:56:40" (1/3) ... [2024-10-14 03:56:42,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7803e968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:56:42, skipping insertion in model container [2024-10-14 03:56:42,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:56:41" (2/3) ... [2024-10-14 03:56:42,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7803e968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:56:42, skipping insertion in model container [2024-10-14 03:56:42,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:56:42" (3/3) ... [2024-10-14 03:56:42,872 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-14 03:56:42,889 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:56:42,889 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-10-14 03:56:42,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:56:43,002 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;@2228a972, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:56:43,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-10-14 03:56:43,010 INFO L276 IsEmpty]: Start isEmpty. Operand has 355 states, 343 states have (on average 1.8425655976676385) internal successors, (632), 354 states have internal predecessors, (632), 0 states have call successors, (0), 0 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-14 03:56:43,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 03:56:43,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:43,028 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] [2024-10-14 03:56:43,028 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:43,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:43,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1432511949, now seen corresponding path program 1 times [2024-10-14 03:56:43,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:43,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734056971] [2024-10-14 03:56:43,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:43,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:43,633 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-14 03:56:43,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:43,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734056971] [2024-10-14 03:56:43,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734056971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:43,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:43,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:56:43,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317392853] [2024-10-14 03:56:43,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:43,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:56:43,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:43,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:56:43,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:56:43,675 INFO L87 Difference]: Start difference. First operand has 355 states, 343 states have (on average 1.8425655976676385) internal successors, (632), 354 states have internal predecessors, (632), 0 states have call successors, (0), 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.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-14 03:56:44,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:44,055 INFO L93 Difference]: Finished difference Result 564 states and 967 transitions. [2024-10-14 03:56:44,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:56:44,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-10-14 03:56:44,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:44,072 INFO L225 Difference]: With dead ends: 564 [2024-10-14 03:56:44,072 INFO L226 Difference]: Without dead ends: 301 [2024-10-14 03:56:44,076 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-14 03:56:44,079 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 1457 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1457 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:44,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1457 Valid, 377 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:56:44,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-14 03:56:44,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2024-10-14 03:56:44,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 290 states have (on average 1.293103448275862) internal successors, (375), 300 states have internal predecessors, (375), 0 states have call successors, (0), 0 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-14 03:56:44,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 375 transitions. [2024-10-14 03:56:44,140 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 375 transitions. Word has length 57 [2024-10-14 03:56:44,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:44,141 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 375 transitions. [2024-10-14 03:56:44,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-14 03:56:44,142 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 375 transitions. [2024-10-14 03:56:44,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 03:56:44,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:44,148 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-14 03:56:44,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:56:44,148 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:44,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:44,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1451472122, now seen corresponding path program 1 times [2024-10-14 03:56:44,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:44,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066649870] [2024-10-14 03:56:44,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:44,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:44,366 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-14 03:56:44,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:44,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066649870] [2024-10-14 03:56:44,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066649870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:44,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:44,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:56:44,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64176961] [2024-10-14 03:56:44,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:44,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:56:44,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:44,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:56:44,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:56:44,369 INFO L87 Difference]: Start difference. First operand 301 states and 375 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-14 03:56:44,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:44,564 INFO L93 Difference]: Finished difference Result 504 states and 645 transitions. [2024-10-14 03:56:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:56:44,564 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-14 03:56:44,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:44,567 INFO L225 Difference]: With dead ends: 504 [2024-10-14 03:56:44,570 INFO L226 Difference]: Without dead ends: 266 [2024-10-14 03:56:44,571 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-14 03:56:44,572 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 971 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:44,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 204 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:56:44,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-10-14 03:56:44,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2024-10-14 03:56:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 255 states have (on average 1.3137254901960784) internal successors, (335), 265 states have internal predecessors, (335), 0 states have call successors, (0), 0 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-14 03:56:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 335 transitions. [2024-10-14 03:56:44,595 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 335 transitions. Word has length 58 [2024-10-14 03:56:44,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:44,596 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 335 transitions. [2024-10-14 03:56:44,596 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-14 03:56:44,597 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 335 transitions. [2024-10-14 03:56:44,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 03:56:44,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:44,598 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-14 03:56:44,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:56:44,599 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:44,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:44,600 INFO L85 PathProgramCache]: Analyzing trace with hash 659385937, now seen corresponding path program 1 times [2024-10-14 03:56:44,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:44,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330160138] [2024-10-14 03:56:44,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:44,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:44,756 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-14 03:56:44,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:44,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330160138] [2024-10-14 03:56:44,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330160138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:44,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:44,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:56:44,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801614354] [2024-10-14 03:56:44,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:44,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:56:44,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:44,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:56:44,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:56:44,760 INFO L87 Difference]: Start difference. First operand 266 states and 335 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-14 03:56:44,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:44,961 INFO L93 Difference]: Finished difference Result 469 states and 604 transitions. [2024-10-14 03:56:44,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:56:44,962 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-14 03:56:44,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:44,963 INFO L225 Difference]: With dead ends: 469 [2024-10-14 03:56:44,965 INFO L226 Difference]: Without dead ends: 256 [2024-10-14 03:56:44,966 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-14 03:56:44,968 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 893 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:44,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 197 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:56:44,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-14 03:56:44,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2024-10-14 03:56:44,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 245 states have (on average 1.3142857142857143) internal successors, (322), 255 states have internal predecessors, (322), 0 states have call successors, (0), 0 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-14 03:56:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 322 transitions. [2024-10-14 03:56:44,983 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 322 transitions. Word has length 59 [2024-10-14 03:56:44,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:44,983 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 322 transitions. [2024-10-14 03:56:44,984 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-14 03:56:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 322 transitions. [2024-10-14 03:56:44,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 03:56:44,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:44,985 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-14 03:56:44,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:56:44,986 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:44,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:44,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1543164138, now seen corresponding path program 1 times [2024-10-14 03:56:44,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:44,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034828054] [2024-10-14 03:56:44,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:44,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:45,141 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-14 03:56:45,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:45,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034828054] [2024-10-14 03:56:45,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034828054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:45,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:45,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:56:45,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285042367] [2024-10-14 03:56:45,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:45,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:56:45,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:45,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:56:45,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:56:45,144 INFO L87 Difference]: Start difference. First operand 256 states and 322 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 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-14 03:56:45,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:45,312 INFO L93 Difference]: Finished difference Result 459 states and 590 transitions. [2024-10-14 03:56:45,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:56:45,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 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-14 03:56:45,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:45,315 INFO L225 Difference]: With dead ends: 459 [2024-10-14 03:56:45,315 INFO L226 Difference]: Without dead ends: 245 [2024-10-14 03:56:45,315 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-14 03:56:45,317 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 881 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 192 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-14 03:56:45,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 192 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:56:45,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-14 03:56:45,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2024-10-14 03:56:45,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.3205128205128205) internal successors, (309), 244 states have internal predecessors, (309), 0 states have call successors, (0), 0 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-14 03:56:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 309 transitions. [2024-10-14 03:56:45,334 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 309 transitions. Word has length 60 [2024-10-14 03:56:45,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:45,334 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 309 transitions. [2024-10-14 03:56:45,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 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-14 03:56:45,335 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 309 transitions. [2024-10-14 03:56:45,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 03:56:45,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:45,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:56:45,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:56:45,336 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:45,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:45,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1012719179, now seen corresponding path program 1 times [2024-10-14 03:56:45,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:45,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105324840] [2024-10-14 03:56:45,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:45,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:45,723 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-14 03:56:45,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:45,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105324840] [2024-10-14 03:56:45,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105324840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:45,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:45,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:56:45,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960964074] [2024-10-14 03:56:45,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:45,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:56:45,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:45,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:56:45,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:56:45,726 INFO L87 Difference]: Start difference. First operand 245 states and 309 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:46,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:46,274 INFO L93 Difference]: Finished difference Result 469 states and 609 transitions. [2024-10-14 03:56:46,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:56:46,274 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-10-14 03:56:46,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:46,277 INFO L225 Difference]: With dead ends: 469 [2024-10-14 03:56:46,277 INFO L226 Difference]: Without dead ends: 381 [2024-10-14 03:56:46,278 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-14 03:56:46,279 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 1295 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:46,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 781 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:56:46,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-10-14 03:56:46,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 245. [2024-10-14 03:56:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.3162393162393162) internal successors, (308), 244 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-14 03:56:46,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 308 transitions. [2024-10-14 03:56:46,285 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 308 transitions. Word has length 61 [2024-10-14 03:56:46,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:46,286 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 308 transitions. [2024-10-14 03:56:46,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:46,286 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 308 transitions. [2024-10-14 03:56:46,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 03:56:46,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:46,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:56:46,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:56:46,288 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:46,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:46,288 INFO L85 PathProgramCache]: Analyzing trace with hash 603873951, now seen corresponding path program 1 times [2024-10-14 03:56:46,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:46,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883381605] [2024-10-14 03:56:46,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:46,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:46,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:46,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:46,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883381605] [2024-10-14 03:56:46,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883381605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:46,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:46,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:56:46,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728576102] [2024-10-14 03:56:46,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:46,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:56:46,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:46,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:56:46,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:56:46,582 INFO L87 Difference]: Start difference. First operand 245 states and 308 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:47,052 INFO L93 Difference]: Finished difference Result 374 states and 469 transitions. [2024-10-14 03:56:47,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:56:47,053 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-10-14 03:56:47,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:47,054 INFO L225 Difference]: With dead ends: 374 [2024-10-14 03:56:47,055 INFO L226 Difference]: Without dead ends: 369 [2024-10-14 03:56:47,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:56:47,056 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 1265 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:47,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1265 Valid, 745 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:56:47,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-14 03:56:47,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 245. [2024-10-14 03:56:47,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.311965811965812) internal successors, (307), 244 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-14 03:56:47,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 307 transitions. [2024-10-14 03:56:47,062 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 307 transitions. Word has length 61 [2024-10-14 03:56:47,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:47,062 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 307 transitions. [2024-10-14 03:56:47,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:47,062 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 307 transitions. [2024-10-14 03:56:47,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 03:56:47,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:47,063 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:56:47,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:56:47,063 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:47,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:47,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1551029823, now seen corresponding path program 1 times [2024-10-14 03:56:47,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:47,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248961949] [2024-10-14 03:56:47,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:47,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:47,391 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-14 03:56:47,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:47,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248961949] [2024-10-14 03:56:47,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248961949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:47,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:47,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:56:47,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604152140] [2024-10-14 03:56:47,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:47,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:56:47,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:47,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:56:47,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:56:47,396 INFO L87 Difference]: Start difference. First operand 245 states and 307 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:47,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:47,832 INFO L93 Difference]: Finished difference Result 484 states and 609 transitions. [2024-10-14 03:56:47,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:56:47,833 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-10-14 03:56:47,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:47,834 INFO L225 Difference]: With dead ends: 484 [2024-10-14 03:56:47,834 INFO L226 Difference]: Without dead ends: 351 [2024-10-14 03:56:47,835 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-14 03:56:47,835 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 850 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:47,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 772 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:56:47,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-10-14 03:56:47,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 245. [2024-10-14 03:56:47,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.3076923076923077) internal successors, (306), 244 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-14 03:56:47,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 306 transitions. [2024-10-14 03:56:47,844 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 306 transitions. Word has length 61 [2024-10-14 03:56:47,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:47,844 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 306 transitions. [2024-10-14 03:56:47,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:47,845 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 306 transitions. [2024-10-14 03:56:47,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 03:56:47,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:47,846 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:56:47,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:56:47,846 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:47,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:47,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1026541166, now seen corresponding path program 1 times [2024-10-14 03:56:47,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:47,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247777595] [2024-10-14 03:56:47,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:47,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:48,170 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-14 03:56:48,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:48,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247777595] [2024-10-14 03:56:48,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247777595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:48,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:48,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:56:48,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712310916] [2024-10-14 03:56:48,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:48,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:56:48,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:48,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:56:48,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:56:48,173 INFO L87 Difference]: Start difference. First operand 245 states and 306 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:48,691 INFO L93 Difference]: Finished difference Result 428 states and 547 transitions. [2024-10-14 03:56:48,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:56:48,691 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-14 03:56:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:48,693 INFO L225 Difference]: With dead ends: 428 [2024-10-14 03:56:48,693 INFO L226 Difference]: Without dead ends: 369 [2024-10-14 03:56:48,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:56:48,694 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 947 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:48,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 947 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:56:48,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-14 03:56:48,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 245. [2024-10-14 03:56:48,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.3034188034188035) internal successors, (305), 244 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-14 03:56:48,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 305 transitions. [2024-10-14 03:56:48,701 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 305 transitions. Word has length 63 [2024-10-14 03:56:48,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:48,702 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 305 transitions. [2024-10-14 03:56:48,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:48,702 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 305 transitions. [2024-10-14 03:56:48,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 03:56:48,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:48,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:56:48,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:56:48,704 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:48,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:48,706 INFO L85 PathProgramCache]: Analyzing trace with hash 885655936, now seen corresponding path program 1 times [2024-10-14 03:56:48,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:48,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719555927] [2024-10-14 03:56:48,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:48,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:49,185 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-14 03:56:49,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:49,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719555927] [2024-10-14 03:56:49,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719555927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:49,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:49,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 03:56:49,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597902436] [2024-10-14 03:56:49,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:49,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 03:56:49,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:49,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 03:56:49,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:56:49,188 INFO L87 Difference]: Start difference. First operand 245 states and 305 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:50,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:50,215 INFO L93 Difference]: Finished difference Result 630 states and 842 transitions. [2024-10-14 03:56:50,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 03:56:50,216 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-14 03:56:50,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:50,218 INFO L225 Difference]: With dead ends: 630 [2024-10-14 03:56:50,218 INFO L226 Difference]: Without dead ends: 559 [2024-10-14 03:56:50,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-14 03:56:50,219 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 2476 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2476 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:50,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2476 Valid, 1104 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:56:50,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-14 03:56:50,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 249. [2024-10-14 03:56:50,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 238 states have (on average 1.2983193277310925) internal successors, (309), 248 states have internal predecessors, (309), 0 states have call successors, (0), 0 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-14 03:56:50,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 309 transitions. [2024-10-14 03:56:50,226 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 309 transitions. Word has length 63 [2024-10-14 03:56:50,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:50,226 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 309 transitions. [2024-10-14 03:56:50,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:50,227 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 309 transitions. [2024-10-14 03:56:50,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 03:56:50,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:50,227 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:56:50,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:56:50,228 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:50,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:50,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1158234944, now seen corresponding path program 1 times [2024-10-14 03:56:50,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:50,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369207407] [2024-10-14 03:56:50,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:50,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:50,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:50,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369207407] [2024-10-14 03:56:50,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369207407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:50,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:50,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:56:50,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555217421] [2024-10-14 03:56:50,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:50,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:56:50,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:50,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:56:50,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:56:50,511 INFO L87 Difference]: Start difference. First operand 249 states and 309 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:51,037 INFO L93 Difference]: Finished difference Result 443 states and 569 transitions. [2024-10-14 03:56:51,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:56:51,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-14 03:56:51,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:51,039 INFO L225 Difference]: With dead ends: 443 [2024-10-14 03:56:51,039 INFO L226 Difference]: Without dead ends: 377 [2024-10-14 03:56:51,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:56:51,040 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 927 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:51,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 1048 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:56:51,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-10-14 03:56:51,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 249. [2024-10-14 03:56:51,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 238 states have (on average 1.2941176470588236) internal successors, (308), 248 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-14 03:56:51,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 308 transitions. [2024-10-14 03:56:51,047 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 308 transitions. Word has length 63 [2024-10-14 03:56:51,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:51,047 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 308 transitions. [2024-10-14 03:56:51,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:51,048 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 308 transitions. [2024-10-14 03:56:51,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 03:56:51,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:51,050 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:56:51,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:56:51,050 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:51,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:51,053 INFO L85 PathProgramCache]: Analyzing trace with hash -515644867, now seen corresponding path program 1 times [2024-10-14 03:56:51,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:51,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110261364] [2024-10-14 03:56:51,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:51,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:51,334 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-14 03:56:51,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:51,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110261364] [2024-10-14 03:56:51,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110261364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:51,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:51,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:56:51,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929554396] [2024-10-14 03:56:51,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:51,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:56:51,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:51,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:56:51,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:56:51,337 INFO L87 Difference]: Start difference. First operand 249 states and 308 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:51,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:51,817 INFO L93 Difference]: Finished difference Result 429 states and 546 transitions. [2024-10-14 03:56:51,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:56:51,818 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-14 03:56:51,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:51,819 INFO L225 Difference]: With dead ends: 429 [2024-10-14 03:56:51,819 INFO L226 Difference]: Without dead ends: 373 [2024-10-14 03:56:51,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:56:51,820 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 940 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:51,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 982 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:56:51,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-10-14 03:56:51,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 249. [2024-10-14 03:56:51,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 238 states have (on average 1.2899159663865547) internal successors, (307), 248 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-14 03:56:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 307 transitions. [2024-10-14 03:56:51,826 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 307 transitions. Word has length 63 [2024-10-14 03:56:51,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:51,826 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 307 transitions. [2024-10-14 03:56:51,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:51,827 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 307 transitions. [2024-10-14 03:56:51,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 03:56:51,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:51,827 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:56:51,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:56:51,828 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:51,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:51,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1022850411, now seen corresponding path program 1 times [2024-10-14 03:56:51,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:51,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336977163] [2024-10-14 03:56:51,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:51,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:52,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:52,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:52,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336977163] [2024-10-14 03:56:52,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336977163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:52,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:52,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 03:56:52,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944807657] [2024-10-14 03:56:52,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:52,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 03:56:52,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:52,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 03:56:52,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:56:52,190 INFO L87 Difference]: Start difference. First operand 249 states and 307 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:52,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:52,968 INFO L93 Difference]: Finished difference Result 533 states and 690 transitions. [2024-10-14 03:56:52,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:56:52,968 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-14 03:56:52,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:52,970 INFO L225 Difference]: With dead ends: 533 [2024-10-14 03:56:52,970 INFO L226 Difference]: Without dead ends: 439 [2024-10-14 03:56:52,970 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-14 03:56:52,971 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 1253 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:52,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1253 Valid, 1302 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:56:52,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-10-14 03:56:52,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 249. [2024-10-14 03:56:52,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 238 states have (on average 1.2857142857142858) internal successors, (306), 248 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-14 03:56:52,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 306 transitions. [2024-10-14 03:56:52,976 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 306 transitions. Word has length 63 [2024-10-14 03:56:52,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:52,976 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 306 transitions. [2024-10-14 03:56:52,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:52,977 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 306 transitions. [2024-10-14 03:56:52,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 03:56:52,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:52,977 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:56:52,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:56:52,978 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:52,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:52,978 INFO L85 PathProgramCache]: Analyzing trace with hash 100501655, now seen corresponding path program 1 times [2024-10-14 03:56:52,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:52,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821388299] [2024-10-14 03:56:52,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:52,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:53,241 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-14 03:56:53,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:53,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821388299] [2024-10-14 03:56:53,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821388299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:53,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:53,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:56:53,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366654768] [2024-10-14 03:56:53,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:53,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:56:53,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:53,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:56:53,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:56:53,244 INFO L87 Difference]: Start difference. First operand 249 states and 306 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:53,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:53,671 INFO L93 Difference]: Finished difference Result 378 states and 466 transitions. [2024-10-14 03:56:53,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:56:53,672 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-14 03:56:53,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:53,673 INFO L225 Difference]: With dead ends: 378 [2024-10-14 03:56:53,673 INFO L226 Difference]: Without dead ends: 373 [2024-10-14 03:56:53,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:56:53,674 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 932 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:53,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 982 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:56:53,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-10-14 03:56:53,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 249. [2024-10-14 03:56:53,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 238 states have (on average 1.281512605042017) internal successors, (305), 248 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-14 03:56:53,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 305 transitions. [2024-10-14 03:56:53,679 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 305 transitions. Word has length 63 [2024-10-14 03:56:53,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:53,680 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 305 transitions. [2024-10-14 03:56:53,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:53,680 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 305 transitions. [2024-10-14 03:56:53,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-14 03:56:53,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:53,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:56:53,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:56:53,681 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:53,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:53,682 INFO L85 PathProgramCache]: Analyzing trace with hash 2012698757, now seen corresponding path program 1 times [2024-10-14 03:56:53,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:53,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800725178] [2024-10-14 03:56:53,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:53,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:53,935 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-14 03:56:53,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:53,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800725178] [2024-10-14 03:56:53,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800725178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:53,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:53,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:56:53,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050313463] [2024-10-14 03:56:53,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:53,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:56:53,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:53,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:56:53,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:56:53,937 INFO L87 Difference]: Start difference. First operand 249 states and 305 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:54,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:54,456 INFO L93 Difference]: Finished difference Result 394 states and 490 transitions. [2024-10-14 03:56:54,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:56:54,456 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-10-14 03:56:54,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:54,458 INFO L225 Difference]: With dead ends: 394 [2024-10-14 03:56:54,458 INFO L226 Difference]: Without dead ends: 377 [2024-10-14 03:56:54,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:56:54,459 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 912 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:54,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 1202 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:56:54,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-10-14 03:56:54,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 249. [2024-10-14 03:56:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 238 states have (on average 1.2773109243697478) internal successors, (304), 248 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-14 03:56:54,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 304 transitions. [2024-10-14 03:56:54,465 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 304 transitions. Word has length 63 [2024-10-14 03:56:54,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:54,465 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 304 transitions. [2024-10-14 03:56:54,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:56:54,465 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 304 transitions. [2024-10-14 03:56:54,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 03:56:54,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:54,466 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-14 03:56:54,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:56:54,466 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:54,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:54,467 INFO L85 PathProgramCache]: Analyzing trace with hash -563101149, now seen corresponding path program 1 times [2024-10-14 03:56:54,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:54,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830062128] [2024-10-14 03:56:54,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:54,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:54,771 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-14 03:56:54,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:54,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830062128] [2024-10-14 03:56:54,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830062128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:54,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:54,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:56:54,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552675219] [2024-10-14 03:56:54,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:54,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:56:54,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:54,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:56:54,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:56:54,773 INFO L87 Difference]: Start difference. First operand 249 states and 304 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 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-14 03:56:55,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:55,344 INFO L93 Difference]: Finished difference Result 448 states and 570 transitions. [2024-10-14 03:56:55,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:56:55,347 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 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-14 03:56:55,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:55,348 INFO L225 Difference]: With dead ends: 448 [2024-10-14 03:56:55,349 INFO L226 Difference]: Without dead ends: 377 [2024-10-14 03:56:55,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:56:55,350 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 907 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:55,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 1404 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:56:55,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-10-14 03:56:55,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 245. [2024-10-14 03:56:55,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 234 states have (on average 1.2777777777777777) internal successors, (299), 244 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-14 03:56:55,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 299 transitions. [2024-10-14 03:56:55,356 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 299 transitions. Word has length 64 [2024-10-14 03:56:55,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:55,356 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 299 transitions. [2024-10-14 03:56:55,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 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-14 03:56:55,357 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 299 transitions. [2024-10-14 03:56:55,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 03:56:55,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:55,358 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-14 03:56:55,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:56:55,358 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:55,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:55,359 INFO L85 PathProgramCache]: Analyzing trace with hash -522081681, now seen corresponding path program 1 times [2024-10-14 03:56:55,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:55,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961096428] [2024-10-14 03:56:55,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:55,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:56,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:56,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:56,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961096428] [2024-10-14 03:56:56,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961096428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:56,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:56,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 03:56:56,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402812372] [2024-10-14 03:56:56,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:56,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:56:56,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:56,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:56:56,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:56:56,048 INFO L87 Difference]: Start difference. First operand 245 states and 299 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 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-14 03:56:57,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:57,085 INFO L93 Difference]: Finished difference Result 606 states and 762 transitions. [2024-10-14 03:56:57,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:56:57,086 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 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-14 03:56:57,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:57,088 INFO L225 Difference]: With dead ends: 606 [2024-10-14 03:56:57,088 INFO L226 Difference]: Without dead ends: 548 [2024-10-14 03:56:57,088 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-14 03:56:57,089 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 1955 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1955 SdHoareTripleChecker+Valid, 2202 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:57,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1955 Valid, 2202 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:56:57,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-10-14 03:56:57,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 241. [2024-10-14 03:56:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 231 states have (on average 1.2727272727272727) internal successors, (294), 240 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-14 03:56:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 294 transitions. [2024-10-14 03:56:57,095 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 294 transitions. Word has length 65 [2024-10-14 03:56:57,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:57,095 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 294 transitions. [2024-10-14 03:56:57,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 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-14 03:56:57,096 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 294 transitions. [2024-10-14 03:56:57,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 03:56:57,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:57,096 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-14 03:56:57,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:56:57,097 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:57,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:57,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1992368467, now seen corresponding path program 1 times [2024-10-14 03:56:57,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:57,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036281376] [2024-10-14 03:56:57,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:57,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:57,641 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-14 03:56:57,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:57,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036281376] [2024-10-14 03:56:57,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036281376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:57,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:57,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 03:56:57,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867653667] [2024-10-14 03:56:57,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:57,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:56:57,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:57,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:56:57,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:56:57,645 INFO L87 Difference]: Start difference. First operand 241 states and 294 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 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-14 03:56:58,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:58,338 INFO L93 Difference]: Finished difference Result 615 states and 790 transitions. [2024-10-14 03:56:58,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:56:58,339 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 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-14 03:56:58,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:58,341 INFO L225 Difference]: With dead ends: 615 [2024-10-14 03:56:58,341 INFO L226 Difference]: Without dead ends: 550 [2024-10-14 03:56:58,342 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-14 03:56:58,342 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 1924 mSDsluCounter, 2407 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1924 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:58,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1924 Valid, 2761 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:56:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-10-14 03:56:58,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 230. [2024-10-14 03:56:58,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 221 states have (on average 1.2669683257918551) internal successors, (280), 229 states have internal predecessors, (280), 0 states have call successors, (0), 0 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-14 03:56:58,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 280 transitions. [2024-10-14 03:56:58,348 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 280 transitions. Word has length 65 [2024-10-14 03:56:58,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:58,348 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 280 transitions. [2024-10-14 03:56:58,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 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-14 03:56:58,348 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 280 transitions. [2024-10-14 03:56:58,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 03:56:58,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:58,349 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-14 03:56:58,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 03:56:58,349 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:58,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:58,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1545464944, now seen corresponding path program 1 times [2024-10-14 03:56:58,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:58,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181272677] [2024-10-14 03:56:58,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:58,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:56:58,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:56:58,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:56:58,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181272677] [2024-10-14 03:56:58,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181272677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:56:58,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:56:58,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 03:56:58,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003731914] [2024-10-14 03:56:58,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:56:58,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:56:58,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:56:58,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:56:58,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:56:58,845 INFO L87 Difference]: Start difference. First operand 230 states and 280 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 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-14 03:56:59,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:56:59,510 INFO L93 Difference]: Finished difference Result 628 states and 811 transitions. [2024-10-14 03:56:59,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:56:59,511 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 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-14 03:56:59,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:56:59,512 INFO L225 Difference]: With dead ends: 628 [2024-10-14 03:56:59,512 INFO L226 Difference]: Without dead ends: 550 [2024-10-14 03:56:59,513 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-14 03:56:59,513 INFO L432 NwaCegarLoop]: 635 mSDtfsCounter, 1184 mSDsluCounter, 3385 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 4020 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:56:59,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 4020 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:56:59,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-10-14 03:56:59,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 206. [2024-10-14 03:56:59,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 198 states have (on average 1.2626262626262625) internal successors, (250), 205 states have internal predecessors, (250), 0 states have call successors, (0), 0 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-14 03:56:59,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 250 transitions. [2024-10-14 03:56:59,519 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 250 transitions. Word has length 65 [2024-10-14 03:56:59,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:56:59,519 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 250 transitions. [2024-10-14 03:56:59,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 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-14 03:56:59,519 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 250 transitions. [2024-10-14 03:56:59,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 03:56:59,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:56:59,520 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-14 03:56:59,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 03:56:59,520 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:56:59,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:56:59,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1614163178, now seen corresponding path program 1 times [2024-10-14 03:56:59,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:56:59,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888862646] [2024-10-14 03:56:59,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:56:59,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:56:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:00,065 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-14 03:57:00,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:00,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888862646] [2024-10-14 03:57:00,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888862646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:00,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:00,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 03:57:00,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4879872] [2024-10-14 03:57:00,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:00,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:57:00,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:00,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:57:00,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:57:00,068 INFO L87 Difference]: Start difference. First operand 206 states and 250 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 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-14 03:57:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:00,781 INFO L93 Difference]: Finished difference Result 533 states and 679 transitions. [2024-10-14 03:57:00,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:57:00,782 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 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-14 03:57:00,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:00,783 INFO L225 Difference]: With dead ends: 533 [2024-10-14 03:57:00,783 INFO L226 Difference]: Without dead ends: 475 [2024-10-14 03:57:00,784 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-14 03:57:00,784 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 1251 mSDsluCounter, 1741 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:00,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 1968 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:57:00,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-10-14 03:57:00,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 202. [2024-10-14 03:57:00,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 195 states have (on average 1.2564102564102564) internal successors, (245), 201 states have internal predecessors, (245), 0 states have call successors, (0), 0 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-14 03:57:00,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 245 transitions. [2024-10-14 03:57:00,789 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 245 transitions. Word has length 65 [2024-10-14 03:57:00,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:00,790 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 245 transitions. [2024-10-14 03:57:00,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 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-14 03:57:00,790 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 245 transitions. [2024-10-14 03:57:00,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 03:57:00,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:00,791 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:00,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 03:57:00,791 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:00,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:00,792 INFO L85 PathProgramCache]: Analyzing trace with hash 234306004, now seen corresponding path program 1 times [2024-10-14 03:57:00,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:00,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524271433] [2024-10-14 03:57:00,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:00,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:01,305 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-14 03:57:01,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:01,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524271433] [2024-10-14 03:57:01,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524271433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:01,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:01,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 03:57:01,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338658026] [2024-10-14 03:57:01,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:01,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:57:01,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:01,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:57:01,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:57:01,307 INFO L87 Difference]: Start difference. First operand 202 states and 245 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 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-14 03:57:02,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:02,064 INFO L93 Difference]: Finished difference Result 555 states and 724 transitions. [2024-10-14 03:57:02,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:57:02,065 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 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-14 03:57:02,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:02,066 INFO L225 Difference]: With dead ends: 555 [2024-10-14 03:57:02,066 INFO L226 Difference]: Without dead ends: 468 [2024-10-14 03:57:02,067 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-14 03:57:02,067 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 958 mSDsluCounter, 4012 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 4552 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:02,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 4552 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:57:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-10-14 03:57:02,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 169. [2024-10-14 03:57:02,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 165 states have (on average 1.2545454545454546) internal successors, (207), 168 states have internal predecessors, (207), 0 states have call successors, (0), 0 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-14 03:57:02,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 207 transitions. [2024-10-14 03:57:02,073 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 207 transitions. Word has length 65 [2024-10-14 03:57:02,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:02,073 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 207 transitions. [2024-10-14 03:57:02,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 12 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-14 03:57:02,074 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 207 transitions. [2024-10-14 03:57:02,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 03:57:02,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:02,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:02,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 03:57:02,075 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:02,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:02,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1710848008, now seen corresponding path program 1 times [2024-10-14 03:57:02,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:02,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245809485] [2024-10-14 03:57:02,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:02,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:02,405 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-14 03:57:02,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:02,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245809485] [2024-10-14 03:57:02,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245809485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:02,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:02,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 03:57:02,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882858070] [2024-10-14 03:57:02,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:02,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 03:57:02,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:02,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 03:57:02,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:57:02,407 INFO L87 Difference]: Start difference. First operand 169 states and 207 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 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-14 03:57:02,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:02,896 INFO L93 Difference]: Finished difference Result 407 states and 537 transitions. [2024-10-14 03:57:02,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:57:02,897 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 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-14 03:57:02,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:02,898 INFO L225 Difference]: With dead ends: 407 [2024-10-14 03:57:02,898 INFO L226 Difference]: Without dead ends: 400 [2024-10-14 03:57:02,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2024-10-14 03:57:02,899 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 2293 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2293 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:02,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2293 Valid, 573 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:57:02,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-10-14 03:57:02,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 173. [2024-10-14 03:57:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 169 states have (on average 1.2485207100591715) internal successors, (211), 172 states have internal predecessors, (211), 0 states have call successors, (0), 0 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-14 03:57:02,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 211 transitions. [2024-10-14 03:57:02,904 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 211 transitions. Word has length 66 [2024-10-14 03:57:02,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:02,905 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 211 transitions. [2024-10-14 03:57:02,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 10 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-14 03:57:02,905 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 211 transitions. [2024-10-14 03:57:02,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 03:57:02,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:02,906 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-14 03:57:02,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 03:57:02,906 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:02,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:02,907 INFO L85 PathProgramCache]: Analyzing trace with hash -785038328, now seen corresponding path program 1 times [2024-10-14 03:57:02,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:02,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62701939] [2024-10-14 03:57:02,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:02,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:03,108 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-14 03:57:03,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:03,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62701939] [2024-10-14 03:57:03,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62701939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:03,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:03,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:03,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218189579] [2024-10-14 03:57:03,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:03,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:03,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:03,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:03,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:03,110 INFO L87 Difference]: Start difference. First operand 173 states and 211 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-14 03:57:03,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:03,389 INFO L93 Difference]: Finished difference Result 265 states and 330 transitions. [2024-10-14 03:57:03,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:57:03,389 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-14 03:57:03,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:03,390 INFO L225 Difference]: With dead ends: 265 [2024-10-14 03:57:03,390 INFO L226 Difference]: Without dead ends: 258 [2024-10-14 03:57:03,391 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-14 03:57:03,391 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 606 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:03,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 533 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:57:03,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-14 03:57:03,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 173. [2024-10-14 03:57:03,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 169 states have (on average 1.242603550295858) internal successors, (210), 172 states have internal predecessors, (210), 0 states have call successors, (0), 0 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-14 03:57:03,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 210 transitions. [2024-10-14 03:57:03,396 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 210 transitions. Word has length 66 [2024-10-14 03:57:03,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:03,396 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 210 transitions. [2024-10-14 03:57:03,396 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-14 03:57:03,396 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 210 transitions. [2024-10-14 03:57:03,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 03:57:03,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:03,397 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-14 03:57:03,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 03:57:03,398 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:03,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:03,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1670965080, now seen corresponding path program 1 times [2024-10-14 03:57:03,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:03,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786480582] [2024-10-14 03:57:03,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:03,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:03,585 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-14 03:57:03,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:03,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786480582] [2024-10-14 03:57:03,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786480582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:03,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:03,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:03,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547321940] [2024-10-14 03:57:03,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:03,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:03,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:03,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:03,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:03,588 INFO L87 Difference]: Start difference. First operand 173 states and 210 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-14 03:57:03,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:03,987 INFO L93 Difference]: Finished difference Result 362 states and 460 transitions. [2024-10-14 03:57:03,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:57:03,988 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-14 03:57:03,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:03,989 INFO L225 Difference]: With dead ends: 362 [2024-10-14 03:57:03,989 INFO L226 Difference]: Without dead ends: 290 [2024-10-14 03:57:03,989 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-14 03:57:03,990 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 427 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:03,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1009 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:57:03,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-14 03:57:03,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 173. [2024-10-14 03:57:03,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 169 states have (on average 1.2366863905325445) internal successors, (209), 172 states have internal predecessors, (209), 0 states have call successors, (0), 0 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-14 03:57:03,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 209 transitions. [2024-10-14 03:57:03,995 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 209 transitions. Word has length 66 [2024-10-14 03:57:03,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:03,995 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 209 transitions. [2024-10-14 03:57:03,995 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-14 03:57:03,995 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 209 transitions. [2024-10-14 03:57:03,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 03:57:03,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:03,996 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-14 03:57:03,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 03:57:03,996 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-14 03:57:03,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:03,997 INFO L85 PathProgramCache]: Analyzing trace with hash -866093357, now seen corresponding path program 1 times [2024-10-14 03:57:03,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:03,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069006123] [2024-10-14 03:57:03,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:03,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:04,172 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-14 03:57:04,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:04,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069006123] [2024-10-14 03:57:04,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069006123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:04,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:04,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:04,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477010552] [2024-10-14 03:57:04,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:04,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:04,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:04,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:04,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:04,174 INFO L87 Difference]: Start difference. First operand 173 states and 209 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 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-14 03:57:04,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:04,485 INFO L93 Difference]: Finished difference Result 265 states and 328 transitions. [2024-10-14 03:57:04,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:57:04,486 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 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-14 03:57:04,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:04,487 INFO L225 Difference]: With dead ends: 265 [2024-10-14 03:57:04,487 INFO L226 Difference]: Without dead ends: 258 [2024-10-14 03:57:04,487 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-14 03:57:04,488 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 623 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:04,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 773 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:57:04,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-14 03:57:04,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 169. [2024-10-14 03:57:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 165 states have (on average 1.2363636363636363) internal successors, (204), 168 states have internal predecessors, (204), 0 states have call successors, (0), 0 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-14 03:57:04,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 204 transitions. [2024-10-14 03:57:04,492 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 204 transitions. Word has length 67 [2024-10-14 03:57:04,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:04,492 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 204 transitions. [2024-10-14 03:57:04,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 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-14 03:57:04,492 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 204 transitions. [2024-10-14 03:57:04,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 03:57:04,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:04,493 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-14 03:57:04,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 03:57:04,493 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:04,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:04,494 INFO L85 PathProgramCache]: Analyzing trace with hash 568525784, now seen corresponding path program 1 times [2024-10-14 03:57:04,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:04,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401853887] [2024-10-14 03:57:04,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:04,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:04,854 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-14 03:57:04,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:04,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401853887] [2024-10-14 03:57:04,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401853887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:04,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:04,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 03:57:04,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372872862] [2024-10-14 03:57:04,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:04,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 03:57:04,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:04,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 03:57:04,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:57:04,857 INFO L87 Difference]: Start difference. First operand 169 states and 204 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 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-14 03:57:05,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:05,150 INFO L93 Difference]: Finished difference Result 238 states and 298 transitions. [2024-10-14 03:57:05,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:57:05,150 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 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-14 03:57:05,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:05,151 INFO L225 Difference]: With dead ends: 238 [2024-10-14 03:57:05,151 INFO L226 Difference]: Without dead ends: 214 [2024-10-14 03:57:05,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:57:05,156 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 883 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:05,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 700 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:57:05,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-14 03:57:05,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 145. [2024-10-14 03:57:05,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 142 states have (on average 1.2464788732394365) internal successors, (177), 144 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-14 03:57:05,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 177 transitions. [2024-10-14 03:57:05,163 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 177 transitions. Word has length 68 [2024-10-14 03:57:05,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:05,163 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 177 transitions. [2024-10-14 03:57:05,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 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-14 03:57:05,163 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 177 transitions. [2024-10-14 03:57:05,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 03:57:05,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:05,164 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-14 03:57:05,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 03:57:05,165 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:05,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:05,165 INFO L85 PathProgramCache]: Analyzing trace with hash 207320224, now seen corresponding path program 1 times [2024-10-14 03:57:05,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:05,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930953070] [2024-10-14 03:57:05,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:05,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:05,791 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-14 03:57:05,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:05,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930953070] [2024-10-14 03:57:05,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930953070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:05,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:05,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 03:57:05,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936930674] [2024-10-14 03:57:05,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:05,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 03:57:05,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:05,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 03:57:05,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-14 03:57:05,794 INFO L87 Difference]: Start difference. First operand 145 states and 177 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:06,441 INFO L93 Difference]: Finished difference Result 300 states and 396 transitions. [2024-10-14 03:57:06,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:57:06,441 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-10-14 03:57:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:06,442 INFO L225 Difference]: With dead ends: 300 [2024-10-14 03:57:06,442 INFO L226 Difference]: Without dead ends: 294 [2024-10-14 03:57:06,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2024-10-14 03:57:06,443 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 680 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:06,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1882 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:57:06,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-14 03:57:06,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 151. [2024-10-14 03:57:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 148 states have (on average 1.25) internal successors, (185), 150 states have internal predecessors, (185), 0 states have call successors, (0), 0 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-14 03:57:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 185 transitions. [2024-10-14 03:57:06,447 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 185 transitions. Word has length 68 [2024-10-14 03:57:06,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:06,447 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 185 transitions. [2024-10-14 03:57:06,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:06,447 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 185 transitions. [2024-10-14 03:57:06,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 03:57:06,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:06,448 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-14 03:57:06,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 03:57:06,448 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:06,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:06,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1386499272, now seen corresponding path program 1 times [2024-10-14 03:57:06,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:06,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639267914] [2024-10-14 03:57:06,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:06,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:07,528 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-14 03:57:07,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:07,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639267914] [2024-10-14 03:57:07,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639267914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:07,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:07,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-10-14 03:57:07,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051859663] [2024-10-14 03:57:07,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:07,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-14 03:57:07,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:07,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-14 03:57:07,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2024-10-14 03:57:07,531 INFO L87 Difference]: Start difference. First operand 151 states and 185 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 22 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-14 03:57:09,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:09,367 INFO L93 Difference]: Finished difference Result 487 states and 635 transitions. [2024-10-14 03:57:09,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 03:57:09,367 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 22 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-14 03:57:09,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:09,369 INFO L225 Difference]: With dead ends: 487 [2024-10-14 03:57:09,369 INFO L226 Difference]: Without dead ends: 479 [2024-10-14 03:57:09,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=248, Invalid=1392, Unknown=0, NotChecked=0, Total=1640 [2024-10-14 03:57:09,370 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 1171 mSDsluCounter, 5609 mSDsCounter, 0 mSdLazyCounter, 2608 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 6035 SdHoareTripleChecker+Invalid, 2608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:09,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 6035 Invalid, 2608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2608 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 03:57:09,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-10-14 03:57:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 165. [2024-10-14 03:57:09,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 162 states have (on average 1.2469135802469136) internal successors, (202), 164 states have internal predecessors, (202), 0 states have call successors, (0), 0 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-14 03:57:09,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 202 transitions. [2024-10-14 03:57:09,377 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 202 transitions. Word has length 68 [2024-10-14 03:57:09,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:09,377 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 202 transitions. [2024-10-14 03:57:09,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 22 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-14 03:57:09,378 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 202 transitions. [2024-10-14 03:57:09,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 03:57:09,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:09,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:09,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 03:57:09,379 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:09,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:09,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1979676551, now seen corresponding path program 1 times [2024-10-14 03:57:09,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:09,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053985349] [2024-10-14 03:57:09,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:09,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:09,919 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-14 03:57:09,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:09,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053985349] [2024-10-14 03:57:09,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053985349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:09,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:09,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 03:57:09,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622871401] [2024-10-14 03:57:09,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:09,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:57:09,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:09,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:57:09,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:57:09,922 INFO L87 Difference]: Start difference. First operand 165 states and 202 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:10,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:10,687 INFO L93 Difference]: Finished difference Result 372 states and 493 transitions. [2024-10-14 03:57:10,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:57:10,687 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-10-14 03:57:10,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:10,688 INFO L225 Difference]: With dead ends: 372 [2024-10-14 03:57:10,688 INFO L226 Difference]: Without dead ends: 357 [2024-10-14 03:57:10,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-14 03:57:10,689 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 744 mSDsluCounter, 2465 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 2867 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:10,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 2867 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:57:10,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-14 03:57:10,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 139. [2024-10-14 03:57:10,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 137 states have (on average 1.2554744525547445) internal successors, (172), 138 states have internal predecessors, (172), 0 states have call successors, (0), 0 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-14 03:57:10,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 172 transitions. [2024-10-14 03:57:10,694 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 172 transitions. Word has length 69 [2024-10-14 03:57:10,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:10,694 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 172 transitions. [2024-10-14 03:57:10,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:10,694 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 172 transitions. [2024-10-14 03:57:10,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 03:57:10,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:10,695 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:10,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 03:57:10,695 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:10,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:10,695 INFO L85 PathProgramCache]: Analyzing trace with hash -296159994, now seen corresponding path program 1 times [2024-10-14 03:57:10,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:10,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220700262] [2024-10-14 03:57:10,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:10,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:11,112 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-14 03:57:11,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:11,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220700262] [2024-10-14 03:57:11,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220700262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:11,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:11,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 03:57:11,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448773889] [2024-10-14 03:57:11,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:11,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 03:57:11,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:11,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 03:57:11,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:57:11,114 INFO L87 Difference]: Start difference. First operand 139 states and 172 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:11,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:11,446 INFO L93 Difference]: Finished difference Result 200 states and 259 transitions. [2024-10-14 03:57:11,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:57:11,446 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-10-14 03:57:11,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:11,447 INFO L225 Difference]: With dead ends: 200 [2024-10-14 03:57:11,447 INFO L226 Difference]: Without dead ends: 194 [2024-10-14 03:57:11,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2024-10-14 03:57:11,448 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 551 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:11,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1090 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:57:11,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-14 03:57:11,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 127. [2024-10-14 03:57:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.253968253968254) internal successors, (158), 126 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:11,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 158 transitions. [2024-10-14 03:57:11,451 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 158 transitions. Word has length 69 [2024-10-14 03:57:11,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:11,451 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 158 transitions. [2024-10-14 03:57:11,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:11,452 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 158 transitions. [2024-10-14 03:57:11,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 03:57:11,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:11,452 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] [2024-10-14 03:57:11,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-14 03:57:11,453 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:11,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:11,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1973108893, now seen corresponding path program 1 times [2024-10-14 03:57:11,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:11,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428498501] [2024-10-14 03:57:11,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:11,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:11,561 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-14 03:57:11,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:11,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428498501] [2024-10-14 03:57:11,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428498501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:11,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:11,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:57:11,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959319348] [2024-10-14 03:57:11,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:11,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:57:11,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:11,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:57:11,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:57:11,564 INFO L87 Difference]: Start difference. First operand 127 states and 158 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 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-14 03:57:11,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:11,670 INFO L93 Difference]: Finished difference Result 559 states and 798 transitions. [2024-10-14 03:57:11,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:57:11,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-10-14 03:57:11,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:11,672 INFO L225 Difference]: With dead ends: 559 [2024-10-14 03:57:11,672 INFO L226 Difference]: Without dead ends: 505 [2024-10-14 03:57:11,673 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-14 03:57:11,674 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 895 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 948 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-14 03:57:11,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 948 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:57:11,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-10-14 03:57:11,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 179. [2024-10-14 03:57:11,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.3202247191011236) internal successors, (235), 178 states have internal predecessors, (235), 0 states have call successors, (0), 0 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-14 03:57:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 235 transitions. [2024-10-14 03:57:11,682 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 235 transitions. Word has length 91 [2024-10-14 03:57:11,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:11,682 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 235 transitions. [2024-10-14 03:57:11,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 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-14 03:57:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 235 transitions. [2024-10-14 03:57:11,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:57:11,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:11,683 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-14 03:57:11,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-14 03:57:11,684 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:11,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:11,684 INFO L85 PathProgramCache]: Analyzing trace with hash -849862238, now seen corresponding path program 1 times [2024-10-14 03:57:11,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:11,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563519483] [2024-10-14 03:57:11,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:11,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:11,791 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-14 03:57:11,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:11,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563519483] [2024-10-14 03:57:11,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563519483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:11,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:11,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:57:11,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90301120] [2024-10-14 03:57:11,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:11,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:57:11,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:11,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:57:11,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:57:11,794 INFO L87 Difference]: Start difference. First operand 179 states and 235 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-14 03:57:11,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:11,872 INFO L93 Difference]: Finished difference Result 657 states and 941 transitions. [2024-10-14 03:57:11,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:57:11,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-14 03:57:11,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:11,875 INFO L225 Difference]: With dead ends: 657 [2024-10-14 03:57:11,875 INFO L226 Difference]: Without dead ends: 551 [2024-10-14 03:57:11,875 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-14 03:57:11,876 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 646 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:11,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 671 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:57:11,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-10-14 03:57:11,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 283. [2024-10-14 03:57:11,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.3829787234042554) internal successors, (390), 282 states have internal predecessors, (390), 0 states have call successors, (0), 0 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-14 03:57:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 390 transitions. [2024-10-14 03:57:11,884 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 390 transitions. Word has length 93 [2024-10-14 03:57:11,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:11,884 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 390 transitions. [2024-10-14 03:57:11,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-14 03:57:11,886 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 390 transitions. [2024-10-14 03:57:11,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:57:11,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:11,887 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-14 03:57:11,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-14 03:57:11,888 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:11,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:11,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1784168805, now seen corresponding path program 1 times [2024-10-14 03:57:11,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:11,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862874761] [2024-10-14 03:57:11,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:11,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:12,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-14 03:57:12,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:12,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862874761] [2024-10-14 03:57:12,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862874761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:12,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:12,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:57:12,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303708139] [2024-10-14 03:57:12,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:12,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:57:12,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:12,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:57:12,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:57:12,084 INFO L87 Difference]: Start difference. First operand 283 states and 390 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-14 03:57:12,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:12,168 INFO L93 Difference]: Finished difference Result 495 states and 703 transitions. [2024-10-14 03:57:12,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:57:12,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-14 03:57:12,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:12,169 INFO L225 Difference]: With dead ends: 495 [2024-10-14 03:57:12,170 INFO L226 Difference]: Without dead ends: 285 [2024-10-14 03:57:12,170 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-14 03:57:12,170 INFO L432 NwaCegarLoop]: 147 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, 453 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-14 03:57:12,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 453 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:57:12,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-10-14 03:57:12,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2024-10-14 03:57:12,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.375886524822695) internal successors, (388), 282 states have internal predecessors, (388), 0 states have call successors, (0), 0 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-14 03:57:12,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 388 transitions. [2024-10-14 03:57:12,178 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 388 transitions. Word has length 93 [2024-10-14 03:57:12,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:12,179 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 388 transitions. [2024-10-14 03:57:12,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-14 03:57:12,179 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 388 transitions. [2024-10-14 03:57:12,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:57:12,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:12,180 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-14 03:57:12,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-14 03:57:12,180 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:12,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:12,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1044428484, now seen corresponding path program 1 times [2024-10-14 03:57:12,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:12,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671399092] [2024-10-14 03:57:12,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:12,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:12,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-14 03:57:12,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:12,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671399092] [2024-10-14 03:57:12,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671399092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:12,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:12,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:57:12,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464555847] [2024-10-14 03:57:12,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:12,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:57:12,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:12,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:57:12,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:57:12,233 INFO L87 Difference]: Start difference. First operand 283 states and 388 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-14 03:57:12,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:12,257 INFO L93 Difference]: Finished difference Result 677 states and 964 transitions. [2024-10-14 03:57:12,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:57:12,258 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-14 03:57:12,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:12,259 INFO L225 Difference]: With dead ends: 677 [2024-10-14 03:57:12,259 INFO L226 Difference]: Without dead ends: 467 [2024-10-14 03:57:12,260 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-14 03:57:12,260 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 89 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 249 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-14 03:57:12,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 249 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:57:12,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-10-14 03:57:12,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 461. [2024-10-14 03:57:12,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.3891304347826088) internal successors, (639), 460 states have internal predecessors, (639), 0 states have call successors, (0), 0 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-14 03:57:12,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 639 transitions. [2024-10-14 03:57:12,268 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 639 transitions. Word has length 93 [2024-10-14 03:57:12,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:12,269 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 639 transitions. [2024-10-14 03:57:12,269 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-14 03:57:12,269 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 639 transitions. [2024-10-14 03:57:12,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:57:12,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:12,270 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-14 03:57:12,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-14 03:57:12,270 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:12,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:12,271 INFO L85 PathProgramCache]: Analyzing trace with hash 136983470, now seen corresponding path program 1 times [2024-10-14 03:57:12,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:12,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823833991] [2024-10-14 03:57:12,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:12,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:12,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-14 03:57:12,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:12,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823833991] [2024-10-14 03:57:12,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823833991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:12,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:12,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:57:12,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670651216] [2024-10-14 03:57:12,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:12,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:57:12,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:12,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:57:12,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:57:12,376 INFO L87 Difference]: Start difference. First operand 461 states and 639 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-14 03:57:12,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:12,458 INFO L93 Difference]: Finished difference Result 1340 states and 1907 transitions. [2024-10-14 03:57:12,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:57:12,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-14 03:57:12,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:12,462 INFO L225 Difference]: With dead ends: 1340 [2024-10-14 03:57:12,463 INFO L226 Difference]: Without dead ends: 1145 [2024-10-14 03:57:12,463 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-14 03:57:12,464 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 614 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:12,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 681 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:57:12,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2024-10-14 03:57:12,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 751. [2024-10-14 03:57:12,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 750 states have (on average 1.4093333333333333) internal successors, (1057), 750 states have internal predecessors, (1057), 0 states have call successors, (0), 0 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-14 03:57:12,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1057 transitions. [2024-10-14 03:57:12,478 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1057 transitions. Word has length 93 [2024-10-14 03:57:12,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:12,478 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1057 transitions. [2024-10-14 03:57:12,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-14 03:57:12,479 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1057 transitions. [2024-10-14 03:57:12,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 03:57:12,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:12,480 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 03:57:12,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-14 03:57:12,480 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:12,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:12,480 INFO L85 PathProgramCache]: Analyzing trace with hash -982436120, now seen corresponding path program 1 times [2024-10-14 03:57:12,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:12,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399827586] [2024-10-14 03:57:12,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:12,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:12,587 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-14 03:57:12,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:12,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399827586] [2024-10-14 03:57:12,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399827586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:12,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:12,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:57:12,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765859756] [2024-10-14 03:57:12,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:12,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:57:12,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:12,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:57:12,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:57:12,590 INFO L87 Difference]: Start difference. First operand 751 states and 1057 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-14 03:57:12,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:12,663 INFO L93 Difference]: Finished difference Result 1533 states and 2186 transitions. [2024-10-14 03:57:12,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:57:12,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-14 03:57:12,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:12,667 INFO L225 Difference]: With dead ends: 1533 [2024-10-14 03:57:12,668 INFO L226 Difference]: Without dead ends: 1338 [2024-10-14 03:57:12,668 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-14 03:57:12,669 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 583 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:12,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 732 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:57:12,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2024-10-14 03:57:12,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 944. [2024-10-14 03:57:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 943 states have (on average 1.4167550371155886) internal successors, (1336), 943 states have internal predecessors, (1336), 0 states have call successors, (0), 0 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-14 03:57:12,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1336 transitions. [2024-10-14 03:57:12,684 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1336 transitions. Word has length 93 [2024-10-14 03:57:12,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:12,684 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1336 transitions. [2024-10-14 03:57:12,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 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-14 03:57:12,685 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1336 transitions. [2024-10-14 03:57:12,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 03:57:12,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:12,686 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-14 03:57:12,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-14 03:57:12,686 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:12,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:12,686 INFO L85 PathProgramCache]: Analyzing trace with hash -584509439, now seen corresponding path program 1 times [2024-10-14 03:57:12,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:12,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108447578] [2024-10-14 03:57:12,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:12,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:12,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:12,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:12,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108447578] [2024-10-14 03:57:12,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108447578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:12,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:12,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:57:12,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632868588] [2024-10-14 03:57:12,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:12,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:57:12,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:12,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:57:12,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:57:12,780 INFO L87 Difference]: Start difference. First operand 944 states and 1336 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-14 03:57:12,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:12,800 INFO L93 Difference]: Finished difference Result 2614 states and 3726 transitions. [2024-10-14 03:57:12,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:57:12,800 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-14 03:57:12,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:12,805 INFO L225 Difference]: With dead ends: 2614 [2024-10-14 03:57:12,805 INFO L226 Difference]: Without dead ends: 1743 [2024-10-14 03:57:12,806 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-14 03:57:12,808 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 72 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 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-14 03:57:12,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 331 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:57:12,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2024-10-14 03:57:12,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1669. [2024-10-14 03:57:12,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1668 states have (on average 1.4142685851318946) internal successors, (2359), 1668 states have internal predecessors, (2359), 0 states have call successors, (0), 0 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-14 03:57:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2359 transitions. [2024-10-14 03:57:12,840 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2359 transitions. Word has length 94 [2024-10-14 03:57:12,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:12,840 INFO L471 AbstractCegarLoop]: Abstraction has 1669 states and 2359 transitions. [2024-10-14 03:57:12,841 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-14 03:57:12,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2359 transitions. [2024-10-14 03:57:12,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 03:57:12,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:12,841 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-14 03:57:12,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-14 03:57:12,842 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:12,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:12,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1030240199, now seen corresponding path program 1 times [2024-10-14 03:57:12,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:12,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124584386] [2024-10-14 03:57:12,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:12,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:12,952 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-14 03:57:12,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:12,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124584386] [2024-10-14 03:57:12,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124584386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:12,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:12,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:57:12,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17638100] [2024-10-14 03:57:12,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:12,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:57:12,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:12,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:57:12,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:57:12,955 INFO L87 Difference]: Start difference. First operand 1669 states and 2359 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-14 03:57:12,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:12,977 INFO L93 Difference]: Finished difference Result 4717 states and 6669 transitions. [2024-10-14 03:57:12,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:57:12,978 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-14 03:57:12,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:12,986 INFO L225 Difference]: With dead ends: 4717 [2024-10-14 03:57:12,986 INFO L226 Difference]: Without dead ends: 3121 [2024-10-14 03:57:12,990 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-14 03:57:12,991 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 65 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 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-14 03:57:12,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 331 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:57:12,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3121 states. [2024-10-14 03:57:13,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3121 to 2975. [2024-10-14 03:57:13,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2975 states, 2974 states have (on average 1.402488231338265) internal successors, (4171), 2974 states have internal predecessors, (4171), 0 states have call successors, (0), 0 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-14 03:57:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 4171 transitions. [2024-10-14 03:57:13,036 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 4171 transitions. Word has length 95 [2024-10-14 03:57:13,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:13,037 INFO L471 AbstractCegarLoop]: Abstraction has 2975 states and 4171 transitions. [2024-10-14 03:57:13,037 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-14 03:57:13,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 4171 transitions. [2024-10-14 03:57:13,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 03:57:13,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:13,038 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-14 03:57:13,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-14 03:57:13,038 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:13,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:13,039 INFO L85 PathProgramCache]: Analyzing trace with hash -176722336, now seen corresponding path program 1 times [2024-10-14 03:57:13,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:13,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175822483] [2024-10-14 03:57:13,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:13,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:13,132 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-14 03:57:13,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:13,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175822483] [2024-10-14 03:57:13,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175822483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:13,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:13,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:57:13,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387152768] [2024-10-14 03:57:13,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:13,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:57:13,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:13,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:57:13,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:57:13,136 INFO L87 Difference]: Start difference. First operand 2975 states and 4171 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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-14 03:57:13,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:13,159 INFO L93 Difference]: Finished difference Result 8491 states and 11853 transitions. [2024-10-14 03:57:13,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:57:13,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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-14 03:57:13,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:13,174 INFO L225 Difference]: With dead ends: 8491 [2024-10-14 03:57:13,174 INFO L226 Difference]: Without dead ends: 5589 [2024-10-14 03:57:13,178 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-14 03:57:13,179 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 55 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 331 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-14 03:57:13,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 331 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:57:13,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5589 states. [2024-10-14 03:57:13,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5589 to 5299. [2024-10-14 03:57:13,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5299 states, 5298 states have (on average 1.3829747074367686) internal successors, (7327), 5298 states have internal predecessors, (7327), 0 states have call successors, (0), 0 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-14 03:57:13,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 7327 transitions. [2024-10-14 03:57:13,270 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 7327 transitions. Word has length 96 [2024-10-14 03:57:13,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:13,271 INFO L471 AbstractCegarLoop]: Abstraction has 5299 states and 7327 transitions. [2024-10-14 03:57:13,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 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-14 03:57:13,271 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 7327 transitions. [2024-10-14 03:57:13,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 03:57:13,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:13,272 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:13,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-14 03:57:13,273 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:13,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:13,273 INFO L85 PathProgramCache]: Analyzing trace with hash -760726548, now seen corresponding path program 1 times [2024-10-14 03:57:13,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:13,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201816323] [2024-10-14 03:57:13,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:13,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:13,472 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-14 03:57:13,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:13,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201816323] [2024-10-14 03:57:13,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201816323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:13,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:13,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:13,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181110677] [2024-10-14 03:57:13,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:13,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:13,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:13,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:13,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:13,474 INFO L87 Difference]: Start difference. First operand 5299 states and 7327 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:13,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:13,772 INFO L93 Difference]: Finished difference Result 15914 states and 21990 transitions. [2024-10-14 03:57:13,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:57:13,773 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-14 03:57:13,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:13,798 INFO L225 Difference]: With dead ends: 15914 [2024-10-14 03:57:13,798 INFO L226 Difference]: Without dead ends: 10682 [2024-10-14 03:57:13,807 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-14 03:57:13,807 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 322 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 592 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-14 03:57:13,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 592 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:57:13,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10682 states. [2024-10-14 03:57:13,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10682 to 5299. [2024-10-14 03:57:13,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5299 states, 5298 states have (on average 1.3827859569648924) internal successors, (7326), 5298 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-14 03:57:13,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 7326 transitions. [2024-10-14 03:57:13,941 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 7326 transitions. Word has length 97 [2024-10-14 03:57:13,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:13,941 INFO L471 AbstractCegarLoop]: Abstraction has 5299 states and 7326 transitions. [2024-10-14 03:57:13,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:13,942 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 7326 transitions. [2024-10-14 03:57:13,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 03:57:13,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:13,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, 1, 1, 1] [2024-10-14 03:57:13,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-14 03:57:13,943 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:13,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:13,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1919987110, now seen corresponding path program 1 times [2024-10-14 03:57:13,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:13,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283890334] [2024-10-14 03:57:13,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:13,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:14,175 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-14 03:57:14,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:14,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283890334] [2024-10-14 03:57:14,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283890334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:14,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:14,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:57:14,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728450827] [2024-10-14 03:57:14,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:14,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:57:14,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:14,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:57:14,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:57:14,177 INFO L87 Difference]: Start difference. First operand 5299 states and 7326 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:14,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:14,214 INFO L93 Difference]: Finished difference Result 5493 states and 7583 transitions. [2024-10-14 03:57:14,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:57:14,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-14 03:57:14,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:14,225 INFO L225 Difference]: With dead ends: 5493 [2024-10-14 03:57:14,225 INFO L226 Difference]: Without dead ends: 5491 [2024-10-14 03:57:14,227 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-14 03:57:14,228 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 752 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-14 03:57:14,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 752 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:57:14,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5491 states. [2024-10-14 03:57:14,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5491 to 5491. [2024-10-14 03:57:14,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5491 states, 5490 states have (on average 1.3621129326047359) internal successors, (7478), 5490 states have internal predecessors, (7478), 0 states have call successors, (0), 0 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-14 03:57:14,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5491 states to 5491 states and 7478 transitions. [2024-10-14 03:57:14,295 INFO L78 Accepts]: Start accepts. Automaton has 5491 states and 7478 transitions. Word has length 99 [2024-10-14 03:57:14,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:14,296 INFO L471 AbstractCegarLoop]: Abstraction has 5491 states and 7478 transitions. [2024-10-14 03:57:14,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:14,296 INFO L276 IsEmpty]: Start isEmpty. Operand 5491 states and 7478 transitions. [2024-10-14 03:57:14,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 03:57:14,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:14,297 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-14 03:57:14,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-14 03:57:14,297 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:14,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:14,298 INFO L85 PathProgramCache]: Analyzing trace with hash -921361998, now seen corresponding path program 1 times [2024-10-14 03:57:14,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:14,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635691347] [2024-10-14 03:57:14,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:14,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:14,414 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-14 03:57:14,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:14,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635691347] [2024-10-14 03:57:14,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635691347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:14,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:14,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:57:14,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199300891] [2024-10-14 03:57:14,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:14,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:57:14,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:14,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:57:14,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:57:14,417 INFO L87 Difference]: Start difference. First operand 5491 states and 7478 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:14,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:14,498 INFO L93 Difference]: Finished difference Result 10333 states and 14139 transitions. [2024-10-14 03:57:14,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:57:14,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-10-14 03:57:14,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:14,515 INFO L225 Difference]: With dead ends: 10333 [2024-10-14 03:57:14,515 INFO L226 Difference]: Without dead ends: 9123 [2024-10-14 03:57:14,521 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-14 03:57:14,521 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 637 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:14,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 736 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:57:14,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9123 states. [2024-10-14 03:57:14,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9123 to 6699. [2024-10-14 03:57:14,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6699 states, 6698 states have (on average 1.36249626754255) internal successors, (9126), 6698 states have internal predecessors, (9126), 0 states have call successors, (0), 0 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-14 03:57:14,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6699 states to 6699 states and 9126 transitions. [2024-10-14 03:57:14,691 INFO L78 Accepts]: Start accepts. Automaton has 6699 states and 9126 transitions. Word has length 99 [2024-10-14 03:57:14,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:14,691 INFO L471 AbstractCegarLoop]: Abstraction has 6699 states and 9126 transitions. [2024-10-14 03:57:14,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:14,692 INFO L276 IsEmpty]: Start isEmpty. Operand 6699 states and 9126 transitions. [2024-10-14 03:57:14,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:57:14,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:14,692 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:14,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-14 03:57:14,693 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:14,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:14,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1329909795, now seen corresponding path program 1 times [2024-10-14 03:57:14,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:14,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063423460] [2024-10-14 03:57:14,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:14,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:14,789 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-14 03:57:14,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:14,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063423460] [2024-10-14 03:57:14,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063423460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:14,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:14,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:57:14,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880301105] [2024-10-14 03:57:14,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:14,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:57:14,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:14,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:57:14,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:57:14,791 INFO L87 Difference]: Start difference. First operand 6699 states and 9126 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:14,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:14,839 INFO L93 Difference]: Finished difference Result 17399 states and 23652 transitions. [2024-10-14 03:57:14,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:57:14,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-14 03:57:14,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:14,858 INFO L225 Difference]: With dead ends: 17399 [2024-10-14 03:57:14,858 INFO L226 Difference]: Without dead ends: 10773 [2024-10-14 03:57:14,867 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-14 03:57:14,868 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 73 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 333 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-14 03:57:14,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 333 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:57:14,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10773 states. [2024-10-14 03:57:14,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10773 to 10067. [2024-10-14 03:57:14,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10067 states, 10066 states have (on average 1.3457182594873833) internal successors, (13546), 10066 states have internal predecessors, (13546), 0 states have call successors, (0), 0 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-14 03:57:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10067 states to 10067 states and 13546 transitions. [2024-10-14 03:57:14,998 INFO L78 Accepts]: Start accepts. Automaton has 10067 states and 13546 transitions. Word has length 100 [2024-10-14 03:57:14,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:14,998 INFO L471 AbstractCegarLoop]: Abstraction has 10067 states and 13546 transitions. [2024-10-14 03:57:14,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:14,998 INFO L276 IsEmpty]: Start isEmpty. Operand 10067 states and 13546 transitions. [2024-10-14 03:57:15,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 03:57:15,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:15,001 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, 1] [2024-10-14 03:57:15,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-14 03:57:15,003 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:15,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:15,004 INFO L85 PathProgramCache]: Analyzing trace with hash -685239100, now seen corresponding path program 1 times [2024-10-14 03:57:15,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:15,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359812321] [2024-10-14 03:57:15,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:15,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:15,096 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-14 03:57:15,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:15,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359812321] [2024-10-14 03:57:15,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359812321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:15,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:15,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:57:15,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314687241] [2024-10-14 03:57:15,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:15,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:57:15,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:15,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:57:15,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:57:15,100 INFO L87 Difference]: Start difference. First operand 10067 states and 13546 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:15,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:15,157 INFO L93 Difference]: Finished difference Result 20063 states and 27016 transitions. [2024-10-14 03:57:15,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:57:15,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2024-10-14 03:57:15,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:15,176 INFO L225 Difference]: With dead ends: 20063 [2024-10-14 03:57:15,176 INFO L226 Difference]: Without dead ends: 10069 [2024-10-14 03:57:15,188 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-14 03:57:15,190 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 69 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 305 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-14 03:57:15,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 305 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:57:15,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10069 states. [2024-10-14 03:57:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10069 to 10067. [2024-10-14 03:57:15,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10067 states, 10066 states have (on average 1.3282336578581364) internal successors, (13370), 10066 states have internal predecessors, (13370), 0 states have call successors, (0), 0 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-14 03:57:15,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10067 states to 10067 states and 13370 transitions. [2024-10-14 03:57:15,440 INFO L78 Accepts]: Start accepts. Automaton has 10067 states and 13370 transitions. Word has length 126 [2024-10-14 03:57:15,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:15,441 INFO L471 AbstractCegarLoop]: Abstraction has 10067 states and 13370 transitions. [2024-10-14 03:57:15,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:15,443 INFO L276 IsEmpty]: Start isEmpty. Operand 10067 states and 13370 transitions. [2024-10-14 03:57:15,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 03:57:15,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:15,446 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, 1] [2024-10-14 03:57:15,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-14 03:57:15,446 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:15,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:15,447 INFO L85 PathProgramCache]: Analyzing trace with hash 861961694, now seen corresponding path program 1 times [2024-10-14 03:57:15,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:15,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454015980] [2024-10-14 03:57:15,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:15,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:15,946 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:15,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:15,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454015980] [2024-10-14 03:57:15,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454015980] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:57:15,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463535600] [2024-10-14 03:57:15,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:15,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:57:15,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:57:15,949 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:57:15,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:57:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:16,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 03:57:16,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:57:17,083 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:17,083 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:57:18,899 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:18,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463535600] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:57:18,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:57:18,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30 [2024-10-14 03:57:18,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137358789] [2024-10-14 03:57:18,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:57:18,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-14 03:57:18,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:18,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-14 03:57:18,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2024-10-14 03:57:18,902 INFO L87 Difference]: Start difference. First operand 10067 states and 13370 transitions. Second operand has 31 states, 31 states have (on average 11.483870967741936) internal successors, (356), 30 states have internal predecessors, (356), 0 states have call successors, (0), 0 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-14 03:57:25,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:25,890 INFO L93 Difference]: Finished difference Result 93508 states and 125197 transitions. [2024-10-14 03:57:25,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2024-10-14 03:57:25,891 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 11.483870967741936) internal successors, (356), 30 states have internal predecessors, (356), 0 states have call successors, (0), 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 126 [2024-10-14 03:57:25,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:26,022 INFO L225 Difference]: With dead ends: 93508 [2024-10-14 03:57:26,022 INFO L226 Difference]: Without dead ends: 83514 [2024-10-14 03:57:26,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10850 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=4401, Invalid=27819, Unknown=0, NotChecked=0, Total=32220 [2024-10-14 03:57:26,069 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 5616 mSDsluCounter, 1898 mSDsCounter, 0 mSdLazyCounter, 3168 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5616 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 3276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 3168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:26,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5616 Valid, 2038 Invalid, 3276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 3168 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 03:57:26,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83514 states. [2024-10-14 03:57:27,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83514 to 56469. [2024-10-14 03:57:27,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56469 states, 56468 states have (on average 1.3225366579301552) internal successors, (74681), 56468 states have internal predecessors, (74681), 0 states have call successors, (0), 0 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-14 03:57:27,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56469 states to 56469 states and 74681 transitions. [2024-10-14 03:57:27,340 INFO L78 Accepts]: Start accepts. Automaton has 56469 states and 74681 transitions. Word has length 126 [2024-10-14 03:57:27,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:27,340 INFO L471 AbstractCegarLoop]: Abstraction has 56469 states and 74681 transitions. [2024-10-14 03:57:27,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 11.483870967741936) internal successors, (356), 30 states have internal predecessors, (356), 0 states have call successors, (0), 0 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-14 03:57:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 56469 states and 74681 transitions. [2024-10-14 03:57:27,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 03:57:27,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:27,355 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:27,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:57:27,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2024-10-14 03:57:27,557 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:27,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:27,557 INFO L85 PathProgramCache]: Analyzing trace with hash -502073740, now seen corresponding path program 1 times [2024-10-14 03:57:27,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:27,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001260102] [2024-10-14 03:57:27,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:27,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:28,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:28,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001260102] [2024-10-14 03:57:28,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001260102] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:57:28,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116845423] [2024-10-14 03:57:28,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:28,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:57:28,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:57:28,261 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:57:28,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 03:57:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:28,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 03:57:28,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:57:29,001 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:29,001 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:57:30,419 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:30,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116845423] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:57:30,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:57:30,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2024-10-14 03:57:30,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533003514] [2024-10-14 03:57:30,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:57:30,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-14 03:57:30,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:30,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-14 03:57:30,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2024-10-14 03:57:30,421 INFO L87 Difference]: Start difference. First operand 56469 states and 74681 transitions. Second operand has 27 states, 27 states have (on average 11.185185185185185) internal successors, (302), 26 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-14 03:57:31,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:31,983 INFO L93 Difference]: Finished difference Result 259439 states and 341859 transitions. [2024-10-14 03:57:31,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 03:57:31,984 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 11.185185185185185) internal successors, (302), 26 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) Word has length 127 [2024-10-14 03:57:31,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:32,467 INFO L225 Difference]: With dead ends: 259439 [2024-10-14 03:57:32,467 INFO L226 Difference]: Without dead ends: 203094 [2024-10-14 03:57:32,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=459, Invalid=1797, Unknown=0, NotChecked=0, Total=2256 [2024-10-14 03:57:32,536 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 1559 mSDsluCounter, 1705 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:32,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1559 Valid, 1868 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:57:32,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203094 states. [2024-10-14 03:57:34,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203094 to 121165. [2024-10-14 03:57:34,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121165 states, 121164 states have (on average 1.3131458188900993) internal successors, (159106), 121164 states have internal predecessors, (159106), 0 states have call successors, (0), 0 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-14 03:57:35,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121165 states to 121165 states and 159106 transitions. [2024-10-14 03:57:35,114 INFO L78 Accepts]: Start accepts. Automaton has 121165 states and 159106 transitions. Word has length 127 [2024-10-14 03:57:35,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:35,114 INFO L471 AbstractCegarLoop]: Abstraction has 121165 states and 159106 transitions. [2024-10-14 03:57:35,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 11.185185185185185) internal successors, (302), 26 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-14 03:57:35,115 INFO L276 IsEmpty]: Start isEmpty. Operand 121165 states and 159106 transitions. [2024-10-14 03:57:35,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-14 03:57:35,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:35,149 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:35,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 03:57:35,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-10-14 03:57:35,353 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2024-10-14 03:57:35,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:35,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1448238977, now seen corresponding path program 1 times [2024-10-14 03:57:35,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:35,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451213108] [2024-10-14 03:57:35,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:35,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:35,615 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-14 03:57:35,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:35,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451213108] [2024-10-14 03:57:35,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451213108] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:57:35,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614367381] [2024-10-14 03:57:35,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:35,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:57:35,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:57:35,618 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:57:35,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 03:57:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:35,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 03:57:35,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:57:36,769 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:36,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:57:38,143 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:38,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614367381] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:57:38,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:57:38,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2024-10-14 03:57:38,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515543006] [2024-10-14 03:57:38,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:57:38,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-14 03:57:38,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:38,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-14 03:57:38,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2024-10-14 03:57:38,145 INFO L87 Difference]: Start difference. First operand 121165 states and 159106 transitions. Second operand has 29 states, 29 states have (on average 12.275862068965518) internal successors, (356), 28 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)