./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/sll-01-1.i -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.graphml --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 ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:20:37,788 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:20:37,790 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:20:37,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:20:37,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:20:37,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:20:37,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:20:37,852 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:20:37,854 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:20:37,860 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:20:37,861 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:20:37,861 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:20:37,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:20:37,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:20:37,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:20:37,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:20:37,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:20:37,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:20:37,873 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:20:37,874 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:20:37,880 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:20:37,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:20:37,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:20:37,882 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:20:37,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:20:37,885 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:20:37,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:20:37,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:20:37,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:20:37,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:20:37,887 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:20:37,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:20:37,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:20:37,888 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:20:37,889 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:20:37,890 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:20:37,890 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:20:37,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:20:37,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:20:37,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:20:37,894 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:20:37,896 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:20:37,897 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:20:37,927 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:20:37,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:20:37,928 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:20:37,928 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:20:37,929 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:20:37,929 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:20:37,930 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:20:37,930 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:20:37,930 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:20:37,931 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:20:37,931 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:20:37,932 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:20:37,932 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:20:37,932 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:20:37,932 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:20:37,932 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:20:37,933 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:20:37,933 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:20:37,933 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:20:37,933 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:20:37,933 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:20:37,934 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:20:37,934 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:20:37,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:20:37,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:20:37,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:20:37,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:20:37,936 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:20:37,936 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:20:37,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:20:37,937 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:20:37,937 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:20:37,937 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:20:37,937 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d [2022-07-12 03:20:38,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:20:38,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:20:38,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:20:38,193 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:20:38,195 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:20:38,197 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-1.i [2022-07-12 03:20:38,276 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37704bf40/42d387d62d314fa0bbbe37a475b66190/FLAG7ba273928 [2022-07-12 03:20:38,800 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:20:38,800 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i [2022-07-12 03:20:38,813 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37704bf40/42d387d62d314fa0bbbe37a475b66190/FLAG7ba273928 [2022-07-12 03:20:39,281 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37704bf40/42d387d62d314fa0bbbe37a475b66190 [2022-07-12 03:20:39,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:20:39,284 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:20:39,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:20:39,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:20:39,289 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:20:39,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:20:39" (1/1) ... [2022-07-12 03:20:39,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9919d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:39, skipping insertion in model container [2022-07-12 03:20:39,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:20:39" (1/1) ... [2022-07-12 03:20:39,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:20:39,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:20:39,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22034,22047] [2022-07-12 03:20:39,586 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22307,22320] [2022-07-12 03:20:39,591 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2022-07-12 03:20:39,593 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22586,22599] [2022-07-12 03:20:39,600 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2022-07-12 03:20:39,603 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2022-07-12 03:20:39,605 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23192,23205] [2022-07-12 03:20:39,606 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23272,23285] [2022-07-12 03:20:39,607 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23351,23364] [2022-07-12 03:20:39,608 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23441,23454] [2022-07-12 03:20:39,609 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23619,23632] [2022-07-12 03:20:39,612 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23697,23710] [2022-07-12 03:20:39,613 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23774,23787] [2022-07-12 03:20:39,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:20:39,627 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:20:39,657 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22034,22047] [2022-07-12 03:20:39,659 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22307,22320] [2022-07-12 03:20:39,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2022-07-12 03:20:39,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22586,22599] [2022-07-12 03:20:39,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2022-07-12 03:20:39,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2022-07-12 03:20:39,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23192,23205] [2022-07-12 03:20:39,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23272,23285] [2022-07-12 03:20:39,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23351,23364] [2022-07-12 03:20:39,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23441,23454] [2022-07-12 03:20:39,668 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23619,23632] [2022-07-12 03:20:39,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23697,23710] [2022-07-12 03:20:39,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23774,23787] [2022-07-12 03:20:39,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:20:39,691 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:20:39,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:39 WrapperNode [2022-07-12 03:20:39,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:20:39,693 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:20:39,693 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:20:39,693 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:20:39,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:39" (1/1) ... [2022-07-12 03:20:39,711 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:39" (1/1) ... [2022-07-12 03:20:39,739 INFO L137 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 221 [2022-07-12 03:20:39,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:20:39,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:20:39,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:20:39,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:20:39,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:39" (1/1) ... [2022-07-12 03:20:39,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:39" (1/1) ... [2022-07-12 03:20:39,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:39" (1/1) ... [2022-07-12 03:20:39,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:39" (1/1) ... [2022-07-12 03:20:39,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:39" (1/1) ... [2022-07-12 03:20:39,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:39" (1/1) ... [2022-07-12 03:20:39,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:39" (1/1) ... [2022-07-12 03:20:39,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:20:39,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:20:39,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:20:39,783 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:20:39,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:39" (1/1) ... [2022-07-12 03:20:39,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:20:39,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:20:39,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 03:20:39,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 03:20:39,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:20:39,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:20:39,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:20:39,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:20:39,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:20:39,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:20:39,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:20:39,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:20:39,934 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:20:39,935 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:20:40,215 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:20:40,221 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:20:40,222 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-12 03:20:40,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:20:40 BoogieIcfgContainer [2022-07-12 03:20:40,224 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:20:40,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:20:40,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:20:40,229 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:20:40,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:20:39" (1/3) ... [2022-07-12 03:20:40,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b470e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:20:40, skipping insertion in model container [2022-07-12 03:20:40,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:39" (2/3) ... [2022-07-12 03:20:40,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b470e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:20:40, skipping insertion in model container [2022-07-12 03:20:40,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:20:40" (3/3) ... [2022-07-12 03:20:40,232 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2022-07-12 03:20:40,244 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:20:40,245 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-07-12 03:20:40,299 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:20:40,313 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@24e87e53, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@29537795 [2022-07-12 03:20:40,314 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-07-12 03:20:40,318 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:40,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-12 03:20:40,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:40,325 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-12 03:20:40,325 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:40,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:40,330 INFO L85 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2022-07-12 03:20:40,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:40,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676526246] [2022-07-12 03:20:40,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:40,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:40,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:40,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:40,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676526246] [2022-07-12 03:20:40,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676526246] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:40,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:40,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:20:40,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129718984] [2022-07-12 03:20:40,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:40,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:20:40,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:40,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:20:40,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:40,593 INFO L87 Difference]: Start difference. First operand has 83 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:40,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:40,657 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2022-07-12 03:20:40,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:20:40,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-07-12 03:20:40,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:40,668 INFO L225 Difference]: With dead ends: 180 [2022-07-12 03:20:40,668 INFO L226 Difference]: Without dead ends: 95 [2022-07-12 03:20:40,678 INFO L412 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 [2022-07-12 03:20:40,682 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 83 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:40,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 102 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:20:40,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-12 03:20:40,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2022-07-12 03:20:40,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.323076923076923) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:40,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2022-07-12 03:20:40,719 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 4 [2022-07-12 03:20:40,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:40,719 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2022-07-12 03:20:40,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:40,720 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2022-07-12 03:20:40,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 03:20:40,720 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:40,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:40,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:20:40,723 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:40,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:40,725 INFO L85 PathProgramCache]: Analyzing trace with hash 261454926, now seen corresponding path program 1 times [2022-07-12 03:20:40,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:40,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694900372] [2022-07-12 03:20:40,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:40,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:40,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:40,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:40,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694900372] [2022-07-12 03:20:40,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694900372] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:40,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:40,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:20:40,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087158758] [2022-07-12 03:20:40,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:40,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:20:40,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:40,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:20:40,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:40,789 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:40,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:40,810 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-07-12 03:20:40,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:20:40,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-07-12 03:20:40,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:40,817 INFO L225 Difference]: With dead ends: 80 [2022-07-12 03:20:40,818 INFO L226 Difference]: Without dead ends: 78 [2022-07-12 03:20:40,818 INFO L412 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 [2022-07-12 03:20:40,819 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:40,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:20:40,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-12 03:20:40,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-07-12 03:20:40,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 77 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:40,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2022-07-12 03:20:40,833 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 10 [2022-07-12 03:20:40,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:40,833 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2022-07-12 03:20:40,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:40,836 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2022-07-12 03:20:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 03:20:40,836 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:40,837 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:40,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:20:40,837 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:40,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:40,838 INFO L85 PathProgramCache]: Analyzing trace with hash 261456848, now seen corresponding path program 1 times [2022-07-12 03:20:40,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:40,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617850483] [2022-07-12 03:20:40,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:40,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:40,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:40,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617850483] [2022-07-12 03:20:40,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617850483] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:40,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:40,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:40,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958067471] [2022-07-12 03:20:40,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:40,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:40,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:40,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:40,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:40,931 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:41,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:41,018 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-07-12 03:20:41,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:20:41,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-07-12 03:20:41,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:41,020 INFO L225 Difference]: With dead ends: 79 [2022-07-12 03:20:41,021 INFO L226 Difference]: Without dead ends: 77 [2022-07-12 03:20:41,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:41,022 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:41,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 219 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:20:41,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-12 03:20:41,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-07-12 03:20:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.3125) internal successors, (84), 74 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:41,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2022-07-12 03:20:41,028 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 10 [2022-07-12 03:20:41,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:41,028 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2022-07-12 03:20:41,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:41,028 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2022-07-12 03:20:41,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 03:20:41,029 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:41,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:41,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:20:41,029 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:41,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:41,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1712619113, now seen corresponding path program 1 times [2022-07-12 03:20:41,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:41,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230950902] [2022-07-12 03:20:41,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:41,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:41,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:41,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:41,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230950902] [2022-07-12 03:20:41,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230950902] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:41,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:41,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:20:41,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340039027] [2022-07-12 03:20:41,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:41,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:20:41,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:41,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:20:41,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:41,090 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:41,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:41,129 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2022-07-12 03:20:41,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:20:41,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-07-12 03:20:41,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:41,131 INFO L225 Difference]: With dead ends: 78 [2022-07-12 03:20:41,131 INFO L226 Difference]: Without dead ends: 74 [2022-07-12 03:20:41,131 INFO L412 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 [2022-07-12 03:20:41,132 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 16 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:41,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 125 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:20:41,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-12 03:20:41,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2022-07-12 03:20:41,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 70 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:41,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2022-07-12 03:20:41,139 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 15 [2022-07-12 03:20:41,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:41,139 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2022-07-12 03:20:41,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:41,140 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2022-07-12 03:20:41,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 03:20:41,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:41,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:41,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 03:20:41,141 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:41,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:41,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1551589151, now seen corresponding path program 1 times [2022-07-12 03:20:41,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:41,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803506121] [2022-07-12 03:20:41,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:41,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:41,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:41,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:41,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803506121] [2022-07-12 03:20:41,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803506121] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:41,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:41,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:41,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014722224] [2022-07-12 03:20:41,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:41,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:41,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:41,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:41,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:41,194 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:41,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:41,307 INFO L93 Difference]: Finished difference Result 187 states and 209 transitions. [2022-07-12 03:20:41,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:20:41,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-07-12 03:20:41,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:41,311 INFO L225 Difference]: With dead ends: 187 [2022-07-12 03:20:41,311 INFO L226 Difference]: Without dead ends: 124 [2022-07-12 03:20:41,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:20:41,315 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 55 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:41,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 187 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:20:41,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-12 03:20:41,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 73. [2022-07-12 03:20:41,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.28125) internal successors, (82), 72 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:41,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2022-07-12 03:20:41,333 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 16 [2022-07-12 03:20:41,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:41,334 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2022-07-12 03:20:41,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:41,334 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2022-07-12 03:20:41,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 03:20:41,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:41,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:41,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 03:20:41,336 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:41,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:41,338 INFO L85 PathProgramCache]: Analyzing trace with hash -2063319775, now seen corresponding path program 1 times [2022-07-12 03:20:41,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:41,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944087660] [2022-07-12 03:20:41,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:41,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:41,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:41,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:41,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944087660] [2022-07-12 03:20:41,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944087660] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:41,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:41,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:41,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292854521] [2022-07-12 03:20:41,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:41,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:41,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:41,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:41,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:41,405 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:41,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:41,480 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2022-07-12 03:20:41,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:20:41,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-07-12 03:20:41,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:41,482 INFO L225 Difference]: With dead ends: 132 [2022-07-12 03:20:41,482 INFO L226 Difference]: Without dead ends: 112 [2022-07-12 03:20:41,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:20:41,486 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 128 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:41,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 116 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:20:41,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-12 03:20:41,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 72. [2022-07-12 03:20:41,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.265625) internal successors, (81), 71 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:41,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2022-07-12 03:20:41,493 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 16 [2022-07-12 03:20:41,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:41,493 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2022-07-12 03:20:41,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:41,494 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2022-07-12 03:20:41,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 03:20:41,494 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:41,495 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:41,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 03:20:41,495 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:41,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:41,496 INFO L85 PathProgramCache]: Analyzing trace with hash -940628212, now seen corresponding path program 1 times [2022-07-12 03:20:41,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:41,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275640444] [2022-07-12 03:20:41,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:41,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:41,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:41,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:41,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275640444] [2022-07-12 03:20:41,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275640444] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:41,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:41,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:20:41,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706886119] [2022-07-12 03:20:41,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:41,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:20:41,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:41,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:20:41,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:41,535 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:41,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:41,545 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2022-07-12 03:20:41,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:20:41,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-07-12 03:20:41,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:41,546 INFO L225 Difference]: With dead ends: 137 [2022-07-12 03:20:41,547 INFO L226 Difference]: Without dead ends: 96 [2022-07-12 03:20:41,547 INFO L412 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 [2022-07-12 03:20:41,548 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 24 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:41,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 149 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:20:41,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-12 03:20:41,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2022-07-12 03:20:41,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 74 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:41,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2022-07-12 03:20:41,553 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2022-07-12 03:20:41,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:41,553 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2022-07-12 03:20:41,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:41,553 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2022-07-12 03:20:41,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 03:20:41,554 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:41,554 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:41,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 03:20:41,555 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:41,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:41,555 INFO L85 PathProgramCache]: Analyzing trace with hash 905291998, now seen corresponding path program 1 times [2022-07-12 03:20:41,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:41,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111913691] [2022-07-12 03:20:41,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:41,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:41,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:41,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:41,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111913691] [2022-07-12 03:20:41,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111913691] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:41,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:41,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:20:41,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873853089] [2022-07-12 03:20:41,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:41,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:20:41,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:41,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:20:41,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:41,616 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:41,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:41,632 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2022-07-12 03:20:41,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:20:41,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-07-12 03:20:41,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:41,634 INFO L225 Difference]: With dead ends: 75 [2022-07-12 03:20:41,634 INFO L226 Difference]: Without dead ends: 73 [2022-07-12 03:20:41,634 INFO L412 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 [2022-07-12 03:20:41,635 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 13 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:41,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 129 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:20:41,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-12 03:20:41,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-07-12 03:20:41,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:41,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-07-12 03:20:41,640 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 21 [2022-07-12 03:20:41,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:41,640 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-07-12 03:20:41,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:41,641 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-07-12 03:20:41,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 03:20:41,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:41,642 INFO L195 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] [2022-07-12 03:20:41,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 03:20:41,642 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:41,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:41,643 INFO L85 PathProgramCache]: Analyzing trace with hash 886650935, now seen corresponding path program 1 times [2022-07-12 03:20:41,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:41,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169652780] [2022-07-12 03:20:41,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:41,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:41,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:41,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169652780] [2022-07-12 03:20:41,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169652780] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:41,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:41,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:41,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253957684] [2022-07-12 03:20:41,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:41,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:41,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:41,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:41,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:41,697 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:41,746 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2022-07-12 03:20:41,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:20:41,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-07-12 03:20:41,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:41,747 INFO L225 Difference]: With dead ends: 74 [2022-07-12 03:20:41,747 INFO L226 Difference]: Without dead ends: 72 [2022-07-12 03:20:41,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:41,749 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:41,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:20:41,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-12 03:20:41,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2022-07-12 03:20:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 70 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-07-12 03:20:41,753 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 23 [2022-07-12 03:20:41,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:41,754 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-07-12 03:20:41,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:41,754 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-07-12 03:20:41,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 03:20:41,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:41,755 INFO L195 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] [2022-07-12 03:20:41,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 03:20:41,756 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:41,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:41,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1458355201, now seen corresponding path program 1 times [2022-07-12 03:20:41,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:41,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038565251] [2022-07-12 03:20:41,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:41,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:41,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:41,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038565251] [2022-07-12 03:20:41,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038565251] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:41,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:41,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:20:41,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806677903] [2022-07-12 03:20:41,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:41,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:20:41,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:41,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:20:41,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:20:41,843 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:42,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:42,018 INFO L93 Difference]: Finished difference Result 175 states and 199 transitions. [2022-07-12 03:20:42,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 03:20:42,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-07-12 03:20:42,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:42,021 INFO L225 Difference]: With dead ends: 175 [2022-07-12 03:20:42,021 INFO L226 Difference]: Without dead ends: 133 [2022-07-12 03:20:42,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-12 03:20:42,025 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 115 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:42,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 281 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:20:42,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-12 03:20:42,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 81. [2022-07-12 03:20:42,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 80 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:42,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2022-07-12 03:20:42,031 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 24 [2022-07-12 03:20:42,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:42,032 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2022-07-12 03:20:42,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:42,032 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2022-07-12 03:20:42,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-12 03:20:42,035 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:42,035 INFO L195 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] [2022-07-12 03:20:42,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 03:20:42,035 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:42,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:42,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1357759361, now seen corresponding path program 1 times [2022-07-12 03:20:42,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:42,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564217722] [2022-07-12 03:20:42,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:42,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:42,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:42,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:42,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564217722] [2022-07-12 03:20:42,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564217722] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:42,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:42,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 03:20:42,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115729971] [2022-07-12 03:20:42,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:42,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:20:42,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:42,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:20:42,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:20:42,345 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:42,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:42,684 INFO L93 Difference]: Finished difference Result 234 states and 259 transitions. [2022-07-12 03:20:42,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 03:20:42,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-07-12 03:20:42,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:42,687 INFO L225 Difference]: With dead ends: 234 [2022-07-12 03:20:42,687 INFO L226 Difference]: Without dead ends: 232 [2022-07-12 03:20:42,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:20:42,688 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 243 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:42,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 420 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:20:42,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-12 03:20:42,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 93. [2022-07-12 03:20:42,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 92 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2022-07-12 03:20:42,695 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 24 [2022-07-12 03:20:42,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:42,695 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2022-07-12 03:20:42,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:42,695 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2022-07-12 03:20:42,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 03:20:42,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:42,696 INFO L195 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] [2022-07-12 03:20:42,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 03:20:42,696 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:42,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:42,697 INFO L85 PathProgramCache]: Analyzing trace with hash 680714775, now seen corresponding path program 1 times [2022-07-12 03:20:42,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:42,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061591237] [2022-07-12 03:20:42,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:42,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:42,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:20:42,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:42,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061591237] [2022-07-12 03:20:42,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061591237] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:42,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:42,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:20:42,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703940549] [2022-07-12 03:20:42,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:42,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:20:42,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:42,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:20:42,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:20:42,765 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:42,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:42,854 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2022-07-12 03:20:42,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:20:42,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-07-12 03:20:42,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:42,856 INFO L225 Difference]: With dead ends: 139 [2022-07-12 03:20:42,856 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 03:20:42,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:20:42,856 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 57 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:42,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 186 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:20:42,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 03:20:42,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2022-07-12 03:20:42,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 107 states have (on average 1.2429906542056075) internal successors, (133), 112 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:42,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2022-07-12 03:20:42,863 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 26 [2022-07-12 03:20:42,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:42,863 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2022-07-12 03:20:42,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:42,863 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2022-07-12 03:20:42,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 03:20:42,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:42,864 INFO L195 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] [2022-07-12 03:20:42,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 03:20:42,864 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:42,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:42,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1502606953, now seen corresponding path program 1 times [2022-07-12 03:20:42,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:42,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439568989] [2022-07-12 03:20:42,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:42,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:42,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:20:42,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:42,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439568989] [2022-07-12 03:20:42,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439568989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:42,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:42,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:20:42,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371761659] [2022-07-12 03:20:42,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:42,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:20:42,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:42,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:20:42,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:42,930 INFO L87 Difference]: Start difference. First operand 113 states and 133 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:42,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:42,962 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2022-07-12 03:20:42,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:20:42,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-07-12 03:20:42,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:42,963 INFO L225 Difference]: With dead ends: 113 [2022-07-12 03:20:42,963 INFO L226 Difference]: Without dead ends: 111 [2022-07-12 03:20:42,963 INFO L412 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 [2022-07-12 03:20:42,964 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 49 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:42,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 76 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:20:42,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-12 03:20:42,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-07-12 03:20:42,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.2358490566037736) internal successors, (131), 110 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:42,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2022-07-12 03:20:42,969 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 26 [2022-07-12 03:20:42,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:42,970 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2022-07-12 03:20:42,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:42,970 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2022-07-12 03:20:42,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 03:20:42,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:42,971 INFO L195 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] [2022-07-12 03:20:42,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 03:20:42,971 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:42,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:42,971 INFO L85 PathProgramCache]: Analyzing trace with hash -988757936, now seen corresponding path program 1 times [2022-07-12 03:20:42,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:42,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544884318] [2022-07-12 03:20:42,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:42,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:43,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:43,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:43,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544884318] [2022-07-12 03:20:43,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544884318] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:43,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:43,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 03:20:43,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094653642] [2022-07-12 03:20:43,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:43,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:20:43,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:43,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:20:43,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:20:43,189 INFO L87 Difference]: Start difference. First operand 111 states and 131 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:43,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:43,492 INFO L93 Difference]: Finished difference Result 268 states and 308 transitions. [2022-07-12 03:20:43,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 03:20:43,492 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-07-12 03:20:43,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:43,494 INFO L225 Difference]: With dead ends: 268 [2022-07-12 03:20:43,494 INFO L226 Difference]: Without dead ends: 266 [2022-07-12 03:20:43,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:20:43,495 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 248 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:43,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 384 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:20:43,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-12 03:20:43,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 114. [2022-07-12 03:20:43,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 109 states have (on average 1.2293577981651376) internal successors, (134), 113 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2022-07-12 03:20:43,504 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 27 [2022-07-12 03:20:43,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:43,505 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2022-07-12 03:20:43,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2022-07-12 03:20:43,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 03:20:43,505 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:43,506 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 03:20:43,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 03:20:43,507 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:43,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:43,507 INFO L85 PathProgramCache]: Analyzing trace with hash -937634650, now seen corresponding path program 1 times [2022-07-12 03:20:43,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:43,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433296372] [2022-07-12 03:20:43,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:43,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:43,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:43,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:43,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433296372] [2022-07-12 03:20:43,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433296372] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:20:43,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620183728] [2022-07-12 03:20:43,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:43,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:20:43,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:20:43,589 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) [2022-07-12 03:20:43,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 03:20:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:43,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 03:20:43,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:43,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:20:43,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:20:43,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:43,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 03:20:43,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:43,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 03:20:44,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:20:44,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:20:44,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:44,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:20:44,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:44,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620183728] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:20:44,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:20:44,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-07-12 03:20:44,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315934236] [2022-07-12 03:20:44,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:20:44,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:20:44,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:44,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:20:44,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:20:44,134 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:44,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:44,266 INFO L93 Difference]: Finished difference Result 199 states and 229 transitions. [2022-07-12 03:20:44,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:20:44,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 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 29 [2022-07-12 03:20:44,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:44,267 INFO L225 Difference]: With dead ends: 199 [2022-07-12 03:20:44,267 INFO L226 Difference]: Without dead ends: 139 [2022-07-12 03:20:44,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-12 03:20:44,268 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 147 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:44,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 166 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:20:44,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-12 03:20:44,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 116. [2022-07-12 03:20:44,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.2072072072072073) internal successors, (134), 115 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:44,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2022-07-12 03:20:44,275 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 29 [2022-07-12 03:20:44,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:44,276 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2022-07-12 03:20:44,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:44,276 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2022-07-12 03:20:44,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 03:20:44,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:44,278 INFO L195 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] [2022-07-12 03:20:44,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:20:44,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-12 03:20:44,493 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:44,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:44,494 INFO L85 PathProgramCache]: Analyzing trace with hash -2010394174, now seen corresponding path program 1 times [2022-07-12 03:20:44,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:44,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828437748] [2022-07-12 03:20:44,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:44,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:44,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:44,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:44,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828437748] [2022-07-12 03:20:44,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828437748] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:44,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:44,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:20:44,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027904561] [2022-07-12 03:20:44,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:44,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:20:44,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:44,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:20:44,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:20:44,677 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:44,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:44,810 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2022-07-12 03:20:44,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:20:44,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-07-12 03:20:44,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:44,811 INFO L225 Difference]: With dead ends: 159 [2022-07-12 03:20:44,811 INFO L226 Difference]: Without dead ends: 139 [2022-07-12 03:20:44,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:20:44,812 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 152 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:44,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 200 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:20:44,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-12 03:20:44,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 115. [2022-07-12 03:20:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.2) internal successors, (132), 114 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:44,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2022-07-12 03:20:44,821 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 29 [2022-07-12 03:20:44,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:44,821 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2022-07-12 03:20:44,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:44,822 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2022-07-12 03:20:44,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 03:20:44,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:44,822 INFO L195 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] [2022-07-12 03:20:44,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 03:20:44,823 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:44,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:44,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1521997910, now seen corresponding path program 1 times [2022-07-12 03:20:44,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:44,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461617039] [2022-07-12 03:20:44,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:44,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:44,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:44,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:44,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461617039] [2022-07-12 03:20:44,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461617039] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:44,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:44,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:20:44,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212561690] [2022-07-12 03:20:44,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:44,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:20:44,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:44,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:20:44,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:44,871 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:44,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:44,886 INFO L93 Difference]: Finished difference Result 220 states and 257 transitions. [2022-07-12 03:20:44,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:20:44,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-07-12 03:20:44,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:44,887 INFO L225 Difference]: With dead ends: 220 [2022-07-12 03:20:44,887 INFO L226 Difference]: Without dead ends: 165 [2022-07-12 03:20:44,889 INFO L412 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 [2022-07-12 03:20:44,889 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 26 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:44,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 164 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:20:44,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-12 03:20:44,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 138. [2022-07-12 03:20:44,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 133 states have (on average 1.2105263157894737) internal successors, (161), 137 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 161 transitions. [2022-07-12 03:20:44,905 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 161 transitions. Word has length 31 [2022-07-12 03:20:44,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:44,905 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 161 transitions. [2022-07-12 03:20:44,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:44,905 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 161 transitions. [2022-07-12 03:20:44,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 03:20:44,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:44,906 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 03:20:44,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 03:20:44,906 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:44,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:44,907 INFO L85 PathProgramCache]: Analyzing trace with hash 914215427, now seen corresponding path program 1 times [2022-07-12 03:20:44,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:44,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045145807] [2022-07-12 03:20:44,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:44,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:45,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:45,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:45,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045145807] [2022-07-12 03:20:45,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045145807] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:20:45,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276383770] [2022-07-12 03:20:45,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:45,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:20:45,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:20:45,014 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) [2022-07-12 03:20:45,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 03:20:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:45,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 03:20:45,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:45,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:20:45,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:20:45,165 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 03:20:45,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 03:20:45,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:45,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 03:20:45,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:20:45,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 03:20:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:20:45,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:20:45,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:20:45,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276383770] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:20:45,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:20:45,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2022-07-12 03:20:45,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720374283] [2022-07-12 03:20:45,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:20:45,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:20:45,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:45,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:20:45,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:20:45,307 INFO L87 Difference]: Start difference. First operand 138 states and 161 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:45,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:45,468 INFO L93 Difference]: Finished difference Result 247 states and 282 transitions. [2022-07-12 03:20:45,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:20:45,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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 32 [2022-07-12 03:20:45,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:45,469 INFO L225 Difference]: With dead ends: 247 [2022-07-12 03:20:45,470 INFO L226 Difference]: Without dead ends: 216 [2022-07-12 03:20:45,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 03:20:45,470 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 95 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:45,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 286 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:20:45,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-12 03:20:45,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 165. [2022-07-12 03:20:45,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 160 states have (on average 1.2375) internal successors, (198), 164 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:45,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 198 transitions. [2022-07-12 03:20:45,482 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 198 transitions. Word has length 32 [2022-07-12 03:20:45,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:45,482 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 198 transitions. [2022-07-12 03:20:45,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:45,483 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 198 transitions. [2022-07-12 03:20:45,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 03:20:45,483 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:45,484 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 03:20:45,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 03:20:45,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-12 03:20:45,697 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:45,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:45,698 INFO L85 PathProgramCache]: Analyzing trace with hash 191981961, now seen corresponding path program 1 times [2022-07-12 03:20:45,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:45,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091995507] [2022-07-12 03:20:45,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:45,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:45,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:45,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091995507] [2022-07-12 03:20:45,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091995507] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:45,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:45,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:20:45,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692752765] [2022-07-12 03:20:45,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:45,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:20:45,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:45,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:20:45,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:20:45,794 INFO L87 Difference]: Start difference. First operand 165 states and 198 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:45,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:45,854 INFO L93 Difference]: Finished difference Result 231 states and 274 transitions. [2022-07-12 03:20:45,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:20:45,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2022-07-12 03:20:45,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:45,855 INFO L225 Difference]: With dead ends: 231 [2022-07-12 03:20:45,855 INFO L226 Difference]: Without dead ends: 117 [2022-07-12 03:20:45,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:20:45,856 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 24 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:45,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 188 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:20:45,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-12 03:20:45,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-07-12 03:20:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 113 states have (on average 1.1592920353982301) internal successors, (131), 116 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2022-07-12 03:20:45,863 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 35 [2022-07-12 03:20:45,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:45,864 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2022-07-12 03:20:45,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2022-07-12 03:20:45,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 03:20:45,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:45,865 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 03:20:45,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 03:20:45,865 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:45,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:45,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1562646056, now seen corresponding path program 1 times [2022-07-12 03:20:45,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:45,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498639091] [2022-07-12 03:20:45,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:45,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:46,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:46,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498639091] [2022-07-12 03:20:46,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498639091] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:20:46,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71574193] [2022-07-12 03:20:46,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:46,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:20:46,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:20:46,011 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) [2022-07-12 03:20:46,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 03:20:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:46,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-12 03:20:46,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:46,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:20:46,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:20:46,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:20:46,229 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:20:46,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 03:20:46,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:46,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-07-12 03:20:46,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:46,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-07-12 03:20:46,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-12 03:20:46,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-12 03:20:46,399 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:20:46,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-12 03:20:46,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-07-12 03:20:46,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:46,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-12 03:20:46,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:46,604 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:20:46,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-07-12 03:20:46,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:46,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:20:46,650 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_978 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_978) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0)) (forall ((v_ArrVal_979 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_979) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) 0))) is different from false [2022-07-12 03:20:48,922 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:20:48,925 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:20:48,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2022-07-12 03:20:48,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:20:48,934 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:20:48,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 30 [2022-07-12 03:20:48,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 03:20:48,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:20:48,946 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-12 03:20:48,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2022-07-12 03:20:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:48,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71574193] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:20:48,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:20:48,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-07-12 03:20:48,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172588659] [2022-07-12 03:20:48,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:20:48,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 03:20:48,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:48,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 03:20:48,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=187, Unknown=2, NotChecked=28, Total=272 [2022-07-12 03:20:48,972 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:49,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:49,176 INFO L93 Difference]: Finished difference Result 213 states and 237 transitions. [2022-07-12 03:20:49,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 03:20:49,177 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 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 36 [2022-07-12 03:20:49,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:49,178 INFO L225 Difference]: With dead ends: 213 [2022-07-12 03:20:49,178 INFO L226 Difference]: Without dead ends: 153 [2022-07-12 03:20:49,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=90, Invalid=292, Unknown=2, NotChecked=36, Total=420 [2022-07-12 03:20:49,179 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 96 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:49,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 505 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 99 Invalid, 0 Unknown, 208 Unchecked, 0.1s Time] [2022-07-12 03:20:49,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-12 03:20:49,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 138. [2022-07-12 03:20:49,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 134 states have (on average 1.1567164179104477) internal successors, (155), 137 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:49,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 155 transitions. [2022-07-12 03:20:49,187 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 155 transitions. Word has length 36 [2022-07-12 03:20:49,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:49,187 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 155 transitions. [2022-07-12 03:20:49,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:49,187 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions. [2022-07-12 03:20:49,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 03:20:49,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:49,188 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 03:20:49,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 03:20:49,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:20:49,408 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:49,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:49,408 INFO L85 PathProgramCache]: Analyzing trace with hash -431498650, now seen corresponding path program 1 times [2022-07-12 03:20:49,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:49,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826730448] [2022-07-12 03:20:49,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:49,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:49,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:49,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:49,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826730448] [2022-07-12 03:20:49,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826730448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:49,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:49,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:20:49,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718375593] [2022-07-12 03:20:49,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:49,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:20:49,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:20:49,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:20:49,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:20:49,475 INFO L87 Difference]: Start difference. First operand 138 states and 155 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:49,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:49,563 INFO L93 Difference]: Finished difference Result 224 states and 254 transitions. [2022-07-12 03:20:49,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:20:49,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2022-07-12 03:20:49,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:49,564 INFO L225 Difference]: With dead ends: 224 [2022-07-12 03:20:49,564 INFO L226 Difference]: Without dead ends: 147 [2022-07-12 03:20:49,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:20:49,565 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 13 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:49,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 218 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:20:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-12 03:20:49,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 140. [2022-07-12 03:20:49,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 136 states have (on average 1.1544117647058822) internal successors, (157), 139 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:49,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 157 transitions. [2022-07-12 03:20:49,574 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 157 transitions. Word has length 36 [2022-07-12 03:20:49,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:49,574 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 157 transitions. [2022-07-12 03:20:49,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:49,574 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 157 transitions. [2022-07-12 03:20:49,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 03:20:49,575 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:49,575 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 03:20:49,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 03:20:49,575 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:49,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:49,576 INFO L85 PathProgramCache]: Analyzing trace with hash 589569704, now seen corresponding path program 1 times [2022-07-12 03:20:49,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:20:49,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458076534] [2022-07-12 03:20:49,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:49,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:20:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:49,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:49,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:20:49,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458076534] [2022-07-12 03:20:49,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458076534] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:20:49,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038226990] [2022-07-12 03:20:49,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:49,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:20:49,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:20:49,840 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 03:20:49,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 03:20:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:49,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-12 03:20:49,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:50,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:20:50,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:20:50,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:20:50,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:50,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-07-12 03:20:50,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:50,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-07-12 03:20:50,121 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:20:50,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2022-07-12 03:20:50,132 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 03:20:50,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-12 03:20:50,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:50,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-07-12 03:20:50,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 03:20:50,173 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 03:20:50,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 03:20:50,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:50,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:20:50,348 INFO L356 Elim1Store]: treesize reduction 53, result has 8.6 percent of original size [2022-07-12 03:20:50,350 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 03:20:50,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 03:20:50,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:20:50,576 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_48| input size 58 context size 58 output size 58 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-12 03:20:50,580 INFO L158 Benchmark]: Toolchain (without parser) took 11295.36ms. Allocated memory was 115.3MB in the beginning and 167.8MB in the end (delta: 52.4MB). Free memory was 81.8MB in the beginning and 44.3MB in the end (delta: 37.4MB). Peak memory consumption was 88.2MB. Max. memory is 16.1GB. [2022-07-12 03:20:50,580 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 81.8MB. Free memory was 52.0MB in the beginning and 51.9MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:20:50,580 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.61ms. Allocated memory is still 115.3MB. Free memory was 81.4MB in the beginning and 81.3MB in the end (delta: 102.7kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 03:20:50,580 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.20ms. Allocated memory is still 115.3MB. Free memory was 81.3MB in the beginning and 78.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:20:50,581 INFO L158 Benchmark]: Boogie Preprocessor took 41.63ms. Allocated memory is still 115.3MB. Free memory was 78.6MB in the beginning and 76.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:20:50,581 INFO L158 Benchmark]: RCFGBuilder took 441.15ms. Allocated memory is still 115.3MB. Free memory was 76.5MB in the beginning and 57.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-12 03:20:50,581 INFO L158 Benchmark]: TraceAbstraction took 10353.76ms. Allocated memory was 115.3MB in the beginning and 167.8MB in the end (delta: 52.4MB). Free memory was 56.8MB in the beginning and 44.3MB in the end (delta: 12.4MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. [2022-07-12 03:20:50,582 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 81.8MB. Free memory was 52.0MB in the beginning and 51.9MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.61ms. Allocated memory is still 115.3MB. Free memory was 81.4MB in the beginning and 81.3MB in the end (delta: 102.7kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.20ms. Allocated memory is still 115.3MB. Free memory was 81.3MB in the beginning and 78.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.63ms. Allocated memory is still 115.3MB. Free memory was 78.6MB in the beginning and 76.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 441.15ms. Allocated memory is still 115.3MB. Free memory was 76.5MB in the beginning and 57.6MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10353.76ms. Allocated memory was 115.3MB in the beginning and 167.8MB in the end (delta: 52.4MB). Free memory was 56.8MB in the beginning and 44.3MB in the end (delta: 12.4MB). Peak memory consumption was 65.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_48| input size 58 context size 58 output size 58 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_48| input size 58 context size 58 output size 58: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-12 03:20:50,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/sll-01-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:20:52,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:20:52,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:20:52,692 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:20:52,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:20:52,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:20:52,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:20:52,701 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:20:52,703 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:20:52,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:20:52,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:20:52,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:20:52,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:20:52,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:20:52,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:20:52,723 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:20:52,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:20:52,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:20:52,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:20:52,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:20:52,728 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:20:52,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:20:52,734 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:20:52,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:20:52,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:20:52,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:20:52,748 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:20:52,748 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:20:52,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:20:52,749 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:20:52,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:20:52,750 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:20:52,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:20:52,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:20:52,755 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:20:52,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:20:52,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:20:52,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:20:52,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:20:52,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:20:52,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:20:52,762 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:20:52,771 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 03:20:52,806 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:20:52,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:20:52,807 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:20:52,807 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:20:52,808 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:20:52,809 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:20:52,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:20:52,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:20:52,810 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:20:52,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:20:52,811 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:20:52,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:20:52,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:20:52,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:20:52,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:20:52,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:20:52,812 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 03:20:52,812 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 03:20:52,812 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 03:20:52,812 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:20:52,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:20:52,812 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:20:52,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:20:52,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:20:52,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:20:52,813 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:20:52,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:20:52,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:20:52,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:20:52,814 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:20:52,814 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 03:20:52,814 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 03:20:52,814 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:20:52,815 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:20:52,815 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:20:52,815 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 03:20:52,815 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.graphml 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 -> ba1a5c8c8cff607fde50280cfe0e0975858a4c6ed38f8443d26bb1773b66a31d [2022-07-12 03:20:53,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:20:53,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:20:53,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:20:53,190 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:20:53,190 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:20:53,192 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-01-1.i [2022-07-12 03:20:53,246 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ab0ee929/be68ccbdaf114dedb6bd1c9b20711fa8/FLAG41de4445e [2022-07-12 03:20:53,768 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:20:53,769 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i [2022-07-12 03:20:53,787 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ab0ee929/be68ccbdaf114dedb6bd1c9b20711fa8/FLAG41de4445e [2022-07-12 03:20:54,267 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ab0ee929/be68ccbdaf114dedb6bd1c9b20711fa8 [2022-07-12 03:20:54,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:20:54,271 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:20:54,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:20:54,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:20:54,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:20:54,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:20:54" (1/1) ... [2022-07-12 03:20:54,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2d74a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:54, skipping insertion in model container [2022-07-12 03:20:54,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:20:54" (1/1) ... [2022-07-12 03:20:54,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:20:54,334 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:20:54,594 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22034,22047] [2022-07-12 03:20:54,606 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22307,22320] [2022-07-12 03:20:54,611 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2022-07-12 03:20:54,613 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22586,22599] [2022-07-12 03:20:54,618 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2022-07-12 03:20:54,620 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2022-07-12 03:20:54,624 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23192,23205] [2022-07-12 03:20:54,626 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23272,23285] [2022-07-12 03:20:54,627 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23351,23364] [2022-07-12 03:20:54,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23441,23454] [2022-07-12 03:20:54,629 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23619,23632] [2022-07-12 03:20:54,630 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23697,23710] [2022-07-12 03:20:54,631 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23774,23787] [2022-07-12 03:20:54,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:20:54,658 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:20:54,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22034,22047] [2022-07-12 03:20:54,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22307,22320] [2022-07-12 03:20:54,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22516,22529] [2022-07-12 03:20:54,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22586,22599] [2022-07-12 03:20:54,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22853,22866] [2022-07-12 03:20:54,700 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[22961,22974] [2022-07-12 03:20:54,702 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23192,23205] [2022-07-12 03:20:54,702 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23272,23285] [2022-07-12 03:20:54,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23351,23364] [2022-07-12 03:20:54,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23441,23454] [2022-07-12 03:20:54,707 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23619,23632] [2022-07-12 03:20:54,711 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23697,23710] [2022-07-12 03:20:54,712 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-01-1.i[23774,23787] [2022-07-12 03:20:54,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:20:54,743 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:20:54,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:54 WrapperNode [2022-07-12 03:20:54,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:20:54,745 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:20:54,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:20:54,745 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:20:54,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:54" (1/1) ... [2022-07-12 03:20:54,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:54" (1/1) ... [2022-07-12 03:20:54,819 INFO L137 Inliner]: procedures = 120, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 219 [2022-07-12 03:20:54,820 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:20:54,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:20:54,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:20:54,821 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:20:54,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:54" (1/1) ... [2022-07-12 03:20:54,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:54" (1/1) ... [2022-07-12 03:20:54,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:54" (1/1) ... [2022-07-12 03:20:54,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:54" (1/1) ... [2022-07-12 03:20:54,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:54" (1/1) ... [2022-07-12 03:20:54,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:54" (1/1) ... [2022-07-12 03:20:54,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:54" (1/1) ... [2022-07-12 03:20:54,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:20:54,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:20:54,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:20:54,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:20:54,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:54" (1/1) ... [2022-07-12 03:20:54,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:20:54,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:20:54,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 03:20:54,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 03:20:54,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:20:54,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:20:54,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:20:54,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:20:54,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:20:54,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 03:20:54,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:20:54,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:20:55,082 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:20:55,084 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:20:55,468 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:20:55,474 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:20:55,474 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-12 03:20:55,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:20:55 BoogieIcfgContainer [2022-07-12 03:20:55,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:20:55,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:20:55,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:20:55,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:20:55,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:20:54" (1/3) ... [2022-07-12 03:20:55,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3563eaed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:20:55, skipping insertion in model container [2022-07-12 03:20:55,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:20:54" (2/3) ... [2022-07-12 03:20:55,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3563eaed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:20:55, skipping insertion in model container [2022-07-12 03:20:55,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:20:55" (3/3) ... [2022-07-12 03:20:55,483 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-1.i [2022-07-12 03:20:55,495 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:20:55,496 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2022-07-12 03:20:55,559 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:20:55,566 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6a3d4884, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4624fcde [2022-07-12 03:20:55,567 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-07-12 03:20:55,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 66 states have (on average 2.0) internal successors, (132), 79 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:55,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-12 03:20:55,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:55,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-12 03:20:55,579 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:55,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:55,585 INFO L85 PathProgramCache]: Analyzing trace with hash 925700, now seen corresponding path program 1 times [2022-07-12 03:20:55,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:55,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623467501] [2022-07-12 03:20:55,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:55,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:55,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:55,603 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:20:55,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 03:20:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:55,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 03:20:55,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:55,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:55,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:55,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:55,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623467501] [2022-07-12 03:20:55,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623467501] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:55,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:55,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:20:55,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693793501] [2022-07-12 03:20:55,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:55,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:20:55,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:55,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:20:55,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:55,793 INFO L87 Difference]: Start difference. First operand has 80 states, 66 states have (on average 2.0) internal successors, (132), 79 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:55,878 INFO L93 Difference]: Finished difference Result 174 states and 290 transitions. [2022-07-12 03:20:55,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:20:55,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-07-12 03:20:55,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:55,889 INFO L225 Difference]: With dead ends: 174 [2022-07-12 03:20:55,889 INFO L226 Difference]: Without dead ends: 92 [2022-07-12 03:20:55,892 INFO L412 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 [2022-07-12 03:20:55,896 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 80 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:55,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 99 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:20:55,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-12 03:20:55,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2022-07-12 03:20:55,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 73 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:55,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2022-07-12 03:20:55,938 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 4 [2022-07-12 03:20:55,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:55,939 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2022-07-12 03:20:55,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:55,940 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-07-12 03:20:55,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 03:20:55,940 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:55,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:55,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:20:56,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:20:56,151 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:56,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:56,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1534452756, now seen corresponding path program 1 times [2022-07-12 03:20:56,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:56,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895571884] [2022-07-12 03:20:56,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:56,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:56,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:56,154 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:20:56,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 03:20:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:56,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:20:56,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:56,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:20:56,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:20:56,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:56,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:56,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:56,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895571884] [2022-07-12 03:20:56,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895571884] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:56,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:56,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:56,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693284693] [2022-07-12 03:20:56,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:56,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:56,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:56,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:56,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:56,352 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:56,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:56,643 INFO L93 Difference]: Finished difference Result 195 states and 217 transitions. [2022-07-12 03:20:56,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:20:56,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-07-12 03:20:56,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:56,645 INFO L225 Difference]: With dead ends: 195 [2022-07-12 03:20:56,646 INFO L226 Difference]: Without dead ends: 128 [2022-07-12 03:20:56,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:20:56,647 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 56 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:56,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 195 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:20:56,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-12 03:20:56,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 76. [2022-07-12 03:20:56,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.328125) internal successors, (85), 75 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:56,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2022-07-12 03:20:56,660 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 9 [2022-07-12 03:20:56,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:56,660 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2022-07-12 03:20:56,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:56,661 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2022-07-12 03:20:56,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 03:20:56,661 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:56,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:56,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 03:20:56,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:20:56,874 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:56,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:56,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1534454678, now seen corresponding path program 1 times [2022-07-12 03:20:56,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:56,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91086403] [2022-07-12 03:20:56,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:56,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:56,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:56,877 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:20:56,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 03:20:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:56,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:20:56,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:56,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:20:56,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:20:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:57,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:57,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:57,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91086403] [2022-07-12 03:20:57,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91086403] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:57,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:57,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:57,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972737803] [2022-07-12 03:20:57,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:57,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:57,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:57,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:57,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:57,028 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:57,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:57,290 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2022-07-12 03:20:57,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:20:57,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-07-12 03:20:57,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:57,292 INFO L225 Difference]: With dead ends: 129 [2022-07-12 03:20:57,292 INFO L226 Difference]: Without dead ends: 127 [2022-07-12 03:20:57,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:20:57,294 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 53 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:57,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 193 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:20:57,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-12 03:20:57,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 77. [2022-07-12 03:20:57,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.323076923076923) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:57,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2022-07-12 03:20:57,306 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 9 [2022-07-12 03:20:57,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:57,307 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2022-07-12 03:20:57,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:57,307 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2022-07-12 03:20:57,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-12 03:20:57,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:57,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:57,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 03:20:57,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:20:57,520 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:57,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:57,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1536301720, now seen corresponding path program 1 times [2022-07-12 03:20:57,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:57,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896247914] [2022-07-12 03:20:57,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:57,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:57,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:57,523 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:20:57,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 03:20:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:57,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 03:20:57,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:57,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:57,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:57,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:57,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896247914] [2022-07-12 03:20:57,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896247914] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:57,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:57,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:57,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284487870] [2022-07-12 03:20:57,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:57,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:57,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:57,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:57,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:57,751 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:57,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:57,974 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2022-07-12 03:20:57,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:20:57,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-07-12 03:20:57,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:57,976 INFO L225 Difference]: With dead ends: 78 [2022-07-12 03:20:57,976 INFO L226 Difference]: Without dead ends: 76 [2022-07-12 03:20:57,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:20:57,978 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:57,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 211 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:20:57,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-12 03:20:57,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2022-07-12 03:20:57,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 73 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2022-07-12 03:20:57,998 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 9 [2022-07-12 03:20:57,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:57,998 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2022-07-12 03:20:57,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:57,999 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-07-12 03:20:57,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 03:20:57,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:57,999 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:58,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 03:20:58,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:20:58,200 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:58,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:58,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1743237117, now seen corresponding path program 1 times [2022-07-12 03:20:58,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:58,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733971282] [2022-07-12 03:20:58,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:58,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:58,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:58,203 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:20:58,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 03:20:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:58,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 03:20:58,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:58,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:58,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:58,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733971282] [2022-07-12 03:20:58,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733971282] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:58,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:58,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:20:58,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176533413] [2022-07-12 03:20:58,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:58,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:20:58,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:58,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:20:58,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:58,296 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:58,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:58,383 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-07-12 03:20:58,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:20:58,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-07-12 03:20:58,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:58,384 INFO L225 Difference]: With dead ends: 76 [2022-07-12 03:20:58,384 INFO L226 Difference]: Without dead ends: 72 [2022-07-12 03:20:58,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:58,385 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 14 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:58,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 119 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:20:58,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-12 03:20:58,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2022-07-12 03:20:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 69 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:58,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2022-07-12 03:20:58,390 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 13 [2022-07-12 03:20:58,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:58,390 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2022-07-12 03:20:58,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:58,391 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2022-07-12 03:20:58,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 03:20:58,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:58,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:58,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-12 03:20:58,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:20:58,600 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:58,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:58,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1794227426, now seen corresponding path program 1 times [2022-07-12 03:20:58,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:58,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094793257] [2022-07-12 03:20:58,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:58,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:58,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:58,602 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:20:58,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 03:20:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:58,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:20:58,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:58,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:58,710 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:58,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:58,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094793257] [2022-07-12 03:20:58,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094793257] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:58,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:58,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:20:58,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929332124] [2022-07-12 03:20:58,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:58,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:20:58,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:58,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:20:58,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:20:58,713 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:58,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:58,889 INFO L93 Difference]: Finished difference Result 129 states and 143 transitions. [2022-07-12 03:20:58,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:20:58,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-07-12 03:20:58,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:58,891 INFO L225 Difference]: With dead ends: 129 [2022-07-12 03:20:58,891 INFO L226 Difference]: Without dead ends: 109 [2022-07-12 03:20:58,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:20:58,892 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 125 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:58,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 112 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:20:58,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-12 03:20:58,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 69. [2022-07-12 03:20:58,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.278688524590164) internal successors, (78), 68 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:58,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2022-07-12 03:20:58,898 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 14 [2022-07-12 03:20:58,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:58,898 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2022-07-12 03:20:58,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:58,898 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2022-07-12 03:20:58,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 03:20:58,899 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:58,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:58,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-12 03:20:59,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:20:59,110 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:59,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:59,110 INFO L85 PathProgramCache]: Analyzing trace with hash -140282483, now seen corresponding path program 1 times [2022-07-12 03:20:59,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:59,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020865353] [2022-07-12 03:20:59,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:59,111 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:59,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:59,112 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:20:59,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 03:20:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:59,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 03:20:59,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:59,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:59,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:59,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:59,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020865353] [2022-07-12 03:20:59,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020865353] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:59,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:59,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:20:59,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238396940] [2022-07-12 03:20:59,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:59,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:20:59,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:59,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:20:59,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:59,186 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:59,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:20:59,204 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2022-07-12 03:20:59,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:20:59,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-07-12 03:20:59,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:20:59,206 INFO L225 Difference]: With dead ends: 134 [2022-07-12 03:20:59,206 INFO L226 Difference]: Without dead ends: 93 [2022-07-12 03:20:59,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:20:59,207 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 24 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:20:59,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 143 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:20:59,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-12 03:20:59,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2022-07-12 03:20:59,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.28125) internal successors, (82), 71 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:59,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2022-07-12 03:20:59,219 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 18 [2022-07-12 03:20:59,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:20:59,220 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2022-07-12 03:20:59,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:20:59,220 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2022-07-12 03:20:59,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 03:20:59,221 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:20:59,221 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:20:59,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-12 03:20:59,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:20:59,430 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:20:59,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:20:59,431 INFO L85 PathProgramCache]: Analyzing trace with hash -53794182, now seen corresponding path program 1 times [2022-07-12 03:20:59,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:20:59,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53490189] [2022-07-12 03:20:59,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:20:59,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:20:59,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:20:59,432 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:20:59,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 03:20:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:20:59,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 03:20:59,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:20:59,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:20:59,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:20:59,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 03:20:59,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 03:20:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:20:59,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:20:59,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:20:59,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53490189] [2022-07-12 03:20:59,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53490189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:20:59,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:20:59,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:20:59,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809336806] [2022-07-12 03:20:59,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:20:59,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:20:59,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:20:59,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:20:59,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:20:59,614 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:21:00,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:21:00,136 INFO L93 Difference]: Finished difference Result 180 states and 204 transitions. [2022-07-12 03:21:00,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:21:00,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-07-12 03:21:00,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:21:00,138 INFO L225 Difference]: With dead ends: 180 [2022-07-12 03:21:00,138 INFO L226 Difference]: Without dead ends: 136 [2022-07-12 03:21:00,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:21:00,139 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 110 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 03:21:00,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 239 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 03:21:00,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-12 03:21:00,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 81. [2022-07-12 03:21:00,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 80 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:21:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2022-07-12 03:21:00,153 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 19 [2022-07-12 03:21:00,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:21:00,153 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2022-07-12 03:21:00,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:21:00,154 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2022-07-12 03:21:00,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 03:21:00,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:21:00,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:21:00,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-12 03:21:00,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:21:00,355 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:21:00,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:21:00,356 INFO L85 PathProgramCache]: Analyzing trace with hash -746851846, now seen corresponding path program 1 times [2022-07-12 03:21:00,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:21:00,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827038649] [2022-07-12 03:21:00,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:21:00,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:21:00,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:21:00,360 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:21:00,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 03:21:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:21:00,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:21:00,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:21:00,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:21:00,476 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:21:00,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:21:00,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827038649] [2022-07-12 03:21:00,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827038649] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:21:00,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:21:00,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:21:00,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339541491] [2022-07-12 03:21:00,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:21:00,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:21:00,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:21:00,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:21:00,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:21:00,481 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:21:00,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:21:00,500 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2022-07-12 03:21:00,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:21:00,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-07-12 03:21:00,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:21:00,502 INFO L225 Difference]: With dead ends: 81 [2022-07-12 03:21:00,502 INFO L226 Difference]: Without dead ends: 79 [2022-07-12 03:21:00,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:21:00,503 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 13 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:21:00,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 123 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:21:00,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-12 03:21:00,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-07-12 03:21:00,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.25) internal successors, (90), 78 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:21:00,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2022-07-12 03:21:00,510 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 19 [2022-07-12 03:21:00,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:21:00,510 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2022-07-12 03:21:00,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:21:00,510 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2022-07-12 03:21:00,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 03:21:00,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:21:00,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:21:00,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-12 03:21:00,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:21:00,724 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:21:00,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:21:00,725 INFO L85 PathProgramCache]: Analyzing trace with hash -169331172, now seen corresponding path program 1 times [2022-07-12 03:21:00,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:21:00,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346874293] [2022-07-12 03:21:00,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:21:00,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:21:00,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:21:00,727 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:21:00,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-12 03:21:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:21:00,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:21:00,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:21:00,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:21:00,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:21:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:21:00,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:21:00,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:21:00,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346874293] [2022-07-12 03:21:00,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346874293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:21:00,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:21:00,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:21:00,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479542032] [2022-07-12 03:21:00,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:21:00,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:21:00,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:21:00,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:21:00,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:21:00,856 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:21:01,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:21:01,074 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2022-07-12 03:21:01,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:21:01,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-07-12 03:21:01,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:21:01,075 INFO L225 Difference]: With dead ends: 145 [2022-07-12 03:21:01,075 INFO L226 Difference]: Without dead ends: 87 [2022-07-12 03:21:01,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:21:01,076 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 6 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:21:01,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 185 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:21:01,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-12 03:21:01,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2022-07-12 03:21:01,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 80 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:21:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2022-07-12 03:21:01,082 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 20 [2022-07-12 03:21:01,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:21:01,082 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2022-07-12 03:21:01,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:21:01,082 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2022-07-12 03:21:01,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 03:21:01,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:21:01,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:21:01,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-07-12 03:21:01,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:21:01,288 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:21:01,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:21:01,288 INFO L85 PathProgramCache]: Analyzing trace with hash -169329250, now seen corresponding path program 1 times [2022-07-12 03:21:01,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:21:01,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861070665] [2022-07-12 03:21:01,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:21:01,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:21:01,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:21:01,290 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:21:01,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 03:21:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:21:01,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:21:01,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:21:01,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:21:01,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 03:21:01,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:21:01,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:21:01,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:21:01,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861070665] [2022-07-12 03:21:01,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861070665] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:21:01,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:21:01,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:21:01,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580668299] [2022-07-12 03:21:01,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:21:01,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:21:01,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:21:01,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:21:01,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:21:01,431 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:21:01,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:21:01,682 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2022-07-12 03:21:01,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:21:01,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-07-12 03:21:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:21:01,683 INFO L225 Difference]: With dead ends: 88 [2022-07-12 03:21:01,683 INFO L226 Difference]: Without dead ends: 86 [2022-07-12 03:21:01,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:21:01,684 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 3 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:21:01,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 183 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:21:01,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-12 03:21:01,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2022-07-12 03:21:01,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 75 states have (on average 1.24) internal successors, (93), 81 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) [2022-07-12 03:21:01,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2022-07-12 03:21:01,689 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 20 [2022-07-12 03:21:01,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:21:01,689 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2022-07-12 03:21:01,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:21:01,689 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-07-12 03:21:01,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 03:21:01,690 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:21:01,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:21:01,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-12 03:21:01,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:21:01,900 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:21:01,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:21:01,900 INFO L85 PathProgramCache]: Analyzing trace with hash -167482208, now seen corresponding path program 1 times [2022-07-12 03:21:01,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:21:01,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016311159] [2022-07-12 03:21:01,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:21:01,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:21:01,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:21:01,902 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:21:01,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-12 03:21:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:21:02,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 03:21:02,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:21:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:21:02,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:21:02,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:21:02,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016311159] [2022-07-12 03:21:02,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016311159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:21:02,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:21:02,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:21:02,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318243586] [2022-07-12 03:21:02,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:21:02,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:21:02,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:21:02,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:21:02,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:21:02,111 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:21:02,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:21:02,341 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2022-07-12 03:21:02,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:21:02,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-07-12 03:21:02,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:21:02,342 INFO L225 Difference]: With dead ends: 83 [2022-07-12 03:21:02,342 INFO L226 Difference]: Without dead ends: 81 [2022-07-12 03:21:02,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:21:02,343 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:21:02,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 173 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:21:02,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-12 03:21:02,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-07-12 03:21:02,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 78 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:21:02,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2022-07-12 03:21:02,347 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 20 [2022-07-12 03:21:02,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:21:02,347 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2022-07-12 03:21:02,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:21:02,348 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2022-07-12 03:21:02,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 03:21:02,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:21:02,348 INFO L195 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] [2022-07-12 03:21:02,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-12 03:21:02,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:21:02,561 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2022-07-12 03:21:02,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:21:02,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1528659518, now seen corresponding path program 1 times [2022-07-12 03:21:02,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:21:02,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444448655] [2022-07-12 03:21:02,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:21:02,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:21:02,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:21:02,563 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:21:02,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-12 03:21:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:21:02,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-12 03:21:02,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:21:02,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:21:02,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:03,388 INFO L356 Elim1Store]: treesize reduction 23, result has 56.6 percent of original size [2022-07-12 03:21:03,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 348 treesize of output 341 [2022-07-12 03:21:03,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:04,060 INFO L356 Elim1Store]: treesize reduction 23, result has 56.6 percent of original size [2022-07-12 03:21:04,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 227 treesize of output 220 [2022-07-12 03:21:04,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:04,294 INFO L356 Elim1Store]: treesize reduction 110, result has 13.4 percent of original size [2022-07-12 03:21:04,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 118 treesize of output 166 [2022-07-12 03:21:04,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:21:04,454 INFO L356 Elim1Store]: treesize reduction 110, result has 13.4 percent of original size [2022-07-12 03:21:04,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 118 treesize of output 166 [2022-07-12 03:21:04,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 67 [2022-07-12 03:21:04,660 INFO L356 Elim1Store]: treesize reduction 19, result has 40.6 percent of original size [2022-07-12 03:21:04,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 87 [2022-07-12 03:21:04,737 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 03:21:04,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 03:21:04,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:21:04,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:21:04,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:21:05,113 WARN L220 Elim1Store]: Array PQE input equivalent to false [2022-07-12 03:21:05,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2022-07-12 03:21:05,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-12 03:21:05,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-12 03:21:05,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 58 [2022-07-12 03:21:05,667 INFO L356 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-07-12 03:21:05,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 3 [2022-07-12 03:21:05,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 54 [2022-07-12 03:21:05,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2022-07-12 03:21:05,981 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:21:05,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 03:21:06,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 54 [2022-07-12 03:21:06,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 54 [2022-07-12 03:21:07,567 INFO L356 Elim1Store]: treesize reduction 82, result has 24.8 percent of original size [2022-07-12 03:21:07,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 176 treesize of output 211 [2022-07-12 03:21:08,189 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-12 03:21:08,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 16 [2022-07-12 03:21:08,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 11 [2022-07-12 03:21:08,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-07-12 03:21:09,109 INFO L356 Elim1Store]: treesize reduction 82, result has 24.8 percent of original size [2022-07-12 03:21:09,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 158 treesize of output 193 [2022-07-12 03:21:09,592 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-12 03:21:09,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 16 [2022-07-12 03:21:09,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 11 [2022-07-12 03:21:09,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-07-12 03:21:09,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2022-07-12 03:21:10,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 18 [2022-07-12 03:21:12,185 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse62 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse6 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse62) (_ bv0 32)))) (or (exists ((v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse5 (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_16) |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse3 (select .cse5 .cse1)) (.cse4 (select |c_#memory_$Pointer$.base| v_ArrVal_687)) (.cse2 (select .cse0 .cse1))) (and (= .cse0 (store (store v_DerPreprocessor_6 (_ bv4 32) (select .cse0 (_ bv4 32))) .cse1 .cse2)) (= .cse3 (_ bv0 32)) (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select .cse4 (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_687)) (= (store (store v_DerPreprocessor_16 (_ bv4 32) (select .cse5 (_ bv4 32))) .cse1 .cse3) .cse5) (= |c_ULTIMATE.start_main_~list~0#1.base| (select .cse4 .cse1)) (= v_ArrVal_687 .cse2) (= (select v_DerPreprocessor_16 (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)))))) (and .cse6 (let ((.cse10 (exists ((v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse24 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse26 (select |c_#memory_$Pointer$.base| v_ArrVal_687)) (.cse25 (select .cse23 .cse24))) (and (= .cse23 (store (store v_DerPreprocessor_6 (_ bv4 32) (select .cse23 (_ bv4 32))) .cse24 .cse25)) (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select .cse26 (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_687)) (= |c_ULTIMATE.start_main_~list~0#1.base| (select .cse26 .cse24)) (= v_ArrVal_687 .cse25) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)))))))) (or (exists ((v_prenex_53 (_ BitVec 32)) (v_prenex_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select |c_#memory_$Pointer$.base| v_prenex_53)) (.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse9 (select (store |c_#memory_$Pointer$.base| v_prenex_53 v_prenex_54) |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| (select .cse7 .cse8)) (= (select .cse7 (_ bv4 32)) (_ bv0 32)) (= (select .cse9 .cse8) v_prenex_53) (not (= v_prenex_53 |c_ULTIMATE.start_main_~list~0#1.base|)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| v_prenex_53) (_ bv4 32))) (= (store .cse9 (_ bv4 32) (_ bv0 32)) v_prenex_54)))) .cse10 (exists ((v_prenex_53 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32)) (v_prenex_54 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (select |c_#memory_$Pointer$.base| v_prenex_53)) (.cse12 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse13 (select (store |c_#memory_$Pointer$.base| v_prenex_53 v_prenex_54) |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| (select .cse11 .cse12)) (= (select .cse11 (_ bv4 32)) (_ bv0 32)) (= (select .cse13 .cse12) v_prenex_53) (not (= v_prenex_53 |c_ULTIMATE.start_main_~list~0#1.base|)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| v_prenex_53) (_ bv4 32))) (= (store .cse13 (_ bv4 32) (_ bv0 32)) v_prenex_54) (not (= v_prenex_53 v_ArrVal_687)) (= (select (select (store (store |c_#memory_$Pointer$.offset| v_prenex_53 v_DerPreprocessor_7) v_ArrVal_687 (select |c_#memory_$Pointer$.offset| v_ArrVal_687)) v_prenex_53) (_ bv4 32)) (_ bv0 32))))) (exists ((v_prenex_53 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (select (store |c_#memory_$Pointer$.base| v_prenex_53 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse15 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse16 (select .cse14 .cse15)) (.cse17 (select |c_#memory_$Pointer$.base| v_prenex_53))) (and (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (store (store v_DerPreprocessor_6 (_ bv4 32) (select .cse14 (_ bv4 32))) .cse15 .cse16) .cse14) (= v_prenex_53 .cse16) (= |c_ULTIMATE.start_main_~list~0#1.base| (select .cse17 .cse15)) (= (select .cse17 (_ bv4 32)) (_ bv0 32)) (not (= v_prenex_53 |c_ULTIMATE.start_main_~list~0#1.base|)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| v_prenex_53) (_ bv4 32))))))) (and .cse10 (exists ((v_prenex_53 (_ BitVec 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| v_prenex_53) (_ bv4 32))))) (exists ((v_prenex_53 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32)) (v_prenex_54 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select |c_#memory_$Pointer$.offset| v_ArrVal_687))) (let ((.cse18 (select |c_#memory_$Pointer$.base| v_prenex_53)) (.cse19 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse21 (select (store (store |c_#memory_$Pointer$.offset| v_prenex_53 v_DerPreprocessor_10) v_ArrVal_687 .cse22) v_prenex_53)) (.cse20 (select (store |c_#memory_$Pointer$.base| v_prenex_53 v_prenex_54) |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= |c_ULTIMATE.start_main_~list~0#1.base| (select .cse18 .cse19)) (= (select .cse18 (_ bv4 32)) (_ bv0 32)) (= (select .cse20 .cse19) v_prenex_53) (= .cse21 .cse22) (not (= v_prenex_53 |c_ULTIMATE.start_main_~list~0#1.base|)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| v_prenex_53) (_ bv4 32))) (= .cse21 v_DerPreprocessor_10) (= (store .cse20 (_ bv4 32) (_ bv0 32)) v_prenex_54) (= (select .cse22 (_ bv4 32)) (_ bv0 32))))))))) (and (or (exists ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_11 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse28 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse30 (select |c_#memory_$Pointer$.base| v_ArrVal_687)) (.cse29 (select .cse27 .cse28))) (and (= .cse27 (store (store v_DerPreprocessor_6 (_ bv4 32) (select .cse27 (_ bv4 32))) .cse28 .cse29)) (= (select v_DerPreprocessor_12 (_ bv4 32)) (_ bv0 32)) (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select .cse30 (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_687)) (= |c_ULTIMATE.start_main_~list~0#1.base| (select .cse30 .cse28)) (= v_ArrVal_687 .cse29) (= (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_12) v_arrayElimCell_11) (_ bv4 32) (_ bv0 32)) (select |c_#memory_$Pointer$.offset| v_ArrVal_687)))))) (exists ((v_DerPreprocessor_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_11 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse31 (select |c_#memory_$Pointer$.base| v_ArrVal_687)) (.cse33 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse32 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (= (_ bv0 32) (select v_DerPreprocessor_13 (_ bv4 32))) (= (select .cse31 (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_687)) (= (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_13) v_arrayElimCell_11) (_ bv4 32) (_ bv0 32)) (select |c_#memory_$Pointer$.offset| v_ArrVal_687)) (= |c_ULTIMATE.start_main_~list~0#1.base| (select .cse31 .cse32)) (= (store .cse33 (_ bv4 32) (_ bv0 32)) v_DerPreprocessor_6) (= v_ArrVal_687 (select .cse33 .cse32)))))) .cse6) (exists ((v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse38 (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_17) |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse36 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse34 (select |c_#memory_$Pointer$.base| v_ArrVal_687)) (.cse35 (select .cse38 .cse36)) (.cse37 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (select .cse34 (_ bv4 32)) (_ bv0 32)) (= .cse35 (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_687)) (= |c_ULTIMATE.start_main_~list~0#1.base| (select .cse34 .cse36)) (= (store .cse37 (_ bv4 32) (_ bv0 32)) v_DerPreprocessor_6) (= (store (store v_DerPreprocessor_17 (_ bv4 32) (select .cse38 (_ bv4 32))) .cse36 .cse35) .cse38) (= v_ArrVal_687 (select .cse37 .cse36)) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select v_DerPreprocessor_17 (_ bv4 32))))))) (and (or (exists ((v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse43 (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_21) |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse40 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse42 (select .cse43 .cse40)) (.cse41 (select .cse39 .cse40))) (and (= .cse39 (store (store v_DerPreprocessor_6 (_ bv4 32) (select .cse39 (_ bv4 32))) .cse40 .cse41)) (= .cse42 (_ bv0 32)) (= .cse43 (store (store v_DerPreprocessor_21 (_ bv4 32) (select .cse43 (_ bv4 32))) .cse40 .cse42)) (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_687)) (= (_ bv0 32) (select v_DerPreprocessor_21 (_ bv4 32))) (= v_ArrVal_687 .cse41) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)))))) (and (or (exists ((v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_11 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse45 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse46 (select .cse44 .cse45))) (and (= .cse44 (store (store v_DerPreprocessor_6 (_ bv4 32) (select .cse44 (_ bv4 32))) .cse45 .cse46)) (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_687)) (= (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_28) v_arrayElimCell_11) (_ bv4 32) (_ bv0 32)) (select |c_#memory_$Pointer$.offset| v_ArrVal_687)) (= (select v_DerPreprocessor_28 (_ bv4 32)) (_ bv0 32)) (= v_ArrVal_687 .cse46))))) (exists ((v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_11 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_29) v_arrayElimCell_11) (_ bv4 32) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_687)) (= (select v_DerPreprocessor_29 (_ bv4 32)) (_ bv0 32)) (= (store .cse47 (_ bv4 32) (_ bv0 32)) v_DerPreprocessor_6) (= v_ArrVal_687 (select .cse47 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))))))) .cse6) (and (let ((.cse48 (exists ((v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse54 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse55 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse56 (select .cse54 .cse55))) (and (= .cse54 (store (store v_DerPreprocessor_6 (_ bv4 32) (select .cse54 (_ bv4 32))) .cse55 .cse56)) (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_687)) (= v_ArrVal_687 .cse56) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)))))))) (or (and (exists ((v_prenex_116 (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$.offset| v_prenex_116) (_ bv4 32)) (_ bv0 32))) .cse48) (exists ((v_prenex_117 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_116 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32))) (let ((.cse49 (select (store |c_#memory_$Pointer$.base| v_prenex_116 v_prenex_117) |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$.offset| v_prenex_116) (_ bv4 32)) (_ bv0 32)) (= (store .cse49 (_ bv4 32) (_ bv0 32)) v_prenex_117) (= (select (select |c_#memory_$Pointer$.base| v_prenex_116) (_ bv4 32)) (_ bv0 32)) (= (select (select (store (store |c_#memory_$Pointer$.offset| v_prenex_116 v_DerPreprocessor_26) v_ArrVal_687 (select |c_#memory_$Pointer$.offset| v_ArrVal_687)) v_prenex_116) (_ bv4 32)) (_ bv0 32)) (= v_prenex_116 (select .cse49 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (not (= v_prenex_116 |c_ULTIMATE.start_main_~list~0#1.base|)) (not (= v_prenex_116 v_ArrVal_687))))) (exists ((v_prenex_117 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_116 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32))) (let ((.cse52 (select |c_#memory_$Pointer$.offset| v_ArrVal_687))) (let ((.cse50 (select (store |c_#memory_$Pointer$.base| v_prenex_116 v_prenex_117) |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse51 (select (store (store |c_#memory_$Pointer$.offset| v_prenex_116 v_DerPreprocessor_24) v_ArrVal_687 .cse52) v_prenex_116))) (and (= (select (select |c_#memory_$Pointer$.offset| v_prenex_116) (_ bv4 32)) (_ bv0 32)) (= (store .cse50 (_ bv4 32) (_ bv0 32)) v_prenex_117) (= (select (select |c_#memory_$Pointer$.base| v_prenex_116) (_ bv4 32)) (_ bv0 32)) (= v_prenex_116 (select .cse50 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (= .cse51 .cse52) (not (= v_prenex_116 |c_ULTIMATE.start_main_~list~0#1.base|)) (= (select .cse52 (_ bv4 32)) (_ bv0 32)) (= v_DerPreprocessor_24 .cse51))))) (exists ((v_prenex_117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_687 (_ BitVec 32))) (let ((.cse53 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_prenex_117) |c_ULTIMATE.start_main_~list~0#1.base|))) (and (= v_ArrVal_687 (select .cse53 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_687)) (= (store .cse53 (_ bv4 32) (_ bv0 32)) v_prenex_117) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32))))) .cse48)) .cse6) (exists ((v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse59 (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_20) |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse58 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse57 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~list~0#1.base|)) (.cse60 (select .cse59 .cse58))) (and (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_687)) (= (store .cse57 (_ bv4 32) (_ bv0 32)) v_DerPreprocessor_6) (= v_ArrVal_687 (select .cse57 .cse58)) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (= .cse59 (store (store v_DerPreprocessor_20 (_ bv4 32) (select .cse59 (_ bv4 32))) .cse58 .cse60)) (= (select v_DerPreprocessor_20 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) .cse60)))))) (= |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv0 32))) (let ((.cse61 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse62))) (and .cse6 (exists ((v_arrayElimCell_12 (_ BitVec 32))) (and (= (store (select |c_#memory_$Pointer$.base| v_arrayElimCell_12) (_ bv4 32) (_ bv0 32)) (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| v_arrayElimCell_12)))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| .cse61) (_ bv4 32))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse61))))))) is different from false [2022-07-12 03:21:19,987 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse20 (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32)))) (let ((.cse7 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) .cse20) (_ bv0 32)))) (or (and (or (exists ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_11 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select |c_#memory_$Pointer$.base| v_ArrVal_687)) (.cse3 (select .cse2 .cse1))) (and (= |c_ULTIMATE.start_main_~end~0#1.base| (select .cse0 .cse1)) (= .cse2 (store (store v_DerPreprocessor_6 (_ bv4 32) (select .cse2 (_ bv4 32))) .cse1 .cse3)) (= (select v_DerPreprocessor_12 (_ bv4 32)) (_ bv0 32)) (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select .cse0 (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= v_ArrVal_687 .cse3) (= (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_12) v_arrayElimCell_11) (_ bv4 32) (_ bv0 32)) (select |c_#memory_$Pointer$.offset| v_ArrVal_687)))))) (exists ((v_DerPreprocessor_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_11 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select |c_#memory_$Pointer$.base| v_ArrVal_687)) (.cse5 (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32))) (.cse6 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~end~0#1.base|))) (and (= |c_ULTIMATE.start_main_~end~0#1.base| (select .cse4 .cse5)) (= (_ bv0 32) (select v_DerPreprocessor_13 (_ bv4 32))) (= (select .cse4 (_ bv4 32)) (_ bv0 32)) (= (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_13) v_arrayElimCell_11) (_ bv4 32) (_ bv0 32)) (select |c_#memory_$Pointer$.offset| v_ArrVal_687)) (not (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= v_ArrVal_687 (select .cse6 .cse5)) (= (store .cse6 (_ bv4 32) (_ bv0 32)) v_DerPreprocessor_6))))) .cse7) (exists ((v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_16) |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse10 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse9 (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32)))) (let ((.cse8 (select |c_#memory_$Pointer$.base| v_ArrVal_687)) (.cse11 (select .cse10 .cse9)) (.cse13 (select .cse12 .cse9))) (and (= |c_ULTIMATE.start_main_~end~0#1.base| (select .cse8 .cse9)) (= .cse10 (store (store v_DerPreprocessor_6 (_ bv4 32) (select .cse10 (_ bv4 32))) .cse9 .cse11)) (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select .cse8 (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= .cse12 (store (store v_DerPreprocessor_16 (_ bv4 32) (select .cse12 (_ bv4 32))) .cse9 .cse13)) (= v_ArrVal_687 .cse11) (= (select v_DerPreprocessor_16 (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (= .cse13 (_ bv0 32)))))) (exists ((v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_17) |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse15 (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32)))) (let ((.cse14 (select |c_#memory_$Pointer$.base| v_ArrVal_687)) (.cse16 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse17 (select .cse18 .cse15))) (and (= |c_ULTIMATE.start_main_~end~0#1.base| (select .cse14 .cse15)) (= (select .cse14 (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= v_ArrVal_687 (select .cse16 .cse15)) (= .cse17 (_ bv0 32)) (= (store .cse16 (_ bv4 32) (_ bv0 32)) v_DerPreprocessor_6) (= .cse18 (store (store v_DerPreprocessor_17 (_ bv4 32) (select .cse18 (_ bv4 32))) .cse15 .cse17)) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select v_DerPreprocessor_17 (_ bv4 32))))))) (let ((.cse19 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) .cse20))) (and (= (select (select |c_#memory_$Pointer$.offset| .cse19) (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~end~0#1.base| .cse19)) .cse7 (exists ((v_arrayElimCell_12 (_ BitVec 32))) (and (not (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_12)) (= (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32)))) (store (select |c_#memory_$Pointer$.base| v_arrayElimCell_12) (_ bv4 32) (_ bv0 32))))))) (and (= |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv0 32)) (or (exists ((v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_21) |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse21 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse22 (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32)))) (let ((.cse23 (select .cse21 .cse22)) (.cse24 (select .cse25 .cse22))) (and (= .cse21 (store (store v_DerPreprocessor_6 (_ bv4 32) (select .cse21 (_ bv4 32))) .cse22 .cse23)) (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (= .cse24 (_ bv0 32)) (= (_ bv0 32) (select v_DerPreprocessor_21 (_ bv4 32))) (not (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= v_ArrVal_687 .cse23) (= .cse25 (store (store v_DerPreprocessor_21 (_ bv4 32) (select .cse25 (_ bv4 32))) .cse22 .cse24)) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)))))) (exists ((v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_20) |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse28 (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32)))) (let ((.cse27 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse26 (select .cse29 .cse28))) (and (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (= .cse26 (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= v_ArrVal_687 (select .cse27 .cse28)) (= (store .cse27 (_ bv4 32) (_ bv0 32)) v_DerPreprocessor_6) (= .cse29 (store (store v_DerPreprocessor_20 (_ bv4 32) (select .cse29 (_ bv4 32))) .cse28 .cse26)) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (= (select v_DerPreprocessor_20 (_ bv4 32)) (_ bv0 32)))))) (and (let ((.cse30 (exists ((v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse37 (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32)))) (let ((.cse38 (select .cse36 .cse37))) (and (= .cse36 (store (store v_DerPreprocessor_6 (_ bv4 32) (select .cse36 (_ bv4 32))) .cse37 .cse38)) (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= v_ArrVal_687 .cse38) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)))))))) (or .cse30 (and .cse30 (exists ((v_prenex_116 (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$.offset| v_prenex_116) (_ bv4 32)) (_ bv0 32)))) (exists ((v_prenex_117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_687 (_ BitVec 32))) (let ((.cse31 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_prenex_117) |c_ULTIMATE.start_main_~end~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (= (store .cse31 (_ bv4 32) (_ bv0 32)) v_prenex_117) (not (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= (select .cse31 (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32))) v_ArrVal_687) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32))))) (exists ((v_prenex_117 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_116 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32))) (let ((.cse34 (select |c_#memory_$Pointer$.offset| v_ArrVal_687))) (let ((.cse32 (select (store |c_#memory_$Pointer$.base| v_prenex_116 v_prenex_117) |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse33 (select (store (store |c_#memory_$Pointer$.offset| v_prenex_116 v_DerPreprocessor_24) v_ArrVal_687 .cse34) v_prenex_116))) (and (not (= v_prenex_116 |c_ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| v_prenex_116) (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| v_prenex_116) (_ bv4 32)) (_ bv0 32)) (= v_prenex_116 (select .cse32 (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32)))) (= .cse33 .cse34) (= (store .cse32 (_ bv4 32) (_ bv0 32)) v_prenex_117) (= (select .cse34 (_ bv4 32)) (_ bv0 32)) (= v_DerPreprocessor_24 .cse33))))) (exists ((v_prenex_117 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_116 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32))) (let ((.cse35 (select (store |c_#memory_$Pointer$.base| v_prenex_116 v_prenex_117) |c_ULTIMATE.start_main_~end~0#1.base|))) (and (not (= v_prenex_116 |c_ULTIMATE.start_main_~end~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| v_prenex_116) (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| v_prenex_116) (_ bv4 32)) (_ bv0 32)) (= v_prenex_116 (select .cse35 (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| v_prenex_116 v_DerPreprocessor_26) v_ArrVal_687 (select |c_#memory_$Pointer$.offset| v_ArrVal_687)) v_prenex_116) (_ bv4 32)) (_ bv0 32)) (= (store .cse35 (_ bv4 32) (_ bv0 32)) v_prenex_117) (not (= v_prenex_116 v_ArrVal_687))))))) .cse7) (and (or (exists ((v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_11 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse40 (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32)))) (let ((.cse41 (select .cse39 .cse40))) (and (= .cse39 (store (store v_DerPreprocessor_6 (_ bv4 32) (select .cse39 (_ bv4 32))) .cse40 .cse41)) (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_28) v_arrayElimCell_11) (_ bv4 32) (_ bv0 32)) (select |c_#memory_$Pointer$.offset| v_ArrVal_687)) (= (select v_DerPreprocessor_28 (_ bv4 32)) (_ bv0 32)) (= v_ArrVal_687 .cse41))))) (exists ((v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_11 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~end~0#1.base|))) (and (= (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_29) v_arrayElimCell_11) (_ bv4 32) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (= (select v_DerPreprocessor_29 (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= v_ArrVal_687 (select .cse42 (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32)))) (= (store .cse42 (_ bv4 32) (_ bv0 32)) v_DerPreprocessor_6))))) .cse7))) (and (let ((.cse50 (exists ((v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse61 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse60 (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32)))) (let ((.cse59 (select |c_#memory_$Pointer$.base| v_ArrVal_687)) (.cse62 (select .cse61 .cse60))) (and (= |c_ULTIMATE.start_main_~end~0#1.base| (select .cse59 .cse60)) (= .cse61 (store (store v_DerPreprocessor_6 (_ bv4 32) (select .cse61 (_ bv4 32))) .cse60 .cse62)) (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select .cse59 (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= v_ArrVal_687 .cse62) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)))))))) (or (exists ((v_prenex_53 (_ BitVec 32)) (v_prenex_54 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (select |c_#memory_$Pointer$.base| v_prenex_53)) (.cse45 (select (store |c_#memory_$Pointer$.base| v_prenex_53 v_prenex_54) |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse44 (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32)))) (and (= |c_ULTIMATE.start_main_~end~0#1.base| (select .cse43 .cse44)) (= (select .cse43 (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_53)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| v_prenex_53) (_ bv4 32))) (= (store .cse45 (_ bv4 32) (_ bv0 32)) v_prenex_54) (= (select .cse45 .cse44) v_prenex_53)))) (exists ((v_prenex_53 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse49 (select (store |c_#memory_$Pointer$.base| v_prenex_53 v_DerPreprocessor_6) |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse48 (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32)))) (let ((.cse47 (select |c_#memory_$Pointer$.base| v_prenex_53)) (.cse46 (select .cse49 .cse48))) (and (= v_prenex_53 .cse46) (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= |c_ULTIMATE.start_main_~end~0#1.base| (select .cse47 .cse48)) (= (select .cse47 (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_53)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| v_prenex_53) (_ bv4 32))) (= .cse49 (store (store v_DerPreprocessor_6 (_ bv4 32) (select .cse49 (_ bv4 32))) .cse48 .cse46)))))) (and .cse50 (exists ((v_prenex_53 (_ BitVec 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| v_prenex_53) (_ bv4 32))))) (exists ((v_prenex_53 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32)) (v_prenex_54 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse54 (select |c_#memory_$Pointer$.offset| v_ArrVal_687))) (let ((.cse51 (select |c_#memory_$Pointer$.base| v_prenex_53)) (.cse55 (select (store |c_#memory_$Pointer$.base| v_prenex_53 v_prenex_54) |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse52 (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32))) (.cse53 (select (store (store |c_#memory_$Pointer$.offset| v_prenex_53 v_DerPreprocessor_10) v_ArrVal_687 .cse54) v_prenex_53))) (and (= |c_ULTIMATE.start_main_~end~0#1.base| (select .cse51 .cse52)) (= (select .cse51 (_ bv4 32)) (_ bv0 32)) (= .cse53 .cse54) (not (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_53)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| v_prenex_53) (_ bv4 32))) (= (store .cse55 (_ bv4 32) (_ bv0 32)) v_prenex_54) (= (select .cse55 .cse52) v_prenex_53) (= .cse53 v_DerPreprocessor_10) (= (select .cse54 (_ bv4 32)) (_ bv0 32)))))) (exists ((v_prenex_53 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32)) (v_prenex_54 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse56 (select |c_#memory_$Pointer$.base| v_prenex_53)) (.cse58 (select (store |c_#memory_$Pointer$.base| v_prenex_53 v_prenex_54) |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse57 (bvadd |c_ULTIMATE.start_main_~end~0#1.offset| (_ bv4 32)))) (and (= |c_ULTIMATE.start_main_~end~0#1.base| (select .cse56 .cse57)) (= (select .cse56 (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~end~0#1.base| v_prenex_53)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| v_prenex_53) (_ bv4 32))) (= (store .cse58 (_ bv4 32) (_ bv0 32)) v_prenex_54) (= (select .cse58 .cse57) v_prenex_53) (not (= v_prenex_53 v_ArrVal_687)) (= (select (select (store (store |c_#memory_$Pointer$.offset| v_prenex_53 v_DerPreprocessor_7) v_ArrVal_687 (select |c_#memory_$Pointer$.offset| v_ArrVal_687)) v_prenex_53) (_ bv4 32)) (_ bv0 32))))) .cse50)) .cse7)))) is different from false [2022-07-12 03:21:24,803 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse19 (exists ((v_ArrVal_687 (_ BitVec 32)) (|ULTIMATE.start_main_~end~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse78 (select |c_#memory_$Pointer$.base| v_ArrVal_687)) (.cse81 (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse80 (select .cse78 .cse81))) (let ((.cse82 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) .cse80))) (let ((.cse79 (select (select |c_#memory_$Pointer$.offset| .cse80) .cse81)) (.cse77 (select .cse82 .cse81))) (and (= v_ArrVal_687 .cse77) (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select .cse78 (_ bv4 32)) (_ bv0 32)) (= .cse79 (_ bv0 32)) (= .cse79 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= |c_ULTIMATE.start_main_~inner~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse80) .cse81)) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (= .cse82 (store (store v_DerPreprocessor_6 (_ bv4 32) (select .cse82 (_ bv4 32))) .cse81 .cse77)) (not (= .cse80 v_ArrVal_687)))))))))) (or (and (exists ((v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~end~0#1.base| (_ BitVec 32))) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32))) (.cse1 (select .cse2 (_ bv4 32)))) (and (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)) |c_ULTIMATE.start_main_~inner~0#1.base|) (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (= .cse0 |c_ULTIMATE.start_main_~inner~0#1.offset|) (not (= |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= (store v_DerPreprocessor_6 (_ bv4 32) .cse1) .cse2) (= .cse0 (_ bv0 32)) (= v_ArrVal_687 .cse1) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)))))) (exists ((v_prenex_116 (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$.offset| v_prenex_116) (_ bv4 32)) (_ bv0 32)))) (exists ((|ULTIMATE.start_main_~end~0#1.base| (_ BitVec 32))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)))) (and (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)) |c_ULTIMATE.start_main_~inner~0#1.base|) (= .cse3 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= .cse3 (_ bv0 32)) (exists ((v_prenex_117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_687 (_ BitVec 32))) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_prenex_117) |ULTIMATE.start_main_~end~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (not (= |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= (select .cse4 (_ bv4 32)) v_ArrVal_687) (= (store .cse4 (_ bv4 32) (_ bv0 32)) v_prenex_117) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)))))))) (exists ((|ULTIMATE.start_main_~end~0#1.base| (_ BitVec 32))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)))) (and (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)) |c_ULTIMATE.start_main_~inner~0#1.base|) (= .cse5 |c_ULTIMATE.start_main_~inner~0#1.offset|) (exists ((v_prenex_117 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_116 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32))) (let ((.cse6 (select (store |c_#memory_$Pointer$.base| v_prenex_116 v_prenex_117) |ULTIMATE.start_main_~end~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$.offset| v_prenex_116) (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| v_prenex_116) (_ bv4 32)) (_ bv0 32)) (not (= v_prenex_116 |ULTIMATE.start_main_~end~0#1.base|)) (= (store .cse6 (_ bv4 32) (_ bv0 32)) v_prenex_117) (= (select (select (store (store |c_#memory_$Pointer$.offset| v_prenex_116 v_DerPreprocessor_26) v_ArrVal_687 (select |c_#memory_$Pointer$.offset| v_ArrVal_687)) v_prenex_116) (_ bv4 32)) (_ bv0 32)) (= v_prenex_116 (select .cse6 (_ bv4 32))) (not (= v_prenex_116 v_ArrVal_687))))) (= .cse5 (_ bv0 32))))) (exists ((|ULTIMATE.start_main_~end~0#1.base| (_ BitVec 32))) (let ((.cse10 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)))) (and (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)) |c_ULTIMATE.start_main_~inner~0#1.base|) (exists ((v_prenex_117 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_116 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32))) (let ((.cse9 (select |c_#memory_$Pointer$.offset| v_ArrVal_687))) (let ((.cse7 (select (store |c_#memory_$Pointer$.base| v_prenex_116 v_prenex_117) |ULTIMATE.start_main_~end~0#1.base|)) (.cse8 (select (store (store |c_#memory_$Pointer$.offset| v_prenex_116 v_DerPreprocessor_24) v_ArrVal_687 .cse9) v_prenex_116))) (and (= (select (select |c_#memory_$Pointer$.offset| v_prenex_116) (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| v_prenex_116) (_ bv4 32)) (_ bv0 32)) (not (= v_prenex_116 |ULTIMATE.start_main_~end~0#1.base|)) (= (store .cse7 (_ bv4 32) (_ bv0 32)) v_prenex_117) (= .cse8 .cse9) (= v_prenex_116 (select .cse7 (_ bv4 32))) (= (select .cse9 (_ bv4 32)) (_ bv0 32)) (= v_DerPreprocessor_24 .cse8))))) (= .cse10 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= .cse10 (_ bv0 32))))) (exists ((|ULTIMATE.start_main_~end~0#1.base| (_ BitVec 32))) (let ((.cse11 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)))) (and (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)) |c_ULTIMATE.start_main_~inner~0#1.base|) (= .cse11 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= .cse11 (_ bv0 32)) (exists ((v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse12 (select .cse13 (_ bv4 32)))) (and (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (not (= |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= (store v_DerPreprocessor_6 (_ bv4 32) .cse12) .cse13) (= v_ArrVal_687 .cse12) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32))))))))) (exists ((v_prenex_53 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32)) (v_prenex_54 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~end~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select |c_#memory_$Pointer$.base| v_prenex_53)) (.cse16 (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse14 (select .cse18 .cse16))) (let ((.cse17 (select (select |c_#memory_$Pointer$.offset| .cse14) .cse16)) (.cse15 (select (store |c_#memory_$Pointer$.base| v_prenex_53 v_prenex_54) .cse14))) (and (not (= v_prenex_53 .cse14)) (= v_prenex_53 (select .cse15 .cse16)) (= .cse17 (_ bv0 32)) (= (select .cse18 (_ bv4 32)) (_ bv0 32)) (= .cse17 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| v_prenex_53) (_ bv4 32))) (= |c_ULTIMATE.start_main_~inner~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse14) .cse16)) (not (= v_prenex_53 v_ArrVal_687)) (= v_prenex_54 (store .cse15 (_ bv4 32) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| v_prenex_53 v_DerPreprocessor_7) v_ArrVal_687 (select |c_#memory_$Pointer$.offset| v_ArrVal_687)) v_prenex_53) (_ bv4 32)) (_ bv0 32))))))) (and .cse19 (exists ((v_prenex_53 (_ BitVec 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| v_prenex_53) (_ bv4 32))))) (exists ((|ULTIMATE.start_main_~end~0#1.base| (_ BitVec 32))) (and (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)) |c_ULTIMATE.start_main_~inner~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)) |c_ULTIMATE.start_main_~inner~0#1.offset|) (exists ((v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_21) |ULTIMATE.start_main_~end~0#1.base|)) (.cse21 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse20 (select .cse21 (_ bv4 32))) (.cse22 (select .cse23 (_ bv4 32)))) (and (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select v_DerPreprocessor_21 (_ bv4 32))) (not (= |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= (store v_DerPreprocessor_6 (_ bv4 32) .cse20) .cse21) (= (store v_DerPreprocessor_21 (_ bv4 32) .cse22) .cse23) (= v_ArrVal_687 .cse20) (= .cse22 (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)))))))) .cse19 (exists ((|ULTIMATE.start_main_~end~0#1.base| (_ BitVec 32))) (let ((.cse24 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)))) (and (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)) |c_ULTIMATE.start_main_~inner~0#1.base|) (= .cse24 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= .cse24 (_ bv0 32)) (exists ((v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_11 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |ULTIMATE.start_main_~end~0#1.base|))) (and (= (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_29) v_arrayElimCell_11) (_ bv4 32) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (not (= |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= (select v_DerPreprocessor_29 (_ bv4 32)) (_ bv0 32)) (= v_ArrVal_687 (select .cse25 (_ bv4 32))) (= v_DerPreprocessor_6 (store .cse25 (_ bv4 32) (_ bv0 32))))))))) (exists ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_11 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32)) (|ULTIMATE.start_main_~end~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select |c_#memory_$Pointer$.base| v_ArrVal_687)) (.cse30 (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse29 (select .cse27 .cse30))) (let ((.cse31 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) .cse29))) (let ((.cse28 (select (select |c_#memory_$Pointer$.offset| .cse29) .cse30)) (.cse26 (select .cse31 .cse30))) (and (= v_ArrVal_687 .cse26) (= (select v_DerPreprocessor_12 (_ bv4 32)) (_ bv0 32)) (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select .cse27 (_ bv4 32)) (_ bv0 32)) (= .cse28 (_ bv0 32)) (= .cse28 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= |c_ULTIMATE.start_main_~inner~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse29) .cse30)) (= (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_12) v_arrayElimCell_11) (_ bv4 32) (_ bv0 32)) (select |c_#memory_$Pointer$.offset| v_ArrVal_687)) (= .cse31 (store (store v_DerPreprocessor_6 (_ bv4 32) (select .cse31 (_ bv4 32))) .cse30 .cse26)) (not (= .cse29 v_ArrVal_687)))))))) (exists ((|ULTIMATE.start_main_~end~0#1.base| (_ BitVec 32))) (let ((.cse34 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)))) (and (exists ((v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_11 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse32 (select .cse33 (_ bv4 32)))) (and (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (not (= |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= (store v_DerPreprocessor_6 (_ bv4 32) .cse32) .cse33) (= (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_28) v_arrayElimCell_11) (_ bv4 32) (_ bv0 32)) (select |c_#memory_$Pointer$.offset| v_ArrVal_687)) (= (select v_DerPreprocessor_28 (_ bv4 32)) (_ bv0 32)) (= v_ArrVal_687 .cse32))))) (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)) |c_ULTIMATE.start_main_~inner~0#1.base|) (= .cse34 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= .cse34 (_ bv0 32))))) (exists ((v_prenex_53 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32)) (v_prenex_54 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~end~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (select |c_#memory_$Pointer$.base| v_prenex_53)) (.cse37 (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse41 (select |c_#memory_$Pointer$.offset| v_ArrVal_687)) (.cse35 (select .cse39 .cse37))) (let ((.cse38 (select (select |c_#memory_$Pointer$.offset| .cse35) .cse37)) (.cse40 (select (store (store |c_#memory_$Pointer$.offset| v_prenex_53 v_DerPreprocessor_10) v_ArrVal_687 .cse41) v_prenex_53)) (.cse36 (select (store |c_#memory_$Pointer$.base| v_prenex_53 v_prenex_54) .cse35))) (and (not (= v_prenex_53 .cse35)) (= v_prenex_53 (select .cse36 .cse37)) (= .cse38 (_ bv0 32)) (= (select .cse39 (_ bv4 32)) (_ bv0 32)) (= .cse40 .cse41) (= .cse38 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| v_prenex_53) (_ bv4 32))) (= |c_ULTIMATE.start_main_~inner~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse35) .cse37)) (= .cse40 v_DerPreprocessor_10) (= (select .cse41 (_ bv4 32)) (_ bv0 32)) (= v_prenex_54 (store .cse36 (_ bv4 32) (_ bv0 32)))))))) (exists ((v_DerPreprocessor_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_11 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32)) (|ULTIMATE.start_main_~end~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (select |c_#memory_$Pointer$.base| v_ArrVal_687)) (.cse43 (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse46 (select .cse44 .cse43))) (let ((.cse45 (select (select |c_#memory_$Pointer$.offset| .cse46) .cse43)) (.cse42 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) .cse46))) (and (= v_ArrVal_687 (select .cse42 .cse43)) (= (_ bv0 32) (select v_DerPreprocessor_13 (_ bv4 32))) (= (select .cse44 (_ bv4 32)) (_ bv0 32)) (= (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_13) v_arrayElimCell_11) (_ bv4 32) (_ bv0 32)) (select |c_#memory_$Pointer$.offset| v_ArrVal_687)) (= .cse45 (_ bv0 32)) (= .cse45 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= |c_ULTIMATE.start_main_~inner~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse46) .cse43)) (= (store .cse42 (_ bv4 32) (_ bv0 32)) v_DerPreprocessor_6) (not (= .cse46 v_ArrVal_687))))))) (exists ((|ULTIMATE.start_main_~end~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~end~0#1.base| (_ BitVec 32))) (let ((.cse49 (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse48 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) .cse49)) (.cse47 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) .cse49))) (and (not (= .cse47 |ULTIMATE.start_main_~end~0#1.base|)) (exists ((v_arrayElimCell_12 (_ BitVec 32))) (and (= (store (select |c_#memory_$Pointer$.base| v_arrayElimCell_12) (_ bv4 32) (_ bv0 32)) (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|)))) (not (= v_arrayElimCell_12 |ULTIMATE.start_main_~end~0#1.base|)))) (= .cse48 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= .cse48 (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| .cse47) (_ bv4 32)) (_ bv0 32)) (= .cse47 |c_ULTIMATE.start_main_~inner~0#1.base|))))) (exists ((v_prenex_53 (_ BitVec 32)) (v_prenex_54 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~end~0#1.offset| (_ BitVec 32))) (let ((.cse54 (select |c_#memory_$Pointer$.base| v_prenex_53)) (.cse52 (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse50 (select .cse54 .cse52))) (let ((.cse53 (select (select |c_#memory_$Pointer$.offset| .cse50) .cse52)) (.cse51 (select (store |c_#memory_$Pointer$.base| v_prenex_53 v_prenex_54) .cse50))) (and (not (= v_prenex_53 .cse50)) (= v_prenex_53 (select .cse51 .cse52)) (= .cse53 (_ bv0 32)) (= (select .cse54 (_ bv4 32)) (_ bv0 32)) (= .cse53 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| v_prenex_53) (_ bv4 32))) (= |c_ULTIMATE.start_main_~inner~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse50) .cse52)) (= v_prenex_54 (store .cse51 (_ bv4 32) (_ bv0 32)))))))) (exists ((v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_687 (_ BitVec 32)) (|ULTIMATE.start_main_~end~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (select |c_#memory_$Pointer$.base| v_ArrVal_687)) (.cse59 (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse60 (select .cse57 .cse59))) (let ((.cse61 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) .cse60)) (.cse58 (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_16) .cse60))) (let ((.cse55 (select .cse58 .cse59)) (.cse56 (select .cse61 .cse59))) (and (= .cse55 (_ bv0 32)) (= v_ArrVal_687 .cse56) (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select .cse57 (_ bv4 32)) (_ bv0 32)) (= (store (store v_DerPreprocessor_16 (_ bv4 32) (select .cse58 (_ bv4 32))) .cse59 .cse55) .cse58) (= (select (select |c_#memory_$Pointer$.offset| .cse60) .cse59) |c_ULTIMATE.start_main_~inner~0#1.offset|) (= |c_ULTIMATE.start_main_~inner~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse60) .cse59)) (= (select v_DerPreprocessor_16 (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (= .cse61 (store (store v_DerPreprocessor_6 (_ bv4 32) (select .cse61 (_ bv4 32))) .cse59 .cse56)) (not (= .cse60 v_ArrVal_687)))))))) (exists ((v_prenex_53 (_ BitVec 32)) (|ULTIMATE.start_main_~end~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (select |c_#memory_$Pointer$.base| v_prenex_53)) (.cse67 (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse62 (select .cse65 .cse67))) (let ((.cse66 (select (store |c_#memory_$Pointer$.base| v_prenex_53 v_DerPreprocessor_6) .cse62))) (let ((.cse64 (select (select |c_#memory_$Pointer$.offset| .cse62) .cse67)) (.cse63 (select .cse66 .cse67))) (and (not (= v_prenex_53 .cse62)) (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= v_prenex_53 .cse63) (= .cse64 (_ bv0 32)) (= (select .cse65 (_ bv4 32)) (_ bv0 32)) (= .cse64 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= (store (store v_DerPreprocessor_6 (_ bv4 32) (select .cse66 (_ bv4 32))) .cse67 .cse63) .cse66) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| v_prenex_53) (_ bv4 32))) (= |c_ULTIMATE.start_main_~inner~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse62) .cse67)))))))) (exists ((v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_687 (_ BitVec 32)) (|ULTIMATE.start_main_~end~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse72 (select |c_#memory_$Pointer$.base| v_ArrVal_687)) (.cse69 (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse73 (select .cse72 .cse69))) (let ((.cse68 (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_17) .cse73))) (let ((.cse70 (select .cse68 .cse69)) (.cse71 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) .cse73))) (and (= (store (store v_DerPreprocessor_17 (_ bv4 32) (select .cse68 (_ bv4 32))) .cse69 .cse70) .cse68) (= v_ArrVal_687 (select .cse71 .cse69)) (= (select .cse72 (_ bv4 32)) (_ bv0 32)) (= .cse70 (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| .cse73) .cse69) |c_ULTIMATE.start_main_~inner~0#1.offset|) (= |c_ULTIMATE.start_main_~inner~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse73) .cse69)) (= (store .cse71 (_ bv4 32) (_ bv0 32)) v_DerPreprocessor_6) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (not (= .cse73 v_ArrVal_687)) (= (_ bv0 32) (select v_DerPreprocessor_17 (_ bv4 32))))))))) (exists ((|ULTIMATE.start_main_~end~0#1.base| (_ BitVec 32))) (and (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)) |c_ULTIMATE.start_main_~inner~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)) |c_ULTIMATE.start_main_~inner~0#1.offset|) (exists ((v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse75 (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_20) |ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse74 (select .cse75 (_ bv4 32))) (.cse76 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |ULTIMATE.start_main_~end~0#1.base|))) (and (= .cse74 (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (not (= |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= .cse75 (store v_DerPreprocessor_20 (_ bv4 32) .cse74)) (= v_ArrVal_687 (select .cse76 (_ bv4 32))) (= v_DerPreprocessor_6 (store .cse76 (_ bv4 32) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (= (select v_DerPreprocessor_20 (_ bv4 32)) (_ bv0 32)))))))))) is different from false [2022-07-12 03:21:24,858 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse19 (exists ((v_ArrVal_687 (_ BitVec 32)) (|ULTIMATE.start_main_~end~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse78 (select |c_#memory_$Pointer$.base| v_ArrVal_687)) (.cse81 (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse80 (select .cse78 .cse81))) (let ((.cse82 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) .cse80))) (let ((.cse79 (select (select |c_#memory_$Pointer$.offset| .cse80) .cse81)) (.cse77 (select .cse82 .cse81))) (and (= v_ArrVal_687 .cse77) (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select .cse78 (_ bv4 32)) (_ bv0 32)) (= .cse79 (_ bv0 32)) (= .cse79 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= |c_ULTIMATE.start_main_~inner~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse80) .cse81)) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (= .cse82 (store (store v_DerPreprocessor_6 (_ bv4 32) (select .cse82 (_ bv4 32))) .cse81 .cse77)) (not (= .cse80 v_ArrVal_687)))))))))) (or (and (exists ((v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~end~0#1.base| (_ BitVec 32))) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32))) (.cse1 (select .cse2 (_ bv4 32)))) (and (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)) |c_ULTIMATE.start_main_~inner~0#1.base|) (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (= .cse0 |c_ULTIMATE.start_main_~inner~0#1.offset|) (not (= |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= (store v_DerPreprocessor_6 (_ bv4 32) .cse1) .cse2) (= .cse0 (_ bv0 32)) (= v_ArrVal_687 .cse1) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)))))) (exists ((v_prenex_116 (_ BitVec 32))) (= (select (select |c_#memory_$Pointer$.offset| v_prenex_116) (_ bv4 32)) (_ bv0 32)))) (exists ((|ULTIMATE.start_main_~end~0#1.base| (_ BitVec 32))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)))) (and (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)) |c_ULTIMATE.start_main_~inner~0#1.base|) (= .cse3 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= .cse3 (_ bv0 32)) (exists ((v_prenex_117 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_687 (_ BitVec 32))) (let ((.cse4 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_prenex_117) |ULTIMATE.start_main_~end~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (not (= |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= (select .cse4 (_ bv4 32)) v_ArrVal_687) (= (store .cse4 (_ bv4 32) (_ bv0 32)) v_prenex_117) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)))))))) (exists ((|ULTIMATE.start_main_~end~0#1.base| (_ BitVec 32))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)))) (and (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)) |c_ULTIMATE.start_main_~inner~0#1.base|) (= .cse5 |c_ULTIMATE.start_main_~inner~0#1.offset|) (exists ((v_prenex_117 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_116 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32))) (let ((.cse6 (select (store |c_#memory_$Pointer$.base| v_prenex_116 v_prenex_117) |ULTIMATE.start_main_~end~0#1.base|))) (and (= (select (select |c_#memory_$Pointer$.offset| v_prenex_116) (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| v_prenex_116) (_ bv4 32)) (_ bv0 32)) (not (= v_prenex_116 |ULTIMATE.start_main_~end~0#1.base|)) (= (store .cse6 (_ bv4 32) (_ bv0 32)) v_prenex_117) (= (select (select (store (store |c_#memory_$Pointer$.offset| v_prenex_116 v_DerPreprocessor_26) v_ArrVal_687 (select |c_#memory_$Pointer$.offset| v_ArrVal_687)) v_prenex_116) (_ bv4 32)) (_ bv0 32)) (= v_prenex_116 (select .cse6 (_ bv4 32))) (not (= v_prenex_116 v_ArrVal_687))))) (= .cse5 (_ bv0 32))))) (exists ((|ULTIMATE.start_main_~end~0#1.base| (_ BitVec 32))) (let ((.cse10 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)))) (and (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)) |c_ULTIMATE.start_main_~inner~0#1.base|) (exists ((v_prenex_117 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_116 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32))) (let ((.cse9 (select |c_#memory_$Pointer$.offset| v_ArrVal_687))) (let ((.cse7 (select (store |c_#memory_$Pointer$.base| v_prenex_116 v_prenex_117) |ULTIMATE.start_main_~end~0#1.base|)) (.cse8 (select (store (store |c_#memory_$Pointer$.offset| v_prenex_116 v_DerPreprocessor_24) v_ArrVal_687 .cse9) v_prenex_116))) (and (= (select (select |c_#memory_$Pointer$.offset| v_prenex_116) (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| v_prenex_116) (_ bv4 32)) (_ bv0 32)) (not (= v_prenex_116 |ULTIMATE.start_main_~end~0#1.base|)) (= (store .cse7 (_ bv4 32) (_ bv0 32)) v_prenex_117) (= .cse8 .cse9) (= v_prenex_116 (select .cse7 (_ bv4 32))) (= (select .cse9 (_ bv4 32)) (_ bv0 32)) (= v_DerPreprocessor_24 .cse8))))) (= .cse10 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= .cse10 (_ bv0 32))))) (exists ((|ULTIMATE.start_main_~end~0#1.base| (_ BitVec 32))) (let ((.cse11 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)))) (and (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)) |c_ULTIMATE.start_main_~inner~0#1.base|) (= .cse11 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= .cse11 (_ bv0 32)) (exists ((v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse12 (select .cse13 (_ bv4 32)))) (and (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (not (= |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= (store v_DerPreprocessor_6 (_ bv4 32) .cse12) .cse13) (= v_ArrVal_687 .cse12) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32))))))))) (exists ((v_prenex_53 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32)) (v_prenex_54 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~end~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (select |c_#memory_$Pointer$.base| v_prenex_53)) (.cse16 (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse14 (select .cse18 .cse16))) (let ((.cse17 (select (select |c_#memory_$Pointer$.offset| .cse14) .cse16)) (.cse15 (select (store |c_#memory_$Pointer$.base| v_prenex_53 v_prenex_54) .cse14))) (and (not (= v_prenex_53 .cse14)) (= v_prenex_53 (select .cse15 .cse16)) (= .cse17 (_ bv0 32)) (= (select .cse18 (_ bv4 32)) (_ bv0 32)) (= .cse17 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| v_prenex_53) (_ bv4 32))) (= |c_ULTIMATE.start_main_~inner~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse14) .cse16)) (not (= v_prenex_53 v_ArrVal_687)) (= v_prenex_54 (store .cse15 (_ bv4 32) (_ bv0 32))) (= (select (select (store (store |c_#memory_$Pointer$.offset| v_prenex_53 v_DerPreprocessor_7) v_ArrVal_687 (select |c_#memory_$Pointer$.offset| v_ArrVal_687)) v_prenex_53) (_ bv4 32)) (_ bv0 32))))))) (and .cse19 (exists ((v_prenex_53 (_ BitVec 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| v_prenex_53) (_ bv4 32))))) (exists ((|ULTIMATE.start_main_~end~0#1.base| (_ BitVec 32))) (and (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)) |c_ULTIMATE.start_main_~inner~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)) |c_ULTIMATE.start_main_~inner~0#1.offset|) (exists ((v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_21) |ULTIMATE.start_main_~end~0#1.base|)) (.cse21 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse20 (select .cse21 (_ bv4 32))) (.cse22 (select .cse23 (_ bv4 32)))) (and (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select v_DerPreprocessor_21 (_ bv4 32))) (not (= |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= (store v_DerPreprocessor_6 (_ bv4 32) .cse20) .cse21) (= (store v_DerPreprocessor_21 (_ bv4 32) .cse22) .cse23) (= v_ArrVal_687 .cse20) (= .cse22 (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)))))))) .cse19 (exists ((|ULTIMATE.start_main_~end~0#1.base| (_ BitVec 32))) (let ((.cse24 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)))) (and (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)) |c_ULTIMATE.start_main_~inner~0#1.base|) (= .cse24 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= .cse24 (_ bv0 32)) (exists ((v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_11 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |ULTIMATE.start_main_~end~0#1.base|))) (and (= (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_29) v_arrayElimCell_11) (_ bv4 32) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (not (= |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= (select v_DerPreprocessor_29 (_ bv4 32)) (_ bv0 32)) (= v_ArrVal_687 (select .cse25 (_ bv4 32))) (= v_DerPreprocessor_6 (store .cse25 (_ bv4 32) (_ bv0 32))))))))) (exists ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_11 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32)) (|ULTIMATE.start_main_~end~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select |c_#memory_$Pointer$.base| v_ArrVal_687)) (.cse30 (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse29 (select .cse27 .cse30))) (let ((.cse31 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) .cse29))) (let ((.cse28 (select (select |c_#memory_$Pointer$.offset| .cse29) .cse30)) (.cse26 (select .cse31 .cse30))) (and (= v_ArrVal_687 .cse26) (= (select v_DerPreprocessor_12 (_ bv4 32)) (_ bv0 32)) (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select .cse27 (_ bv4 32)) (_ bv0 32)) (= .cse28 (_ bv0 32)) (= .cse28 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= |c_ULTIMATE.start_main_~inner~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse29) .cse30)) (= (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_12) v_arrayElimCell_11) (_ bv4 32) (_ bv0 32)) (select |c_#memory_$Pointer$.offset| v_ArrVal_687)) (= .cse31 (store (store v_DerPreprocessor_6 (_ bv4 32) (select .cse31 (_ bv4 32))) .cse30 .cse26)) (not (= .cse29 v_ArrVal_687)))))))) (exists ((|ULTIMATE.start_main_~end~0#1.base| (_ BitVec 32))) (let ((.cse34 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)))) (and (exists ((v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_11 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse33 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse32 (select .cse33 (_ bv4 32)))) (and (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (not (= |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= (store v_DerPreprocessor_6 (_ bv4 32) .cse32) .cse33) (= (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_28) v_arrayElimCell_11) (_ bv4 32) (_ bv0 32)) (select |c_#memory_$Pointer$.offset| v_ArrVal_687)) (= (select v_DerPreprocessor_28 (_ bv4 32)) (_ bv0 32)) (= v_ArrVal_687 .cse32))))) (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)) |c_ULTIMATE.start_main_~inner~0#1.base|) (= .cse34 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= .cse34 (_ bv0 32))))) (exists ((v_prenex_53 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32)) (v_prenex_54 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~end~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse39 (select |c_#memory_$Pointer$.base| v_prenex_53)) (.cse37 (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse41 (select |c_#memory_$Pointer$.offset| v_ArrVal_687)) (.cse35 (select .cse39 .cse37))) (let ((.cse38 (select (select |c_#memory_$Pointer$.offset| .cse35) .cse37)) (.cse40 (select (store (store |c_#memory_$Pointer$.offset| v_prenex_53 v_DerPreprocessor_10) v_ArrVal_687 .cse41) v_prenex_53)) (.cse36 (select (store |c_#memory_$Pointer$.base| v_prenex_53 v_prenex_54) .cse35))) (and (not (= v_prenex_53 .cse35)) (= v_prenex_53 (select .cse36 .cse37)) (= .cse38 (_ bv0 32)) (= (select .cse39 (_ bv4 32)) (_ bv0 32)) (= .cse40 .cse41) (= .cse38 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| v_prenex_53) (_ bv4 32))) (= |c_ULTIMATE.start_main_~inner~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse35) .cse37)) (= .cse40 v_DerPreprocessor_10) (= (select .cse41 (_ bv4 32)) (_ bv0 32)) (= v_prenex_54 (store .cse36 (_ bv4 32) (_ bv0 32)))))))) (exists ((v_DerPreprocessor_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_11 (_ BitVec 32)) (v_ArrVal_687 (_ BitVec 32)) (|ULTIMATE.start_main_~end~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (select |c_#memory_$Pointer$.base| v_ArrVal_687)) (.cse43 (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse46 (select .cse44 .cse43))) (let ((.cse45 (select (select |c_#memory_$Pointer$.offset| .cse46) .cse43)) (.cse42 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) .cse46))) (and (= v_ArrVal_687 (select .cse42 .cse43)) (= (_ bv0 32) (select v_DerPreprocessor_13 (_ bv4 32))) (= (select .cse44 (_ bv4 32)) (_ bv0 32)) (= (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_13) v_arrayElimCell_11) (_ bv4 32) (_ bv0 32)) (select |c_#memory_$Pointer$.offset| v_ArrVal_687)) (= .cse45 (_ bv0 32)) (= .cse45 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= |c_ULTIMATE.start_main_~inner~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse46) .cse43)) (= (store .cse42 (_ bv4 32) (_ bv0 32)) v_DerPreprocessor_6) (not (= .cse46 v_ArrVal_687))))))) (exists ((|ULTIMATE.start_main_~end~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~end~0#1.base| (_ BitVec 32))) (let ((.cse49 (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse48 (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) .cse49)) (.cse47 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) .cse49))) (and (not (= .cse47 |ULTIMATE.start_main_~end~0#1.base|)) (exists ((v_arrayElimCell_12 (_ BitVec 32))) (and (= (store (select |c_#memory_$Pointer$.base| v_arrayElimCell_12) (_ bv4 32) (_ bv0 32)) (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|)))) (not (= v_arrayElimCell_12 |ULTIMATE.start_main_~end~0#1.base|)))) (= .cse48 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= .cse48 (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| .cse47) (_ bv4 32)) (_ bv0 32)) (= .cse47 |c_ULTIMATE.start_main_~inner~0#1.base|))))) (exists ((v_prenex_53 (_ BitVec 32)) (v_prenex_54 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~end~0#1.offset| (_ BitVec 32))) (let ((.cse54 (select |c_#memory_$Pointer$.base| v_prenex_53)) (.cse52 (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse50 (select .cse54 .cse52))) (let ((.cse53 (select (select |c_#memory_$Pointer$.offset| .cse50) .cse52)) (.cse51 (select (store |c_#memory_$Pointer$.base| v_prenex_53 v_prenex_54) .cse50))) (and (not (= v_prenex_53 .cse50)) (= v_prenex_53 (select .cse51 .cse52)) (= .cse53 (_ bv0 32)) (= (select .cse54 (_ bv4 32)) (_ bv0 32)) (= .cse53 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| v_prenex_53) (_ bv4 32))) (= |c_ULTIMATE.start_main_~inner~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse50) .cse52)) (= v_prenex_54 (store .cse51 (_ bv4 32) (_ bv0 32)))))))) (exists ((v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_687 (_ BitVec 32)) (|ULTIMATE.start_main_~end~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse57 (select |c_#memory_$Pointer$.base| v_ArrVal_687)) (.cse59 (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse60 (select .cse57 .cse59))) (let ((.cse61 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) .cse60)) (.cse58 (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_16) .cse60))) (let ((.cse55 (select .cse58 .cse59)) (.cse56 (select .cse61 .cse59))) (and (= .cse55 (_ bv0 32)) (= v_ArrVal_687 .cse56) (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= (select .cse57 (_ bv4 32)) (_ bv0 32)) (= (store (store v_DerPreprocessor_16 (_ bv4 32) (select .cse58 (_ bv4 32))) .cse59 .cse55) .cse58) (= (select (select |c_#memory_$Pointer$.offset| .cse60) .cse59) |c_ULTIMATE.start_main_~inner~0#1.offset|) (= |c_ULTIMATE.start_main_~inner~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse60) .cse59)) (= (select v_DerPreprocessor_16 (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (= .cse61 (store (store v_DerPreprocessor_6 (_ bv4 32) (select .cse61 (_ bv4 32))) .cse59 .cse56)) (not (= .cse60 v_ArrVal_687)))))))) (exists ((v_prenex_53 (_ BitVec 32)) (|ULTIMATE.start_main_~end~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse65 (select |c_#memory_$Pointer$.base| v_prenex_53)) (.cse67 (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse62 (select .cse65 .cse67))) (let ((.cse66 (select (store |c_#memory_$Pointer$.base| v_prenex_53 v_DerPreprocessor_6) .cse62))) (let ((.cse64 (select (select |c_#memory_$Pointer$.offset| .cse62) .cse67)) (.cse63 (select .cse66 .cse67))) (and (not (= v_prenex_53 .cse62)) (= (select v_DerPreprocessor_6 (_ bv4 32)) (_ bv0 32)) (= v_prenex_53 .cse63) (= .cse64 (_ bv0 32)) (= (select .cse65 (_ bv4 32)) (_ bv0 32)) (= .cse64 |c_ULTIMATE.start_main_~inner~0#1.offset|) (= (store (store v_DerPreprocessor_6 (_ bv4 32) (select .cse66 (_ bv4 32))) .cse67 .cse63) .cse66) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| v_prenex_53) (_ bv4 32))) (= |c_ULTIMATE.start_main_~inner~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse62) .cse67)))))))) (exists ((v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_687 (_ BitVec 32)) (|ULTIMATE.start_main_~end~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse72 (select |c_#memory_$Pointer$.base| v_ArrVal_687)) (.cse69 (bvadd (_ bv4 32) |ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse73 (select .cse72 .cse69))) (let ((.cse68 (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_17) .cse73))) (let ((.cse70 (select .cse68 .cse69)) (.cse71 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) .cse73))) (and (= (store (store v_DerPreprocessor_17 (_ bv4 32) (select .cse68 (_ bv4 32))) .cse69 .cse70) .cse68) (= v_ArrVal_687 (select .cse71 .cse69)) (= (select .cse72 (_ bv4 32)) (_ bv0 32)) (= .cse70 (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| .cse73) .cse69) |c_ULTIMATE.start_main_~inner~0#1.offset|) (= |c_ULTIMATE.start_main_~inner~0#1.base| (select (select |c_#memory_$Pointer$.base| .cse73) .cse69)) (= (store .cse71 (_ bv4 32) (_ bv0 32)) v_DerPreprocessor_6) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (not (= .cse73 v_ArrVal_687)) (= (_ bv0 32) (select v_DerPreprocessor_17 (_ bv4 32))))))))) (exists ((|ULTIMATE.start_main_~end~0#1.base| (_ BitVec 32))) (and (= (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)) |c_ULTIMATE.start_main_~inner~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~end~0#1.base|) (_ bv4 32)) |c_ULTIMATE.start_main_~inner~0#1.offset|) (exists ((v_ArrVal_687 (_ BitVec 32)) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse75 (select (store |c_#memory_$Pointer$.offset| v_ArrVal_687 v_DerPreprocessor_20) |ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse74 (select .cse75 (_ bv4 32))) (.cse76 (select (store |c_#memory_$Pointer$.base| v_ArrVal_687 v_DerPreprocessor_6) |ULTIMATE.start_main_~end~0#1.base|))) (and (= .cse74 (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (not (= |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_687)) (= .cse75 (store v_DerPreprocessor_20 (_ bv4 32) .cse74)) (= v_ArrVal_687 (select .cse76 (_ bv4 32))) (= v_DerPreprocessor_6 (store .cse76 (_ bv4 32) (_ bv0 32))) (= (select (select |c_#memory_$Pointer$.offset| v_ArrVal_687) (_ bv4 32)) (_ bv0 32)) (= (select v_DerPreprocessor_20 (_ bv4 32)) (_ bv0 32)))))))))) is different from true