./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa --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 a622ae6de889131f2da5147d62f9f380917f72e1547f77059c8208bcfb6e8bd0 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 20:42:27,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 20:42:27,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 20:42:27,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 20:42:27,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 20:42:27,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 20:42:27,557 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 20:42:27,560 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 20:42:27,562 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 20:42:27,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 20:42:27,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 20:42:27,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 20:42:27,566 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 20:42:27,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 20:42:27,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 20:42:27,569 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 20:42:27,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 20:42:27,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 20:42:27,572 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 20:42:27,574 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 20:42:27,576 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 20:42:27,577 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 20:42:27,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 20:42:27,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 20:42:27,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 20:42:27,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 20:42:27,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 20:42:27,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 20:42:27,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 20:42:27,584 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 20:42:27,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 20:42:27,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 20:42:27,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 20:42:27,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 20:42:27,587 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 20:42:27,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 20:42:27,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 20:42:27,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 20:42:27,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 20:42:27,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 20:42:27,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 20:42:27,590 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 20:42:27,608 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 20:42:27,609 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 20:42:27,609 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 20:42:27,609 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 20:42:27,609 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 20:42:27,610 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 20:42:27,610 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 20:42:27,610 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 20:42:27,610 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 20:42:27,610 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 20:42:27,611 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 20:42:27,611 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 20:42:27,611 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 20:42:27,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 20:42:27,611 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 20:42:27,611 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 20:42:27,611 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 20:42:27,611 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 20:42:27,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 20:42:27,612 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 20:42:27,612 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 20:42:27,612 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 20:42:27,612 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 20:42:27,612 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 20:42:27,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 20:42:27,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 20:42:27,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 20:42:27,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 20:42:27,613 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 20:42:27,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 20:42:27,613 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 20:42:27,613 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 20:42:27,613 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 20:42:27,613 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 20:42:27,614 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa 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 -> a622ae6de889131f2da5147d62f9f380917f72e1547f77059c8208bcfb6e8bd0 [2021-12-06 20:42:27,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 20:42:27,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 20:42:27,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 20:42:27,802 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 20:42:27,803 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 20:42:27,804 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i [2021-12-06 20:42:27,850 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/data/23d74426a/e02a0676ef58477c8a68f6cfb2651686/FLAGfeb9b6e50 [2021-12-06 20:42:28,258 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 20:42:28,259 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i [2021-12-06 20:42:28,268 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/data/23d74426a/e02a0676ef58477c8a68f6cfb2651686/FLAGfeb9b6e50 [2021-12-06 20:42:28,277 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/data/23d74426a/e02a0676ef58477c8a68f6cfb2651686 [2021-12-06 20:42:28,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 20:42:28,279 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 20:42:28,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 20:42:28,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 20:42:28,283 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 20:42:28,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 08:42:28" (1/1) ... [2021-12-06 20:42:28,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32e5b28d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:42:28, skipping insertion in model container [2021-12-06 20:42:28,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 08:42:28" (1/1) ... [2021-12-06 20:42:28,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 20:42:28,312 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 20:42:28,510 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i[23220,23233] [2021-12-06 20:42:28,513 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 20:42:28,519 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 20:42:28,549 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/sv-benchmarks/c/list-ext2-properties/simple_search_value-2.i[23220,23233] [2021-12-06 20:42:28,550 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 20:42:28,571 INFO L208 MainTranslator]: Completed translation [2021-12-06 20:42:28,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:42:28 WrapperNode [2021-12-06 20:42:28,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 20:42:28,572 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 20:42:28,572 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 20:42:28,572 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 20:42:28,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:42:28" (1/1) ... [2021-12-06 20:42:28,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:42:28" (1/1) ... [2021-12-06 20:42:28,603 INFO L137 Inliner]: procedures = 122, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2021-12-06 20:42:28,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 20:42:28,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 20:42:28,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 20:42:28,604 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 20:42:28,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:42:28" (1/1) ... [2021-12-06 20:42:28,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:42:28" (1/1) ... [2021-12-06 20:42:28,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:42:28" (1/1) ... [2021-12-06 20:42:28,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:42:28" (1/1) ... [2021-12-06 20:42:28,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:42:28" (1/1) ... [2021-12-06 20:42:28,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:42:28" (1/1) ... [2021-12-06 20:42:28,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:42:28" (1/1) ... [2021-12-06 20:42:28,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 20:42:28,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 20:42:28,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 20:42:28,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 20:42:28,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:42:28" (1/1) ... [2021-12-06 20:42:28,637 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 20:42:28,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:42:28,654 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 20:42:28,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 20:42:28,690 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-06 20:42:28,690 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-06 20:42:28,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-06 20:42:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 20:42:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 20:42:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 20:42:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-06 20:42:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-06 20:42:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 20:42:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 20:42:28,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 20:42:28,767 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 20:42:28,769 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 20:42:28,802 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-06 20:42:28,899 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 20:42:28,904 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 20:42:28,904 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-06 20:42:28,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:42:28 BoogieIcfgContainer [2021-12-06 20:42:28,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 20:42:28,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 20:42:28,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 20:42:28,909 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 20:42:28,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 08:42:28" (1/3) ... [2021-12-06 20:42:28,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726903dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 08:42:28, skipping insertion in model container [2021-12-06 20:42:28,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 08:42:28" (2/3) ... [2021-12-06 20:42:28,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726903dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 08:42:28, skipping insertion in model container [2021-12-06 20:42:28,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 08:42:28" (3/3) ... [2021-12-06 20:42:28,911 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_search_value-2.i [2021-12-06 20:42:28,915 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 20:42:28,915 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 20:42:28,952 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 20:42:28,957 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 20:42:28,958 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 20:42:28,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:42:28,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-06 20:42:28,978 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:42:28,978 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:42:28,978 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:42:28,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:42:28,984 INFO L85 PathProgramCache]: Analyzing trace with hash 2087165485, now seen corresponding path program 1 times [2021-12-06 20:42:28,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:42:28,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031401392] [2021-12-06 20:42:28,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:42:28,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:42:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:42:29,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:42:29,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:42:29,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031401392] [2021-12-06 20:42:29,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031401392] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:42:29,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:42:29,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 20:42:29,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021658577] [2021-12-06 20:42:29,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:42:29,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-06 20:42:29,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:42:29,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-06 20:42:29,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 20:42:29,165 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) [2021-12-06 20:42:29,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:42:29,179 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2021-12-06 20:42:29,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 20:42:29,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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 [2021-12-06 20:42:29,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:42:29,185 INFO L225 Difference]: With dead ends: 39 [2021-12-06 20:42:29,186 INFO L226 Difference]: Without dead ends: 18 [2021-12-06 20:42:29,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 20:42:29,191 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:42:29,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:42:29,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-12-06 20:42:29,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-12-06 20:42:29,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:42:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-12-06 20:42:29,213 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 9 [2021-12-06 20:42:29,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:42:29,214 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-06 20:42:29,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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) [2021-12-06 20:42:29,214 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-12-06 20:42:29,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-06 20:42:29,214 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:42:29,215 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:42:29,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 20:42:29,215 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:42:29,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:42:29,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2034265922, now seen corresponding path program 1 times [2021-12-06 20:42:29,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:42:29,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130912311] [2021-12-06 20:42:29,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:42:29,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:42:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:42:29,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:42:29,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:42:29,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130912311] [2021-12-06 20:42:29,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130912311] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:42:29,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:42:29,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 20:42:29,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864763353] [2021-12-06 20:42:29,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:42:29,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 20:42:29,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:42:29,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 20:42:29,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 20:42:29,252 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:42:29,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:42:29,264 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2021-12-06 20:42:29,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 20:42:29,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-12-06 20:42:29,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:42:29,265 INFO L225 Difference]: With dead ends: 28 [2021-12-06 20:42:29,265 INFO L226 Difference]: Without dead ends: 19 [2021-12-06 20:42:29,266 INFO L932 BasicCegarLoop]: 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 [2021-12-06 20:42:29,267 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 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 [2021-12-06 20:42:29,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:42:29,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-12-06 20:42:29,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-12-06 20:42:29,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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) [2021-12-06 20:42:29,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2021-12-06 20:42:29,270 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2021-12-06 20:42:29,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:42:29,271 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-12-06 20:42:29,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:42:29,271 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2021-12-06 20:42:29,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-06 20:42:29,271 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:42:29,272 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:42:29,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 20:42:29,272 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:42:29,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:42:29,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1977007620, now seen corresponding path program 1 times [2021-12-06 20:42:29,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:42:29,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619821714] [2021-12-06 20:42:29,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:42:29,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:42:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:42:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 20:42:29,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:42:29,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619821714] [2021-12-06 20:42:29,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619821714] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:42:29,319 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:42:29,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:42:29,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364854691] [2021-12-06 20:42:29,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:42:29,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:42:29,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:42:29,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:42:29,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:42:29,321 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:42:29,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:42:29,347 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2021-12-06 20:42:29,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 20:42:29,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-12-06 20:42:29,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:42:29,348 INFO L225 Difference]: With dead ends: 39 [2021-12-06 20:42:29,348 INFO L226 Difference]: Without dead ends: 24 [2021-12-06 20:42:29,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-06 20:42:29,349 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:42:29,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 49 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:42:29,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-12-06 20:42:29,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2021-12-06 20:42:29,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:42:29,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2021-12-06 20:42:29,353 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2021-12-06 20:42:29,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:42:29,353 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-12-06 20:42:29,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:42:29,353 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2021-12-06 20:42:29,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-06 20:42:29,353 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:42:29,354 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:42:29,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 20:42:29,354 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:42:29,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:42:29,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1102443704, now seen corresponding path program 1 times [2021-12-06 20:42:29,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:42:29,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031937521] [2021-12-06 20:42:29,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:42:29,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:42:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:42:29,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 20:42:29,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:42:29,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031937521] [2021-12-06 20:42:29,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031937521] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 20:42:29,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 20:42:29,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-06 20:42:29,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053900338] [2021-12-06 20:42:29,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 20:42:29,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 20:42:29,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:42:29,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 20:42:29,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-06 20:42:29,419 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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) [2021-12-06 20:42:29,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:42:29,444 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2021-12-06 20:42:29,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 20:42:29,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 16 [2021-12-06 20:42:29,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:42:29,445 INFO L225 Difference]: With dead ends: 32 [2021-12-06 20:42:29,445 INFO L226 Difference]: Without dead ends: 29 [2021-12-06 20:42:29,445 INFO L932 BasicCegarLoop]: 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 [2021-12-06 20:42:29,446 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:42:29,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 27 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:42:29,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-06 20:42:29,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2021-12-06 20:42:29,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 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) [2021-12-06 20:42:29,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2021-12-06 20:42:29,450 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2021-12-06 20:42:29,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:42:29,450 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-12-06 20:42:29,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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) [2021-12-06 20:42:29,450 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2021-12-06 20:42:29,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-06 20:42:29,451 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:42:29,451 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:42:29,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 20:42:29,451 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:42:29,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:42:29,452 INFO L85 PathProgramCache]: Analyzing trace with hash 379985990, now seen corresponding path program 1 times [2021-12-06 20:42:29,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:42:29,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113675685] [2021-12-06 20:42:29,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:42:29,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:42:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:42:29,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:42:29,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:42:29,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113675685] [2021-12-06 20:42:29,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113675685] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:42:29,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922142676] [2021-12-06 20:42:29,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:42:29,506 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:42:29,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:42:29,506 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:42:29,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 20:42:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:42:29,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-06 20:42:29,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:42:29,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:42:29,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:42:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:42:29,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922142676] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 20:42:29,658 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 20:42:29,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2021-12-06 20:42:29,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992266519] [2021-12-06 20:42:29,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 20:42:29,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 20:42:29,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:42:29,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 20:42:29,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-06 20:42:29,660 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:42:29,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:42:29,724 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2021-12-06 20:42:29,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 20:42:29,724 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 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 [2021-12-06 20:42:29,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:42:29,725 INFO L225 Difference]: With dead ends: 56 [2021-12-06 20:42:29,725 INFO L226 Difference]: Without dead ends: 40 [2021-12-06 20:42:29,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2021-12-06 20:42:29,727 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 20:42:29,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 81 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 20:42:29,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-06 20:42:29,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2021-12-06 20:42:29,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:42:29,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2021-12-06 20:42:29,734 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 21 [2021-12-06 20:42:29,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:42:29,734 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2021-12-06 20:42:29,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:42:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2021-12-06 20:42:29,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-06 20:42:29,735 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:42:29,735 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:42:29,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 20:42:29,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:42:29,937 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:42:29,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:42:29,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1481516270, now seen corresponding path program 2 times [2021-12-06 20:42:29,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:42:29,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266873973] [2021-12-06 20:42:29,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:42:29,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:42:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:42:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:42:30,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:42:30,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266873973] [2021-12-06 20:42:30,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266873973] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:42:30,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395750287] [2021-12-06 20:42:30,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 20:42:30,152 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:42:30,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:42:30,153 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:42:30,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 20:42:30,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 20:42:30,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 20:42:30,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-06 20:42:30,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:42:30,288 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:42:30,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:42:30,361 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-06 20:42:30,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395750287] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 20:42:30,361 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 20:42:30,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2021-12-06 20:42:30,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053522208] [2021-12-06 20:42:30,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 20:42:30,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-06 20:42:30,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 20:42:30,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-06 20:42:30,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2021-12-06 20:42:30,363 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:42:30,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 20:42:30,471 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2021-12-06 20:42:30,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-06 20:42:30,472 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-06 20:42:30,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 20:42:30,473 INFO L225 Difference]: With dead ends: 86 [2021-12-06 20:42:30,473 INFO L226 Difference]: Without dead ends: 70 [2021-12-06 20:42:30,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2021-12-06 20:42:30,474 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 55 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 20:42:30,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 87 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 20:42:30,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-06 20:42:30,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2021-12-06 20:42:30,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:42:30,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2021-12-06 20:42:30,481 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 36 [2021-12-06 20:42:30,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 20:42:30,481 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2021-12-06 20:42:30,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 20:42:30,481 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2021-12-06 20:42:30,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-12-06 20:42:30,483 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 20:42:30,483 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 20:42:30,502 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 20:42:30,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-06 20:42:30,685 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 20:42:30,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 20:42:30,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1904311442, now seen corresponding path program 3 times [2021-12-06 20:42:30,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 20:42:30,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795023994] [2021-12-06 20:42:30,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 20:42:30,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 20:42:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 20:42:31,103 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 91 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2021-12-06 20:42:31,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 20:42:31,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795023994] [2021-12-06 20:42:31,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795023994] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 20:42:31,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574233330] [2021-12-06 20:42:31,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 20:42:31,104 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 20:42:31,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 20:42:31,105 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 20:42:31,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_60690850-12d5-4872-aa76-8f1019ddb736/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 20:42:40,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-12-06 20:42:40,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 20:42:40,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 168 conjunts are in the unsatisfiable core [2021-12-06 20:42:40,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 20:42:40,599 INFO L388 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 [2021-12-06 20:42:40,646 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-06 20:42:40,647 INFO L388 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 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-06 20:42:40,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2021-12-06 20:42:40,726 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:42:40,727 INFO L388 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 36 treesize of output 34 [2021-12-06 20:42:40,767 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-06 20:42:40,768 INFO L388 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 33 treesize of output 34 [2021-12-06 20:42:40,812 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 20:42:40,812 INFO L388 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 27 treesize of output 31 [2021-12-06 20:42:40,819 INFO L388 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 17 treesize of output 9 [2021-12-06 20:42:40,894 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-06 20:42:40,900 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-06 20:42:40,900 INFO L388 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 1 case distinctions, treesize of input 37 treesize of output 34 [2021-12-06 20:42:40,958 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 20:42:40,959 INFO L388 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 15 treesize of output 21 [2021-12-06 20:42:41,020 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-06 20:42:41,021 INFO L388 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 1 case distinctions, treesize of input 24 treesize of output 27 [2021-12-06 20:42:41,072 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 20:42:41,072 INFO L388 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 15 treesize of output 21 [2021-12-06 20:42:41,111 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-06 20:42:41,112 INFO L388 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 1 case distinctions, treesize of input 24 treesize of output 27 [2021-12-06 20:42:41,165 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 20:42:41,165 INFO L388 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 15 treesize of output 21 [2021-12-06 20:42:41,202 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-06 20:42:41,202 INFO L388 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 1 case distinctions, treesize of input 24 treesize of output 27 [2021-12-06 20:42:41,250 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 20:42:41,251 INFO L388 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 15 treesize of output 21 [2021-12-06 20:42:41,286 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-06 20:42:41,286 INFO L388 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 1 case distinctions, treesize of input 24 treesize of output 27 [2021-12-06 20:42:41,345 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-06 20:42:41,345 INFO L388 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 15 treesize of output 21 [2021-12-06 20:42:41,356 INFO L388 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 6 treesize of output 5 [2021-12-06 20:42:41,414 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-06 20:42:41,415 INFO L388 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 1 case distinctions, treesize of input 24 treesize of output 27 [2021-12-06 20:42:41,514 INFO L354 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2021-12-06 20:42:41,514 INFO L388 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 56 [2021-12-06 20:42:41,523 INFO L354 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2021-12-06 20:42:41,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2021-12-06 20:42:41,577 INFO L388 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 18 treesize of output 12 [2021-12-06 20:42:41,643 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-06 20:42:41,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2021-12-06 20:42:41,729 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-06 20:42:41,730 INFO L388 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 38 treesize of output 43 [2021-12-06 20:42:41,815 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-12-06 20:42:41,815 INFO L388 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 45 [2021-12-06 20:42:42,458 INFO L388 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2021-12-06 20:42:42,484 INFO L354 Elim1Store]: treesize reduction 38, result has 53.7 percent of original size [2021-12-06 20:42:42,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 78 [2021-12-06 20:42:42,592 INFO L388 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 29 treesize of output 21 [2021-12-06 20:42:43,017 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 20:42:43,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 15 [2021-12-06 20:42:45,680 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 20:42:45,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 59 [2021-12-06 20:42:45,718 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 69 proven. 145 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-12-06 20:42:45,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 20:42:45,796 INFO L388 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 78 treesize of output 74 [2021-12-06 20:42:45,881 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_618 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (and (< 2 |c_ULTIMATE.start_main_~counter~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_main_~p~0#1.offset|) (= |c_ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2021-12-06 20:42:45,919 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_618 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (and (< 2 |c_ULTIMATE.start_main_~counter~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_main_~p~0#1.offset|) (= |c_ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|)))) |c_ULTIMATE.start_main_#t~short5#1|) is different from false [2021-12-06 20:42:45,935 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_618 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_618) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_main_~p~0#1.offset|) (= |c_ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2021-12-06 20:42:45,953 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (or (and (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_main_~t~0#1.offset|) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_618) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)))) is different from false [2021-12-06 20:42:45,976 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 20:42:45,977 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2021-12-06 20:42:46,352 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 20:42:46,352 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2021-12-06 20:42:47,021 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 20:42:47,022 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2021-12-06 20:42:47,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 14 [2021-12-06 20:42:47,155 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (let ((.cse0 (select v_arrayElimArr_3 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse1 (select v_arrayElimArr_2 4))) (or (not (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_3) .cse0 v_arrayElimArr_2) .cse1 v_arrayElimArr_1) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_618) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select v_arrayElimArr_1 4) 0) (= .cse0 0) (= .cse1 0) (= .cse0 .cse1)))) is different from false [2021-12-06 20:42:47,627 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_43| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (let ((.cse0 (select v_arrayElimArr_3 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (.cse1 (select v_arrayElimArr_2 4))) (or (= .cse0 .cse1) (= .cse0 0) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select v_arrayElimArr_1 4) 0) (not (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) |v_ULTIMATE.start_main_~p~0#1.base_43| v_arrayElimArr_3) .cse0 v_arrayElimArr_2) .cse1 v_arrayElimArr_1) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_618) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= .cse1 0)))) is different from false [2021-12-06 20:42:47,811 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 20:42:47,812 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2021-12-06 20:42:47,991 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_43| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (let ((.cse1 (select v_arrayElimArr_2 4)) (.cse0 (select v_arrayElimArr_3 4))) (or (= 0 (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select v_arrayElimArr_1 4) 0) (not (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_43| v_arrayElimArr_3) .cse0 v_arrayElimArr_2) .cse1 v_arrayElimArr_1) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_618) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= .cse1 .cse0) (= .cse1 0) (= .cse0 0)))) is different from false [2021-12-06 20:42:48,543 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_43| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_45| Int) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (let ((.cse1 (select v_arrayElimArr_2 4)) (.cse0 (select v_arrayElimArr_3 4))) (or (not (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) |v_ULTIMATE.start_main_~p~0#1.base_45| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_43| v_arrayElimArr_3) .cse0 v_arrayElimArr_2) .cse1 v_arrayElimArr_1) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_618) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select v_arrayElimArr_1 4) 0) (= .cse1 .cse0) (= (select v_arrayElimArr_4 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0) (= .cse1 0) (= .cse0 0)))) is different from false [2021-12-06 20:42:48,732 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 20:42:48,732 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 41 [2021-12-06 20:42:48,927 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_43| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_45| Int) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (let ((.cse1 (select v_arrayElimArr_2 4)) (.cse0 (select v_arrayElimArr_3 4))) (or (= (select v_arrayElimArr_5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (not (= (select (select (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) |v_ULTIMATE.start_main_~p~0#1.base_45| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_43| v_arrayElimArr_3) .cse0 v_arrayElimArr_2) .cse1 v_arrayElimArr_1) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_618) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select v_arrayElimArr_1 4) 0) (= .cse1 .cse0) (= (select v_arrayElimArr_4 4) 0) (= .cse1 0) (= .cse0 0)))) is different from false [2021-12-06 20:42:49,589 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_43| Int) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_45| Int) (|v_ULTIMATE.start_main_~p~0#1.base_47| Int) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (let ((.cse0 (select v_arrayElimArr_2 4)) (.cse1 (select v_arrayElimArr_3 4))) (or (= (select v_arrayElimArr_5 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select v_arrayElimArr_1 4) 0) (= .cse0 .cse1) (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) |v_ULTIMATE.start_main_~p~0#1.base_47| v_arrayElimArr_5) |v_ULTIMATE.start_main_~p~0#1.base_45| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_43| v_arrayElimArr_3) .cse1 v_arrayElimArr_2) .cse0 v_arrayElimArr_1) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_618) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= (select v_arrayElimArr_4 4) 0) (= .cse0 0) (= .cse1 0)))) is different from false [2021-12-06 20:42:49,837 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 20:42:49,837 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 44 [2021-12-06 20:42:50,077 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_43| Int) (|v_ULTIMATE.start_main_~p~0#1.base_45| Int) (|v_ULTIMATE.start_main_~p~0#1.base_47| Int) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int)) (let ((.cse1 (select v_arrayElimArr_2 4)) (.cse0 (select v_arrayElimArr_3 4))) (or (= (select v_arrayElimArr_5 4) 0) (not (= (select (select (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_47| v_arrayElimArr_5) |v_ULTIMATE.start_main_~p~0#1.base_45| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_43| v_arrayElimArr_3) .cse0 v_arrayElimArr_2) .cse1 v_arrayElimArr_1) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_618) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select v_arrayElimArr_1 4) 0) (= .cse1 .cse0) (= (select v_arrayElimArr_6 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= (select v_arrayElimArr_4 4) 0) (= .cse1 0) (= .cse0 0)))) is different from false [2021-12-06 20:42:50,889 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_43| Int) (|v_ULTIMATE.start_main_~p~0#1.base_45| Int) (|v_ULTIMATE.start_main_~p~0#1.base_47| Int) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int) (|v_ULTIMATE.start_main_~p~0#1.base_49| Int)) (let ((.cse1 (select v_arrayElimArr_2 4)) (.cse0 (select v_arrayElimArr_3 4))) (or (= (select v_arrayElimArr_5 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) |v_ULTIMATE.start_main_~p~0#1.base_49| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_47| v_arrayElimArr_5) |v_ULTIMATE.start_main_~p~0#1.base_45| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_43| v_arrayElimArr_3) .cse0 v_arrayElimArr_2) .cse1 v_arrayElimArr_1) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_618) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= (select v_arrayElimArr_6 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select v_arrayElimArr_1 4) 0) (= .cse1 .cse0) (= (select v_arrayElimArr_4 4) 0) (= .cse1 0) (= .cse0 0)))) is different from false [2021-12-06 20:42:51,179 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 20:42:51,179 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 47 [2021-12-06 20:42:51,520 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_43| Int) (|v_ULTIMATE.start_main_~p~0#1.base_45| Int) (|v_ULTIMATE.start_main_~p~0#1.base_47| Int) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int) (|v_ULTIMATE.start_main_~p~0#1.base_49| Int)) (let ((.cse1 (select v_arrayElimArr_2 4)) (.cse0 (select v_arrayElimArr_3 4))) (or (= (select v_arrayElimArr_6 4) 0) (= (select v_arrayElimArr_5 4) 0) (= (select v_arrayElimArr_7 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (not (= (select (select (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_7) |v_ULTIMATE.start_main_~p~0#1.base_49| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_47| v_arrayElimArr_5) |v_ULTIMATE.start_main_~p~0#1.base_45| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_43| v_arrayElimArr_3) .cse0 v_arrayElimArr_2) .cse1 v_arrayElimArr_1) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_618) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select v_arrayElimArr_1 4) 0) (= .cse1 .cse0) (= (select v_arrayElimArr_4 4) 0) (= .cse1 0) (= .cse0 0)))) is different from false [2021-12-06 20:42:52,521 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_43| Int) (|v_ULTIMATE.start_main_~p~0#1.base_45| Int) (|v_ULTIMATE.start_main_~p~0#1.base_47| Int) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int) (|v_ULTIMATE.start_main_~p~0#1.base_49| Int)) (let ((.cse1 (select v_arrayElimArr_2 4)) (.cse0 (select v_arrayElimArr_3 4))) (or (= (select v_arrayElimArr_6 4) 0) (= (select v_arrayElimArr_5 4) 0) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select v_arrayElimArr_1 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) |v_ULTIMATE.start_main_~p~0#1.base_51| v_arrayElimArr_7) |v_ULTIMATE.start_main_~p~0#1.base_49| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_47| v_arrayElimArr_5) |v_ULTIMATE.start_main_~p~0#1.base_45| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_43| v_arrayElimArr_3) .cse0 v_arrayElimArr_2) .cse1 v_arrayElimArr_1) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_618) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= .cse1 .cse0) (= (select v_arrayElimArr_7 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0) (= (select v_arrayElimArr_4 4) 0) (= .cse1 0) (= .cse0 0)))) is different from false [2021-12-06 20:42:52,882 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 20:42:52,882 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2021-12-06 20:42:53,286 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.base| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_43| Int) (|v_ULTIMATE.start_main_~p~0#1.base_45| Int) (|v_ULTIMATE.start_main_~p~0#1.base_47| Int) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int) (|v_ULTIMATE.start_main_~p~0#1.base_49| Int)) (let ((.cse1 (select v_arrayElimArr_2 4)) (.cse0 (select v_arrayElimArr_3 4))) (or (= (select v_arrayElimArr_6 4) 0) (= (select v_arrayElimArr_5 4) 0) (not (= (select (select (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_51| v_arrayElimArr_7) |v_ULTIMATE.start_main_~p~0#1.base_49| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_47| v_arrayElimArr_5) |v_ULTIMATE.start_main_~p~0#1.base_45| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_43| v_arrayElimArr_3) .cse0 v_arrayElimArr_2) .cse1 v_arrayElimArr_1) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_618) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) (= (select v_arrayElimArr_8 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) 0) (= 0 (select v_arrayElimArr_7 4)) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select v_arrayElimArr_1 4) 0) (= .cse1 .cse0) (= (select v_arrayElimArr_4 4) 0) (= .cse1 0) (= .cse0 0)))) is different from false [2021-12-06 20:42:54,544 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_569 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_53| Int) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_43| Int) (|v_ULTIMATE.start_main_~p~0#1.base_45| Int) (|v_ULTIMATE.start_main_~p~0#1.base_47| Int) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int) (|v_ULTIMATE.start_main_~p~0#1.base_49| Int)) (let ((.cse0 (select v_arrayElimArr_2 4)) (.cse1 (select v_arrayElimArr_3 4))) (or (= (select v_arrayElimArr_6 4) 0) (= (select v_arrayElimArr_5 4) 0) (= 0 (select v_arrayElimArr_7 4)) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select v_arrayElimArr_1 4) 0) (= .cse0 .cse1) (not (= 0 (select (select (store (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_569) |v_ULTIMATE.start_main_~p~0#1.base_53| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_51| v_arrayElimArr_7) |v_ULTIMATE.start_main_~p~0#1.base_49| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_47| v_arrayElimArr_5) |v_ULTIMATE.start_main_~p~0#1.base_45| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_43| v_arrayElimArr_3) .cse1 v_arrayElimArr_2) .cse0 v_arrayElimArr_1) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_618) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (= (select v_arrayElimArr_4 4) 0) (= .cse0 0) (= .cse1 0) (= (select v_arrayElimArr_8 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) 0)))) is different from false [2021-12-06 20:42:55,407 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_5 (Array Int Int)) (v_arrayElimArr_8 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_51| Int) (v_ArrVal_569 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_53| Int) (v_ArrVal_618 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.base_43| Int) (|v_ULTIMATE.start_main_~p~0#1.base_45| Int) (|v_ULTIMATE.start_main_~p~0#1.base_47| Int) (|v_ULTIMATE.start_main_~p~0#1.base_39| Int) (|v_ULTIMATE.start_main_~p~0#1.base_49| Int)) (let ((.cse0 (select v_arrayElimArr_2 4)) (.cse1 (select v_arrayElimArr_3 4))) (or (= (select v_arrayElimArr_6 4) 0) (= (select v_arrayElimArr_5 4) 0) (= (select v_arrayElimArr_8 4) 0) (= 0 (select v_arrayElimArr_7 4)) (and (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |v_ULTIMATE.start_main_~p~0#1.base_39| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select v_arrayElimArr_1 4) 0) (= .cse0 .cse1) (not (= 0 (select (select (store (store (store (store (store (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_569) |v_ULTIMATE.start_main_~p~0#1.base_53| v_arrayElimArr_8) |v_ULTIMATE.start_main_~p~0#1.base_51| v_arrayElimArr_7) |v_ULTIMATE.start_main_~p~0#1.base_49| v_arrayElimArr_6) |v_ULTIMATE.start_main_~p~0#1.base_47| v_arrayElimArr_5) |v_ULTIMATE.start_main_~p~0#1.base_45| v_arrayElimArr_4) |v_ULTIMATE.start_main_~p~0#1.base_43| v_arrayElimArr_3) .cse1 v_arrayElimArr_2) .cse0 v_arrayElimArr_1) |v_ULTIMATE.start_main_~p~0#1.base_39| v_ArrVal_618) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (= (select v_arrayElimArr_4 4) 0) (= .cse0 0) (= .cse1 0)))) is different from false [2021-12-06 20:42:56,351 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-06 20:42:56,351 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55