./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/list-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_22237d72-4bae-4097-9a73-c0d411ac7b4d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_22237d72-4bae-4097-9a73-c0d411ac7b4d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_22237d72-4bae-4097-9a73-c0d411ac7b4d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_22237d72-4bae-4097-9a73-c0d411ac7b4d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/list-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_22237d72-4bae-4097-9a73-c0d411ac7b4d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_22237d72-4bae-4097-9a73-c0d411ac7b4d/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6439b1baef116d71fdff38c675a38b8a29c42257 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:11:03,719 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:11:03,721 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:11:03,733 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:11:03,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:11:03,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:11:03,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:11:03,739 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:11:03,741 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:11:03,743 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:11:03,744 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:11:03,745 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:11:03,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:11:03,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:11:03,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:11:03,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:11:03,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:11:03,752 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:11:03,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:11:03,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:11:03,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:11:03,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:11:03,762 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:11:03,763 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:11:03,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:11:03,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:11:03,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:11:03,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:11:03,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:11:03,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:11:03,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:11:03,771 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:11:03,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:11:03,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:11:03,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:11:03,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:11:03,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:11:03,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:11:03,776 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:11:03,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:11:03,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:11:03,779 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_22237d72-4bae-4097-9a73-c0d411ac7b4d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:11:03,797 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:11:03,797 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:11:03,798 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:11:03,799 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:11:03,799 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:11:03,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:11:03,800 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:11:03,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:11:03,800 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:11:03,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:11:03,801 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:11:03,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:11:03,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:11:03,802 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:11:03,802 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:11:03,802 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:11:03,803 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:11:03,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:11:03,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:11:03,804 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:11:03,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:11:03,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:11:03,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:11:03,805 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:11:03,805 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:11:03,805 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:11:03,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:11:03,806 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:11:03,806 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-vcloud-master/worker/run_dir_22237d72-4bae-4097-9a73-c0d411ac7b4d/bin/uautomizer 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(__VERIFIER_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 -> 6439b1baef116d71fdff38c675a38b8a29c42257 [2019-11-15 23:11:03,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:11:03,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:11:03,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:11:03,872 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:11:03,873 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:11:03,874 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_22237d72-4bae-4097-9a73-c0d411ac7b4d/bin/uautomizer/../../sv-benchmarks/c/list-properties/list-2.i [2019-11-15 23:11:03,941 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_22237d72-4bae-4097-9a73-c0d411ac7b4d/bin/uautomizer/data/5449e2538/021b978d373e46cbad2e446331556fa2/FLAG7ac9b6323 [2019-11-15 23:11:04,499 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:11:04,499 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_22237d72-4bae-4097-9a73-c0d411ac7b4d/sv-benchmarks/c/list-properties/list-2.i [2019-11-15 23:11:04,514 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_22237d72-4bae-4097-9a73-c0d411ac7b4d/bin/uautomizer/data/5449e2538/021b978d373e46cbad2e446331556fa2/FLAG7ac9b6323 [2019-11-15 23:11:04,823 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_22237d72-4bae-4097-9a73-c0d411ac7b4d/bin/uautomizer/data/5449e2538/021b978d373e46cbad2e446331556fa2 [2019-11-15 23:11:04,827 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:11:04,828 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:11:04,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:11:04,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:11:04,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:11:04,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:11:04" (1/1) ... [2019-11-15 23:11:04,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14aebc60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:11:04, skipping insertion in model container [2019-11-15 23:11:04,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:11:04" (1/1) ... [2019-11-15 23:11:04,849 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:11:04,900 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:11:05,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:11:05,446 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:11:05,520 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:11:05,589 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:11:05,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:11:05 WrapperNode [2019-11-15 23:11:05,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:11:05,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:11:05,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:11:05,595 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:11:05,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:11:05" (1/1) ... [2019-11-15 23:11:05,624 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:11:05" (1/1) ... [2019-11-15 23:11:05,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:11:05,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:11:05,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:11:05,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:11:05,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:11:05" (1/1) ... [2019-11-15 23:11:05,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:11:05" (1/1) ... [2019-11-15 23:11:05,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:11:05" (1/1) ... [2019-11-15 23:11:05,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:11:05" (1/1) ... [2019-11-15 23:11:05,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:11:05" (1/1) ... [2019-11-15 23:11:05,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:11:05" (1/1) ... [2019-11-15 23:11:05,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:11:05" (1/1) ... [2019-11-15 23:11:05,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:11:05,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:11:05,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:11:05,683 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:11:05,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:11:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22237d72-4bae-4097-9a73-c0d411ac7b4d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:11:05,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:11:05,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:11:05,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:11:05,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:11:05,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:11:05,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:11:05,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:11:06,158 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:11:06,158 INFO L284 CfgBuilder]: Removed 14 assume(true) statements. [2019-11-15 23:11:06,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:11:06 BoogieIcfgContainer [2019-11-15 23:11:06,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:11:06,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:11:06,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:11:06,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:11:06,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:11:04" (1/3) ... [2019-11-15 23:11:06,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ced77a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:11:06, skipping insertion in model container [2019-11-15 23:11:06,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:11:05" (2/3) ... [2019-11-15 23:11:06,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ced77a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:11:06, skipping insertion in model container [2019-11-15 23:11:06,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:11:06" (3/3) ... [2019-11-15 23:11:06,169 INFO L109 eAbstractionObserver]: Analyzing ICFG list-2.i [2019-11-15 23:11:06,180 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:11:06,189 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:11:06,201 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:11:06,242 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:11:06,242 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:11:06,243 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:11:06,243 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:11:06,243 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:11:06,243 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:11:06,243 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:11:06,244 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:11:06,267 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-15 23:11:06,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 23:11:06,274 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:11:06,275 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:11:06,277 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:11:06,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:11:06,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1661254537, now seen corresponding path program 1 times [2019-11-15 23:11:06,292 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:11:06,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737904769] [2019-11-15 23:11:06,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:06,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:06,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:11:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:06,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:11:06,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737904769] [2019-11-15 23:11:06,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:11:06,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:11:06,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286555670] [2019-11-15 23:11:06,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 23:11:06,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:11:06,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:11:06,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:11:06,442 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-11-15 23:11:06,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:11:06,461 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2019-11-15 23:11:06,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:11:06,462 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-15 23:11:06,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:11:06,474 INFO L225 Difference]: With dead ends: 46 [2019-11-15 23:11:06,474 INFO L226 Difference]: Without dead ends: 21 [2019-11-15 23:11:06,477 INFO L600 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 [2019-11-15 23:11:06,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-15 23:11:06,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-15 23:11:06,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 23:11:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-15 23:11:06,514 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2019-11-15 23:11:06,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:11:06,514 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-15 23:11:06,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 23:11:06,515 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-11-15 23:11:06,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 23:11:06,516 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:11:06,516 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:11:06,516 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:11:06,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:11:06,517 INFO L82 PathProgramCache]: Analyzing trace with hash 57591681, now seen corresponding path program 1 times [2019-11-15 23:11:06,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:11:06,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241983278] [2019-11-15 23:11:06,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:06,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:06,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:11:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:06,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:11:06,655 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241983278] [2019-11-15 23:11:06,655 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:11:06,655 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:11:06,655 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271913517] [2019-11-15 23:11:06,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:11:06,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:11:06,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:11:06,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:11:06,659 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 5 states. [2019-11-15 23:11:06,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:11:06,844 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-11-15 23:11:06,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:11:06,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-15 23:11:06,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:11:06,847 INFO L225 Difference]: With dead ends: 46 [2019-11-15 23:11:06,848 INFO L226 Difference]: Without dead ends: 42 [2019-11-15 23:11:06,849 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:11:06,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-15 23:11:06,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-11-15 23:11:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 23:11:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-15 23:11:06,856 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 16 [2019-11-15 23:11:06,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:11:06,857 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-15 23:11:06,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:11:06,857 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-11-15 23:11:06,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 23:11:06,858 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:11:06,858 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:11:06,859 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:11:06,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:11:06,859 INFO L82 PathProgramCache]: Analyzing trace with hash -440293124, now seen corresponding path program 1 times [2019-11-15 23:11:06,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:11:06,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998587273] [2019-11-15 23:11:06,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:06,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:06,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:11:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:11:06,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998587273] [2019-11-15 23:11:06,977 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:11:06,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:11:06,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764934352] [2019-11-15 23:11:06,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:11:06,978 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:11:06,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:11:06,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:11:06,979 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 5 states. [2019-11-15 23:11:07,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:11:07,141 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-11-15 23:11:07,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:11:07,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-15 23:11:07,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:11:07,144 INFO L225 Difference]: With dead ends: 48 [2019-11-15 23:11:07,145 INFO L226 Difference]: Without dead ends: 40 [2019-11-15 23:11:07,145 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:11:07,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-15 23:11:07,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2019-11-15 23:11:07,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 23:11:07,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-11-15 23:11:07,151 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2019-11-15 23:11:07,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:11:07,152 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-15 23:11:07,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:11:07,152 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-11-15 23:11:07,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 23:11:07,153 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:11:07,153 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:11:07,153 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:11:07,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:11:07,155 INFO L82 PathProgramCache]: Analyzing trace with hash 584409852, now seen corresponding path program 1 times [2019-11-15 23:11:07,155 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:11:07,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269608754] [2019-11-15 23:11:07,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:07,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:07,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:11:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:07,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:11:07,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269608754] [2019-11-15 23:11:07,245 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:11:07,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:11:07,245 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102054615] [2019-11-15 23:11:07,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:11:07,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:11:07,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:11:07,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:11:07,247 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 5 states. [2019-11-15 23:11:07,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:11:07,384 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-11-15 23:11:07,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:11:07,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-15 23:11:07,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:11:07,386 INFO L225 Difference]: With dead ends: 48 [2019-11-15 23:11:07,386 INFO L226 Difference]: Without dead ends: 37 [2019-11-15 23:11:07,387 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:11:07,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-15 23:11:07,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2019-11-15 23:11:07,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-15 23:11:07,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-11-15 23:11:07,391 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2019-11-15 23:11:07,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:11:07,392 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-11-15 23:11:07,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:11:07,392 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-11-15 23:11:07,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 23:11:07,393 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:11:07,393 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:11:07,393 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:11:07,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:11:07,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1573518424, now seen corresponding path program 1 times [2019-11-15 23:11:07,395 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:11:07,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710820936] [2019-11-15 23:11:07,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:07,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:07,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:11:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:07,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:11:07,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710820936] [2019-11-15 23:11:07,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939367605] [2019-11-15 23:11:07,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22237d72-4bae-4097-9a73-c0d411ac7b4d/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:11:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:07,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-15 23:11:07,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:11:07,785 INFO L375 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 [2019-11-15 23:11:07,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:07,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:07,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:07,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 23:11:07,819 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:07,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:11:07,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:07,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:07,843 INFO L375 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 11 treesize of output 7 [2019-11-15 23:11:07,844 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:07,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:07,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:07,858 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-15 23:11:07,896 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-15 23:11:07,896 INFO L375 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 27 treesize of output 11 [2019-11-15 23:11:07,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:07,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:07,910 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:07,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-15 23:11:07,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 23:11:07,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:07,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:07,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:11:07,966 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-15 23:11:08,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:11:08,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:08,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:08,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:08,032 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-15 23:11:08,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:11:08,037 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:11:08,037 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-15 23:11:08,037 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066220496] [2019-11-15 23:11:08,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:11:08,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:11:08,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:11:08,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:11:08,045 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 10 states. [2019-11-15 23:11:08,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:11:08,475 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2019-11-15 23:11:08,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:11:08,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-15 23:11:08,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:11:08,477 INFO L225 Difference]: With dead ends: 50 [2019-11-15 23:11:08,477 INFO L226 Difference]: Without dead ends: 44 [2019-11-15 23:11:08,478 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:11:08,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-15 23:11:08,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2019-11-15 23:11:08,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-15 23:11:08,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-11-15 23:11:08,492 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 20 [2019-11-15 23:11:08,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:11:08,493 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-11-15 23:11:08,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:11:08,494 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-11-15 23:11:08,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 23:11:08,496 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:11:08,496 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:11:08,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:11:08,710 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:11:08,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:11:08,710 INFO L82 PathProgramCache]: Analyzing trace with hash -710116760, now seen corresponding path program 1 times [2019-11-15 23:11:08,710 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:11:08,710 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370778603] [2019-11-15 23:11:08,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:08,711 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:08,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:11:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:08,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:11:08,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370778603] [2019-11-15 23:11:08,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410637145] [2019-11-15 23:11:08,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22237d72-4bae-4097-9a73-c0d411ac7b4d/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:11:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:08,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-15 23:11:08,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:11:08,961 INFO L375 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 [2019-11-15 23:11:08,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:08,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:08,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:08,965 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 23:11:08,988 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:08,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:11:08,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:09,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:09,010 INFO L375 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 11 treesize of output 7 [2019-11-15 23:11:09,011 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:09,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:09,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:09,022 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-15 23:11:09,058 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-15 23:11:09,058 INFO L375 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 27 treesize of output 11 [2019-11-15 23:11:09,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:09,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:09,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:09,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-15 23:11:09,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 23:11:09,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:09,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:09,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:11:09,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-15 23:11:09,153 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:11:09,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:09,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:09,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:09,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-15 23:11:09,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:11:09,171 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:11:09,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-15 23:11:09,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692616382] [2019-11-15 23:11:09,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:11:09,172 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:11:09,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:11:09,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:11:09,173 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 10 states. [2019-11-15 23:11:09,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:11:09,597 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2019-11-15 23:11:09,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:11:09,602 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-15 23:11:09,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:11:09,603 INFO L225 Difference]: With dead ends: 59 [2019-11-15 23:11:09,603 INFO L226 Difference]: Without dead ends: 55 [2019-11-15 23:11:09,604 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:11:09,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-15 23:11:09,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 43. [2019-11-15 23:11:09,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-15 23:11:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-11-15 23:11:09,611 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 20 [2019-11-15 23:11:09,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:11:09,611 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-11-15 23:11:09,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:11:09,612 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2019-11-15 23:11:09,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:11:09,613 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:11:09,613 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:11:09,824 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:11:09,825 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:11:09,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:11:09,825 INFO L82 PathProgramCache]: Analyzing trace with hash 750661987, now seen corresponding path program 1 times [2019-11-15 23:11:09,826 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:11:09,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122821402] [2019-11-15 23:11:09,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:09,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:09,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:11:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:11:10,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122821402] [2019-11-15 23:11:10,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156808836] [2019-11-15 23:11:10,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22237d72-4bae-4097-9a73-c0d411ac7b4d/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:11:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:10,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-15 23:11:10,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:11:10,187 INFO L375 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 [2019-11-15 23:11:10,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:10,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:10,190 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:10,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 23:11:10,234 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:10,235 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:11:10,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:10,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:10,242 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:10,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-15 23:11:10,278 INFO L375 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 13 treesize of output 9 [2019-11-15 23:11:10,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:10,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:10,308 INFO L375 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 13 treesize of output 9 [2019-11-15 23:11:10,308 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:10,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:10,321 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:10,321 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-15 23:11:10,358 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_20|], 2=[|v_#memory_$Pointer$.base_16|, |v_#memory_$Pointer$.offset_14|]} [2019-11-15 23:11:10,367 INFO L375 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 29 treesize of output 19 [2019-11-15 23:11:10,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:10,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:10,408 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:10,409 INFO L375 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 120 treesize of output 132 [2019-11-15 23:11:10,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:11:10,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:10,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:10,444 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 23:11:10,496 INFO L567 ElimStorePlain]: treesize reduction 188, result has 28.5 percent of original size [2019-11-15 23:11:10,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-11-15 23:11:10,506 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:10,514 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:10,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:10,515 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-15 23:11:10,564 INFO L375 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 39 treesize of output 21 [2019-11-15 23:11:10,565 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:10,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:10,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 11 [2019-11-15 23:11:10,580 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:10,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:10,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:10,588 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-15 23:11:10,599 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 23:11:10,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:10,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:10,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:10,603 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-15 23:11:10,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:11:10,607 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:11:10,607 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-11-15 23:11:10,607 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106093343] [2019-11-15 23:11:10,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 23:11:10,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:11:10,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:11:10,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:11:10,608 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 14 states. [2019-11-15 23:11:11,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:11:11,078 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2019-11-15 23:11:11,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:11:11,078 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-11-15 23:11:11,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:11:11,079 INFO L225 Difference]: With dead ends: 63 [2019-11-15 23:11:11,079 INFO L226 Difference]: Without dead ends: 59 [2019-11-15 23:11:11,080 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:11:11,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-15 23:11:11,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2019-11-15 23:11:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-15 23:11:11,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2019-11-15 23:11:11,094 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 22 [2019-11-15 23:11:11,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:11:11,095 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2019-11-15 23:11:11,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 23:11:11,095 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2019-11-15 23:11:11,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:11:11,097 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:11:11,097 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:11:11,302 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:11:11,303 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:11:11,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:11:11,303 INFO L82 PathProgramCache]: Analyzing trace with hash -119659938, now seen corresponding path program 1 times [2019-11-15 23:11:11,303 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:11:11,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487479296] [2019-11-15 23:11:11,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:11,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:11,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:11:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:11:11,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487479296] [2019-11-15 23:11:11,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775074483] [2019-11-15 23:11:11,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22237d72-4bae-4097-9a73-c0d411ac7b4d/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:11:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:11,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-15 23:11:11,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:11:11,579 INFO L375 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 [2019-11-15 23:11:11,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:11,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:11,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:11,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 23:11:11,659 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:11,660 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:11:11,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:11,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:11,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:11,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-15 23:11:11,703 INFO L375 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 13 treesize of output 9 [2019-11-15 23:11:11,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:11,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:11,729 INFO L375 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 13 treesize of output 9 [2019-11-15 23:11:11,730 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:11,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:11,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:11,745 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-15 23:11:11,779 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_21|], 2=[|v_#memory_$Pointer$.base_18|, |v_#memory_$Pointer$.offset_16|]} [2019-11-15 23:11:11,786 INFO L375 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 29 treesize of output 19 [2019-11-15 23:11:11,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:11,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:11,835 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:11,836 INFO L375 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 120 treesize of output 132 [2019-11-15 23:11:11,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:11:11,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:11,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:11,839 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 23:11:11,870 INFO L567 ElimStorePlain]: treesize reduction 188, result has 28.5 percent of original size [2019-11-15 23:11:11,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-11-15 23:11:11,874 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:11,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:11,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:11,889 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-15 23:11:11,920 INFO L375 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 39 treesize of output 21 [2019-11-15 23:11:11,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:11,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:11,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 11 [2019-11-15 23:11:11,935 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:11,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:11,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:11,942 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-15 23:11:11,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 23:11:11,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:11,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:11,951 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:11,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-15 23:11:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:11:11,954 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:11:11,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-11-15 23:11:11,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879297225] [2019-11-15 23:11:11,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 23:11:11,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:11:11,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:11:11,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:11:11,956 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 14 states. [2019-11-15 23:11:12,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:11:12,421 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2019-11-15 23:11:12,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:11:12,421 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-11-15 23:11:12,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:11:12,422 INFO L225 Difference]: With dead ends: 65 [2019-11-15 23:11:12,422 INFO L226 Difference]: Without dead ends: 55 [2019-11-15 23:11:12,423 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:11:12,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-15 23:11:12,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2019-11-15 23:11:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-15 23:11:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2019-11-15 23:11:12,430 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 24 [2019-11-15 23:11:12,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:11:12,431 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2019-11-15 23:11:12,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 23:11:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2019-11-15 23:11:12,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:11:12,432 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:11:12,432 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:11:12,635 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:11:12,636 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:11:12,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:11:12,636 INFO L82 PathProgramCache]: Analyzing trace with hash 905043038, now seen corresponding path program 2 times [2019-11-15 23:11:12,636 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:11:12,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977030586] [2019-11-15 23:11:12,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:12,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:12,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:11:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:11:12,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977030586] [2019-11-15 23:11:12,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909938646] [2019-11-15 23:11:12,798 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22237d72-4bae-4097-9a73-c0d411ac7b4d/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:11:12,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:11:12,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:11:12,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-15 23:11:12,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:11:12,895 INFO L375 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 [2019-11-15 23:11:12,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:12,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:12,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:12,902 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 23:11:12,917 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:12,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:11:12,918 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:12,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:12,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:12,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 23:11:12,938 INFO L375 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 11 treesize of output 7 [2019-11-15 23:11:12,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:12,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:12,955 INFO L375 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 11 treesize of output 7 [2019-11-15 23:11:12,956 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:12,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:12,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:12,978 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2019-11-15 23:11:12,993 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_22|], 2=[|v_#memory_$Pointer$.offset_18|, |v_#memory_$Pointer$.base_20|]} [2019-11-15 23:11:12,999 INFO L375 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 23 treesize of output 15 [2019-11-15 23:11:12,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:13,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:13,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 68 [2019-11-15 23:11:13,038 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:13,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:13,077 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:13,078 INFO L375 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 59 treesize of output 85 [2019-11-15 23:11:13,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:11:13,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:13,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:13,081 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-11-15 23:11:13,119 INFO L567 ElimStorePlain]: treesize reduction 76, result has 26.9 percent of original size [2019-11-15 23:11:13,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:13,119 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2019-11-15 23:11:13,144 INFO L375 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 31 treesize of output 19 [2019-11-15 23:11:13,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:13,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:13,154 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 11 [2019-11-15 23:11:13,154 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:13,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:13,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:13,159 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2019-11-15 23:11:13,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 23:11:13,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:13,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:13,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:13,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-15 23:11:13,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:11:13,175 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:11:13,176 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-15 23:11:13,176 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973488792] [2019-11-15 23:11:13,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:11:13,177 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:11:13,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:11:13,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:11:13,177 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 10 states. [2019-11-15 23:11:13,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:11:13,502 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2019-11-15 23:11:13,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:11:13,502 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-15 23:11:13,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:11:13,504 INFO L225 Difference]: With dead ends: 58 [2019-11-15 23:11:13,504 INFO L226 Difference]: Without dead ends: 45 [2019-11-15 23:11:13,504 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:11:13,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-15 23:11:13,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2019-11-15 23:11:13,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 23:11:13,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-11-15 23:11:13,509 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 24 [2019-11-15 23:11:13,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:11:13,509 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-11-15 23:11:13,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:11:13,510 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-11-15 23:11:13,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:11:13,510 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:11:13,511 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:11:13,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:11:13,720 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:11:13,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:11:13,720 INFO L82 PathProgramCache]: Analyzing trace with hash -719006641, now seen corresponding path program 2 times [2019-11-15 23:11:13,721 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:11:13,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916017853] [2019-11-15 23:11:13,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:13,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:13,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:11:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:13,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:11:13,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916017853] [2019-11-15 23:11:13,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170527939] [2019-11-15 23:11:13,915 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22237d72-4bae-4097-9a73-c0d411ac7b4d/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:11:14,001 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:11:14,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:11:14,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-15 23:11:14,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:11:14,010 INFO L375 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 [2019-11-15 23:11:14,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:14,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:14,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:14,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 23:11:14,048 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:14,048 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 23:11:14,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:14,082 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-15 23:11:14,086 INFO L375 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 11 treesize of output 7 [2019-11-15 23:11:14,086 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:14,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:14,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:14,101 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-11-15 23:11:14,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:14,175 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-15 23:11:14,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:14,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:14,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:14,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-15 23:11:14,263 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:14,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-15 23:11:14,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:14,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:14,295 INFO L375 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 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 23:11:14,295 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:14,321 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:14,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:14,322 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2019-11-15 23:11:14,366 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-15 23:11:14,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 23:11:14,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:14,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:14,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:11:14,381 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-11-15 23:11:14,427 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-15 23:11:14,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:14,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:14,463 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 23:11:14,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2019-11-15 23:11:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:11:14,588 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:11:14,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2019-11-15 23:11:14,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936713830] [2019-11-15 23:11:14,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 23:11:14,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:11:14,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 23:11:14,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:11:14,590 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 18 states. [2019-11-15 23:11:15,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:11:15,320 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2019-11-15 23:11:15,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 23:11:15,320 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-11-15 23:11:15,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:11:15,321 INFO L225 Difference]: With dead ends: 77 [2019-11-15 23:11:15,321 INFO L226 Difference]: Without dead ends: 69 [2019-11-15 23:11:15,322 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-11-15 23:11:15,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-15 23:11:15,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2019-11-15 23:11:15,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-15 23:11:15,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-11-15 23:11:15,329 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 24 [2019-11-15 23:11:15,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:11:15,329 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-11-15 23:11:15,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 23:11:15,329 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-11-15 23:11:15,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:11:15,330 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:11:15,330 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:11:15,535 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:11:15,536 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:11:15,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:11:15,536 INFO L82 PathProgramCache]: Analyzing trace with hash -419304689, now seen corresponding path program 1 times [2019-11-15 23:11:15,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:11:15,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200081115] [2019-11-15 23:11:15,536 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:15,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:15,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:11:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:15,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:11:15,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200081115] [2019-11-15 23:11:15,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69628110] [2019-11-15 23:11:15,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22237d72-4bae-4097-9a73-c0d411ac7b4d/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:11:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:15,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-15 23:11:15,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:11:15,886 INFO L375 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 [2019-11-15 23:11:15,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:15,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:15,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:15,897 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 23:11:15,930 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:15,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 23:11:15,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:15,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:15,957 INFO L375 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 11 treesize of output 7 [2019-11-15 23:11:15,957 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:15,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:15,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:15,975 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-11-15 23:11:15,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:15,988 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-15 23:11:15,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:16,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:16,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:16,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-15 23:11:16,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:16,052 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 23:11:16,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:16,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:16,067 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:16,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-11-15 23:11:16,108 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-15 23:11:16,108 INFO L375 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 23:11:16,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:16,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:16,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:11:16,120 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-11-15 23:11:16,180 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:16,180 INFO L375 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 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-15 23:11:16,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:16,221 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-11-15 23:11:16,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:16,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:16,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:16,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:11:16,225 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-11-15 23:11:16,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:16,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:16,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:16,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:16,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:16,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:16,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:16,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:16,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:16,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:16,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:16,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:16,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:16,598 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:11:16,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:16,604 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:16,604 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:16,604 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-15 23:11:16,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:11:16,614 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:11:16,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2019-11-15 23:11:16,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758171405] [2019-11-15 23:11:16,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 23:11:16,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:11:16,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 23:11:16,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:11:16,617 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 17 states. [2019-11-15 23:11:17,442 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-11-15 23:11:17,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:11:17,770 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2019-11-15 23:11:17,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 23:11:17,771 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2019-11-15 23:11:17,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:11:17,772 INFO L225 Difference]: With dead ends: 95 [2019-11-15 23:11:17,772 INFO L226 Difference]: Without dead ends: 89 [2019-11-15 23:11:17,773 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=221, Invalid=835, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 23:11:17,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-15 23:11:17,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 55. [2019-11-15 23:11:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-15 23:11:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2019-11-15 23:11:17,780 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 24 [2019-11-15 23:11:17,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:11:17,780 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2019-11-15 23:11:17,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 23:11:17,780 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2019-11-15 23:11:17,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:11:17,781 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:11:17,781 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:11:17,985 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:11:17,985 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:11:17,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:11:17,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1597731914, now seen corresponding path program 3 times [2019-11-15 23:11:17,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:11:17,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690193476] [2019-11-15 23:11:17,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:17,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:17,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:11:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:11:18,294 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:11:18,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690193476] [2019-11-15 23:11:18,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30322578] [2019-11-15 23:11:18,295 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_22237d72-4bae-4097-9a73-c0d411ac7b4d/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:11:18,379 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-15 23:11:18,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:11:18,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 54 conjunts are in the unsatisfiable core [2019-11-15 23:11:18,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:11:18,394 INFO L375 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 [2019-11-15 23:11:18,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:18,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:18,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:18,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 23:11:18,422 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:18,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 23:11:18,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:18,455 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-15 23:11:18,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:18,455 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-15 23:11:18,497 INFO L375 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 11 treesize of output 7 [2019-11-15 23:11:18,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:18,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:18,523 INFO L375 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 11 treesize of output 7 [2019-11-15 23:11:18,524 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:18,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:18,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:18,540 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-15 23:11:18,607 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:18,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 20 treesize of output 30 [2019-11-15 23:11:18,608 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:18,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:18,655 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_33|], 2=[|v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_21|]} [2019-11-15 23:11:18,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 23:11:18,665 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:18,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:18,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:18,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2019-11-15 23:11:18,712 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:18,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:18,738 INFO L375 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 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 23:11:18,739 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:18,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:18,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:18,755 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:93, output treesize:40 [2019-11-15 23:11:18,804 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_34|], 1=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.offset_22|]} [2019-11-15 23:11:18,809 INFO L375 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 0 case distinctions, treesize of input 39 treesize of output 15 [2019-11-15 23:11:18,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:18,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:18,851 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:18,851 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 67 [2019-11-15 23:11:18,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:18,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:18,854 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:18,898 INFO L567 ElimStorePlain]: treesize reduction 8, result has 90.4 percent of original size [2019-11-15 23:11:18,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:11:18,905 INFO L375 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 0 case distinctions, treesize of input 27 treesize of output 22 [2019-11-15 23:11:18,905 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:18,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:18,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:11:18,924 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:118, output treesize:61 [2019-11-15 23:11:18,969 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_35|, |v_#memory_$Pointer$.offset_23|], 5=[|v_#memory_$Pointer$.base_27|]} [2019-11-15 23:11:18,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2019-11-15 23:11:18,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:18,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:19,003 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2019-11-15 23:11:19,004 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:19,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:19,067 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:19,067 INFO L375 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 118 [2019-11-15 23:11:19,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:11:19,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:19,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:19,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:19,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:19,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:19,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:19,075 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-11-15 23:11:19,129 INFO L567 ElimStorePlain]: treesize reduction 290, result has 18.5 percent of original size [2019-11-15 23:11:19,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:11:19,130 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:155, output treesize:65 [2019-11-15 23:11:19,176 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 1=[|#memory_$Pointer$.base|]} [2019-11-15 23:11:19,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 23:11:19,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:11:19,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:19,233 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:11:19,233 INFO L375 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 37 [2019-11-15 23:11:19,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:19,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:11:19,236 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:11:19,301 INFO L567 ElimStorePlain]: treesize reduction 4, result has 88.2 percent of original size [2019-11-15 23:11:19,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:11:19,303 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:22 [2019-11-15 23:11:19,423 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:11:19,424 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:11:19,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2019-11-15 23:11:19,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513015488] [2019-11-15 23:11:19,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-15 23:11:19,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:11:19,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-15 23:11:19,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:11:19,429 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 19 states. [2019-11-15 23:11:20,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:11:20,217 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2019-11-15 23:11:20,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:11:20,219 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2019-11-15 23:11:20,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:11:20,220 INFO L225 Difference]: With dead ends: 88 [2019-11-15 23:11:20,220 INFO L226 Difference]: Without dead ends: 82 [2019-11-15 23:11:20,221 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2019-11-15 23:11:20,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-15 23:11:20,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 64. [2019-11-15 23:11:20,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-15 23:11:20,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2019-11-15 23:11:20,238 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 26 [2019-11-15 23:11:20,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:11:20,239 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2019-11-15 23:11:20,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-15 23:11:20,239 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2019-11-15 23:11:20,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:11:20,243 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:11:20,243 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:11:20,463 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:11:20,464 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:11:20,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:11:20,464 INFO L82 PathProgramCache]: Analyzing trace with hash 823795978, now seen corresponding path program 1 times [2019-11-15 23:11:20,465 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:11:20,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976846052] [2019-11-15 23:11:20,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:20,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:11:20,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:11:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:11:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:11:20,592 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:11:20,592 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:11:20,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:11:20 BoogieIcfgContainer [2019-11-15 23:11:20,638 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:11:20,639 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:11:20,639 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:11:20,639 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:11:20,640 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:11:06" (3/4) ... [2019-11-15 23:11:20,643 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:11:20,701 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_22237d72-4bae-4097-9a73-c0d411ac7b4d/bin/uautomizer/witness.graphml [2019-11-15 23:11:20,701 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:11:20,703 INFO L168 Benchmark]: Toolchain (without parser) took 15875.24 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 340.3 MB). Free memory was 940.7 MB in the beginning and 1.2 GB in the end (delta: -273.8 MB). Peak memory consumption was 66.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:11:20,703 INFO L168 Benchmark]: CDTParser took 3.84 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:11:20,704 INFO L168 Benchmark]: CACSL2BoogieTranslator took 764.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -205.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:11:20,704 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:11:20,705 INFO L168 Benchmark]: Boogie Preprocessor took 36.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:11:20,705 INFO L168 Benchmark]: RCFGBuilder took 477.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:11:20,706 INFO L168 Benchmark]: TraceAbstraction took 14477.05 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 168.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -110.3 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:11:20,706 INFO L168 Benchmark]: Witness Printer took 62.84 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:11:20,708 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.84 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 764.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -205.6 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.24 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 477.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14477.05 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 168.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -110.3 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. * Witness Printer took 62.84 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 546]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L521] List a = (List) malloc(sizeof(struct node)); [L522] COND FALSE !(a == 0) [L523] List t; [L524] List p = a; [L525] COND TRUE __VERIFIER_nondet_int() [L526] p->h = 1 [L527] t = (List) malloc(sizeof(struct node)) [L528] COND FALSE !(t == 0) [L529] p->n = t [L530] EXPR p->n [L530] p = p->n [L525] COND FALSE !(__VERIFIER_nondet_int()) [L532] COND TRUE __VERIFIER_nondet_int() [L533] p->h = 2 [L534] t = (List) malloc(sizeof(struct node)) [L535] COND FALSE !(t == 0) [L536] p->n = t [L537] EXPR p->n [L537] p = p->n [L532] COND FALSE !(__VERIFIER_nondet_int()) [L539] p->h = 3 [L540] p = a [L541] EXPR p->h [L541] COND FALSE !(p->h == 2) [L543] EXPR p->h [L543] COND TRUE p->h == 1 [L544] EXPR p->n [L544] p = p->n [L543] EXPR p->h [L543] COND FALSE !(p->h == 1) [L545] EXPR p->h [L545] COND TRUE p->h != 3 [L546] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. Result: UNSAFE, OverallTime: 14.4s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 223 SDtfs, 651 SDslu, 1153 SDs, 0 SdLazy, 1853 SolverSat, 268 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 152 SyntacticMatches, 15 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 171 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 458 NumberOfCodeBlocks, 458 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 412 ConstructedInterpolants, 21 QuantifiedInterpolants, 116428 SizeOfPredicates, 91 NumberOfNonLiveVariables, 726 ConjunctsInSsa, 281 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 16/92 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...