./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-queue-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_27cad639-495f-4e3f-bd9c-0c199be71841/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_27cad639-495f-4e3f-bd9c-0c199be71841/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_27cad639-495f-4e3f-bd9c-0c199be71841/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_27cad639-495f-4e3f-bd9c-0c199be71841/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-queue-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_27cad639-495f-4e3f-bd9c-0c199be71841/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_27cad639-495f-4e3f-bd9c-0c199be71841/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 e5083763cd1026dac92f37bc5a05779baf01a71b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 20:16:50,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:16:50,722 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:16:50,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:16:50,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:16:50,737 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:16:50,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:16:50,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:16:50,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:16:50,757 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:16:50,758 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:16:50,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:16:50,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:16:50,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:16:50,763 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:16:50,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:16:50,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:16:50,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:16:50,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:16:50,771 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:16:50,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:16:50,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:16:50,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:16:50,779 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:16:50,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:16:50,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:16:50,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:16:50,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:16:50,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:16:50,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:16:50,785 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:16:50,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:16:50,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:16:50,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:16:50,788 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:16:50,788 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:16:50,789 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:16:50,789 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:16:50,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:16:50,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:16:50,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:16:50,792 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_27cad639-495f-4e3f-bd9c-0c199be71841/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:16:50,815 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:16:50,826 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:16:50,827 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:16:50,828 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:16:50,828 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:16:50,828 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:16:50,828 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:16:50,829 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:16:50,829 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:16:50,829 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:16:50,829 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:16:50,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:16:50,830 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:16:50,830 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:16:50,830 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:16:50,830 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:16:50,831 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:16:50,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:16:50,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:16:50,832 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:16:50,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:16:50,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:16:50,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:16:50,833 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:16:50,834 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:16:50,834 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:16:50,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:16:50,835 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:16:50,835 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_27cad639-495f-4e3f-bd9c-0c199be71841/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 -> e5083763cd1026dac92f37bc5a05779baf01a71b [2019-11-15 20:16:50,859 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:16:50,869 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:16:50,872 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:16:50,873 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:16:50,874 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:16:50,874 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_27cad639-495f-4e3f-bd9c-0c199be71841/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-queue-2.i [2019-11-15 20:16:50,924 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_27cad639-495f-4e3f-bd9c-0c199be71841/bin/uautomizer/data/5413cf936/204ddfe0a49f4b83a284ddae1cbcd572/FLAG9b659c714 [2019-11-15 20:16:51,404 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:16:51,405 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_27cad639-495f-4e3f-bd9c-0c199be71841/sv-benchmarks/c/forester-heap/sll-queue-2.i [2019-11-15 20:16:51,422 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_27cad639-495f-4e3f-bd9c-0c199be71841/bin/uautomizer/data/5413cf936/204ddfe0a49f4b83a284ddae1cbcd572/FLAG9b659c714 [2019-11-15 20:16:51,441 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_27cad639-495f-4e3f-bd9c-0c199be71841/bin/uautomizer/data/5413cf936/204ddfe0a49f4b83a284ddae1cbcd572 [2019-11-15 20:16:51,444 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:16:51,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:16:51,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:16:51,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:16:51,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:16:51,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:16:51" (1/1) ... [2019-11-15 20:16:51,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c191d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:16:51, skipping insertion in model container [2019-11-15 20:16:51,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:16:51" (1/1) ... [2019-11-15 20:16:51,469 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:16:51,523 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:16:51,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:16:51,886 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:16:51,954 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:16:52,005 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:16:52,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:16:52 WrapperNode [2019-11-15 20:16:52,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:16:52,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:16:52,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:16:52,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:16:52,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:16:52" (1/1) ... [2019-11-15 20:16:52,048 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:16:52" (1/1) ... [2019-11-15 20:16:52,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:16:52,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:16:52,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:16:52,075 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:16:52,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:16:52" (1/1) ... [2019-11-15 20:16:52,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:16:52" (1/1) ... [2019-11-15 20:16:52,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:16:52" (1/1) ... [2019-11-15 20:16:52,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:16:52" (1/1) ... [2019-11-15 20:16:52,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:16:52" (1/1) ... [2019-11-15 20:16:52,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:16:52" (1/1) ... [2019-11-15 20:16:52,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:16:52" (1/1) ... [2019-11-15 20:16:52,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:16:52,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:16:52,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:16:52,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:16:52,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:16:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27cad639-495f-4e3f-bd9c-0c199be71841/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 20:16:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:16:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:16:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 20:16:52,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 20:16:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 20:16:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:16:52,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:16:52,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:16:52,727 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:16:52,727 INFO L284 CfgBuilder]: Removed 35 assume(true) statements. [2019-11-15 20:16:52,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:16:52 BoogieIcfgContainer [2019-11-15 20:16:52,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:16:52,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:16:52,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:16:52,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:16:52,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:16:51" (1/3) ... [2019-11-15 20:16:52,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4999485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:16:52, skipping insertion in model container [2019-11-15 20:16:52,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:16:52" (2/3) ... [2019-11-15 20:16:52,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4999485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:16:52, skipping insertion in model container [2019-11-15 20:16:52,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:16:52" (3/3) ... [2019-11-15 20:16:52,736 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-queue-2.i [2019-11-15 20:16:52,745 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:16:52,752 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-11-15 20:16:52,761 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-11-15 20:16:52,786 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:16:52,786 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:16:52,786 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:16:52,786 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:16:52,787 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:16:52,787 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:16:52,787 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:16:52,787 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:16:52,803 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-11-15 20:16:52,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-15 20:16:52,810 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:16:52,810 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-15 20:16:52,813 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:16:52,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:16:52,820 INFO L82 PathProgramCache]: Analyzing trace with hash 28752478, now seen corresponding path program 1 times [2019-11-15 20:16:52,828 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:16:52,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904414791] [2019-11-15 20:16:52,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:16:52,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:16:52,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:16:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:16:52,956 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 20:16:52,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904414791] [2019-11-15 20:16:52,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:16:52,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:16:52,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669578045] [2019-11-15 20:16:52,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 20:16:52,961 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:16:52,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 20:16:52,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 20:16:52,976 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 2 states. [2019-11-15 20:16:53,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:16:53,000 INFO L93 Difference]: Finished difference Result 168 states and 278 transitions. [2019-11-15 20:16:53,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 20:16:53,001 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-11-15 20:16:53,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:16:53,012 INFO L225 Difference]: With dead ends: 168 [2019-11-15 20:16:53,012 INFO L226 Difference]: Without dead ends: 80 [2019-11-15 20:16:53,016 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 20:16:53,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-15 20:16:53,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-15 20:16:53,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-15 20:16:53,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2019-11-15 20:16:53,064 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 5 [2019-11-15 20:16:53,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:16:53,064 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2019-11-15 20:16:53,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 20:16:53,064 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2019-11-15 20:16:53,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-15 20:16:53,065 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:16:53,065 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-15 20:16:53,066 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:16:53,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:16:53,066 INFO L82 PathProgramCache]: Analyzing trace with hash 889571111, now seen corresponding path program 1 times [2019-11-15 20:16:53,066 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:16:53,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930620456] [2019-11-15 20:16:53,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:16:53,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:16:53,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:16:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:16:53,158 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 20:16:53,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930620456] [2019-11-15 20:16:53,158 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:16:53,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:16:53,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292909365] [2019-11-15 20:16:53,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:16:53,160 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:16:53,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:16:53,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:16:53,161 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 3 states. [2019-11-15 20:16:53,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:16:53,203 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2019-11-15 20:16:53,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:16:53,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-11-15 20:16:53,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:16:53,205 INFO L225 Difference]: With dead ends: 80 [2019-11-15 20:16:53,205 INFO L226 Difference]: Without dead ends: 70 [2019-11-15 20:16:53,206 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:16:53,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-15 20:16:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-15 20:16:53,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-15 20:16:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2019-11-15 20:16:53,213 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 6 [2019-11-15 20:16:53,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:16:53,213 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2019-11-15 20:16:53,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:16:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2019-11-15 20:16:53,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 20:16:53,214 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:16:53,214 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:16:53,215 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:16:53,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:16:53,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1270244236, now seen corresponding path program 1 times [2019-11-15 20:16:53,215 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:16:53,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809647239] [2019-11-15 20:16:53,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:16:53,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:16:53,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:16:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:16:53,263 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 20:16:53,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809647239] [2019-11-15 20:16:53,264 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:16:53,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:16:53,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034113906] [2019-11-15 20:16:53,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:16:53,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:16:53,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:16:53,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:16:53,265 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand 3 states. [2019-11-15 20:16:53,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:16:53,297 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-11-15 20:16:53,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:16:53,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-15 20:16:53,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:16:53,298 INFO L225 Difference]: With dead ends: 70 [2019-11-15 20:16:53,299 INFO L226 Difference]: Without dead ends: 68 [2019-11-15 20:16:53,299 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:16:53,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-15 20:16:53,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-15 20:16:53,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-15 20:16:53,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2019-11-15 20:16:53,305 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 9 [2019-11-15 20:16:53,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:16:53,305 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2019-11-15 20:16:53,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:16:53,306 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2019-11-15 20:16:53,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 20:16:53,306 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:16:53,307 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:16:53,307 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:16:53,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:16:53,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1286414876, now seen corresponding path program 1 times [2019-11-15 20:16:53,308 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:16:53,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701620388] [2019-11-15 20:16:53,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:16:53,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:16:53,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:16:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:16:53,343 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 20:16:53,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701620388] [2019-11-15 20:16:53,343 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:16:53,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:16:53,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689917677] [2019-11-15 20:16:53,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:16:53,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:16:53,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:16:53,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:16:53,345 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 3 states. [2019-11-15 20:16:53,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:16:53,419 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2019-11-15 20:16:53,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:16:53,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-15 20:16:53,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:16:53,422 INFO L225 Difference]: With dead ends: 153 [2019-11-15 20:16:53,422 INFO L226 Difference]: Without dead ends: 87 [2019-11-15 20:16:53,423 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:16:53,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-15 20:16:53,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2019-11-15 20:16:53,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-15 20:16:53,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2019-11-15 20:16:53,434 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 12 [2019-11-15 20:16:53,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:16:53,435 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2019-11-15 20:16:53,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:16:53,435 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2019-11-15 20:16:53,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 20:16:53,436 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:16:53,436 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:16:53,436 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:16:53,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:16:53,437 INFO L82 PathProgramCache]: Analyzing trace with hash -138012862, now seen corresponding path program 1 times [2019-11-15 20:16:53,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:16:53,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501151475] [2019-11-15 20:16:53,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:16:53,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:16:53,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:16:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:16:53,558 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 20:16:53,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501151475] [2019-11-15 20:16:53,558 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:16:53,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:16:53,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915916623] [2019-11-15 20:16:53,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:16:53,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:16:53,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:16:53,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:16:53,560 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 5 states. [2019-11-15 20:16:53,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:16:53,783 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2019-11-15 20:16:53,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:16:53,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-15 20:16:53,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:16:53,785 INFO L225 Difference]: With dead ends: 91 [2019-11-15 20:16:53,785 INFO L226 Difference]: Without dead ends: 71 [2019-11-15 20:16:53,786 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 20:16:53,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-15 20:16:53,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-15 20:16:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-15 20:16:53,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2019-11-15 20:16:53,791 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 17 [2019-11-15 20:16:53,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:16:53,797 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2019-11-15 20:16:53,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:16:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2019-11-15 20:16:53,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 20:16:53,798 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:16:53,798 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:16:53,799 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:16:53,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:16:53,799 INFO L82 PathProgramCache]: Analyzing trace with hash -472870040, now seen corresponding path program 1 times [2019-11-15 20:16:53,800 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:16:53,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117512924] [2019-11-15 20:16:53,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:16:53,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:16:53,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:16:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:16:53,908 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 20:16:53,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117512924] [2019-11-15 20:16:53,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843439090] [2019-11-15 20:16:53,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27cad639-495f-4e3f-bd9c-0c199be71841/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 20:16:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:16:53,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 20:16:53,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:16:54,038 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 20:16:54,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:16:54,051 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:16:54,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:16:54,052 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 20:16:54,083 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:16:54,084 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 20:16:54,085 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:16:54,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:16:54,104 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 20:16:54,105 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:16:54,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:16:54,115 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 20:16:54,116 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2019-11-15 20:16:54,220 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-15 20:16:54,220 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 78 [2019-11-15 20:16:54,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:16:54,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:54,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:54,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 20:16:54,261 INFO L567 ElimStorePlain]: treesize reduction 80, result has 25.9 percent of original size [2019-11-15 20:16:54,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:16:54,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2019-11-15 20:16:54,325 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:16:54,325 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 35 treesize of output 30 [2019-11-15 20:16:54,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:16:54,349 INFO L567 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size [2019-11-15 20:16:54,350 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 20:16:54,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-11-15 20:16:54,355 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 20:16:54,356 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:16:54,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-15 20:16:54,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578257979] [2019-11-15 20:16:54,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 20:16:54,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:16:54,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:16:54,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:16:54,357 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand 8 states. [2019-11-15 20:16:54,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:16:54,621 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2019-11-15 20:16:54,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:16:54,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-15 20:16:54,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:16:54,623 INFO L225 Difference]: With dead ends: 144 [2019-11-15 20:16:54,623 INFO L226 Difference]: Without dead ends: 142 [2019-11-15 20:16:54,624 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-15 20:16:54,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-15 20:16:54,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 84. [2019-11-15 20:16:54,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-15 20:16:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2019-11-15 20:16:54,633 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 19 [2019-11-15 20:16:54,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:16:54,633 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2019-11-15 20:16:54,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 20:16:54,634 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2019-11-15 20:16:54,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 20:16:54,634 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:16:54,635 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 20:16:54,839 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:16:54,840 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:16:54,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:16:54,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1456359625, now seen corresponding path program 1 times [2019-11-15 20:16:54,840 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:16:54,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860671372] [2019-11-15 20:16:54,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:16:54,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:16:54,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:16:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:16:54,893 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 20:16:54,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860671372] [2019-11-15 20:16:54,893 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:16:54,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:16:54,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241673022] [2019-11-15 20:16:54,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:16:54,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:16:54,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:16:54,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:16:54,895 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 3 states. [2019-11-15 20:16:54,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:16:54,950 INFO L93 Difference]: Finished difference Result 174 states and 199 transitions. [2019-11-15 20:16:54,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:16:54,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-15 20:16:54,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:16:54,951 INFO L225 Difference]: With dead ends: 174 [2019-11-15 20:16:54,952 INFO L226 Difference]: Without dead ends: 108 [2019-11-15 20:16:54,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:16:54,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-15 20:16:54,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2019-11-15 20:16:54,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-15 20:16:54,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2019-11-15 20:16:54,961 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 20 [2019-11-15 20:16:54,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:16:54,962 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2019-11-15 20:16:54,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:16:54,962 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2019-11-15 20:16:54,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 20:16:54,963 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:16:54,963 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:16:54,964 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:16:54,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:16:54,964 INFO L82 PathProgramCache]: Analyzing trace with hash 886899864, now seen corresponding path program 1 times [2019-11-15 20:16:54,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:16:54,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487922933] [2019-11-15 20:16:54,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:16:54,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:16:54,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:16:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:16:55,020 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 20:16:55,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487922933] [2019-11-15 20:16:55,021 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:16:55,021 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:16:55,021 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550250130] [2019-11-15 20:16:55,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:16:55,022 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:16:55,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:16:55,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:16:55,022 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand 3 states. [2019-11-15 20:16:55,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:16:55,079 INFO L93 Difference]: Finished difference Result 201 states and 228 transitions. [2019-11-15 20:16:55,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:16:55,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 20:16:55,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:16:55,080 INFO L225 Difference]: With dead ends: 201 [2019-11-15 20:16:55,080 INFO L226 Difference]: Without dead ends: 122 [2019-11-15 20:16:55,081 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:16:55,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-15 20:16:55,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2019-11-15 20:16:55,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 20:16:55,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-11-15 20:16:55,101 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 27 [2019-11-15 20:16:55,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:16:55,101 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-11-15 20:16:55,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:16:55,103 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-11-15 20:16:55,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 20:16:55,107 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:16:55,108 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:16:55,108 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:16:55,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:16:55,109 INFO L82 PathProgramCache]: Analyzing trace with hash 2041801735, now seen corresponding path program 1 times [2019-11-15 20:16:55,109 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:16:55,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244544061] [2019-11-15 20:16:55,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:16:55,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:16:55,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:16:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:16:55,252 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:16:55,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244544061] [2019-11-15 20:16:55,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424105543] [2019-11-15 20:16:55,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27cad639-495f-4e3f-bd9c-0c199be71841/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 20:16:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:16:55,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-15 20:16:55,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:16:55,345 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 20:16:55,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:16:55,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:16:55,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:16:55,366 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-15 20:16:55,411 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:16:55,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 28 [2019-11-15 20:16:55,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:16:55,448 INFO L567 ElimStorePlain]: treesize reduction 14, result has 77.4 percent of original size [2019-11-15 20:16:55,471 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:16:55,472 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 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-15 20:16:55,472 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:16:55,512 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.5 percent of original size [2019-11-15 20:16:55,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:55,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:16:55,515 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:39 [2019-11-15 20:16:55,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:55,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:55,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:16:55,583 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:16:55,584 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 55 treesize of output 46 [2019-11-15 20:16:55,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:16:55,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:16:55,604 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 50 treesize of output 34 [2019-11-15 20:16:55,604 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:16:55,722 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-11-15 20:16:55,723 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.0 percent of original size [2019-11-15 20:16:55,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-15 20:16:55,724 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:68 [2019-11-15 20:16:55,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:55,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:55,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:55,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:55,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:55,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:55,884 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:16:55,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 79 [2019-11-15 20:16:55,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:16:55,918 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:16:55,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 91 [2019-11-15 20:16:55,919 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:16:55,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:16:55,992 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 54 treesize of output 37 [2019-11-15 20:16:55,992 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:16:56,037 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:16:56,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 92 [2019-11-15 20:16:56,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:56,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:56,040 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 20:16:56,148 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 39 [2019-11-15 20:16:56,148 INFO L567 ElimStorePlain]: treesize reduction 36, result has 70.5 percent of original size [2019-11-15 20:16:56,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-15 20:16:56,149 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:131, output treesize:73 [2019-11-15 20:16:56,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:56,286 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 42 treesize of output 33 [2019-11-15 20:16:56,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:16:56,376 INFO L341 Elim1Store]: treesize reduction 50, result has 66.2 percent of original size [2019-11-15 20:16:56,377 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 134 [2019-11-15 20:16:56,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:56,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:16:56,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:56,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:56,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:56,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:56,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:56,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:56,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:56,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:56,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:16:56,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:56,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:56,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:56,391 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:16:56,645 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2019-11-15 20:16:56,646 INFO L567 ElimStorePlain]: treesize reduction 747, result has 15.3 percent of original size [2019-11-15 20:16:56,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:16:56,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-11-15 20:16:56,648 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:113, output treesize:135 [2019-11-15 20:16:56,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:00,812 WARN L191 SmtUtils]: Spent 4.13 s on a formula simplification that was a NOOP. DAG size: 60 [2019-11-15 20:17:00,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:00,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:00,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:00,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:00,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:01,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:01,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:01,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:01,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:01,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:01,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:01,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:01,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:01,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:01,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:01,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:01,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:01,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:01,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:01,354 INFO L392 ElimStorePlain]: Different costs {1=[|#memory_$Pointer$.base|], 21=[v_prenex_4]} [2019-11-15 20:17:01,365 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:01,366 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 1 case distinctions, treesize of input 27 treesize of output 23 [2019-11-15 20:17:01,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:01,459 INFO L567 ElimStorePlain]: treesize reduction 4, result has 97.2 percent of original size [2019-11-15 20:17:01,477 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:01,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 53 [2019-11-15 20:17:01,478 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:01,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-11-15 20:17:01,486 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:01,501 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:01,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 50 [2019-11-15 20:17:01,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:01,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:01,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:01,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:01,505 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:17:01,584 INFO L567 ElimStorePlain]: treesize reduction 40, result has 60.4 percent of original size [2019-11-15 20:17:01,585 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-15 20:17:01,586 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:152, output treesize:18 [2019-11-15 20:17:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:17:01,611 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:17:01,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-11-15 20:17:01,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760147863] [2019-11-15 20:17:01,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 20:17:01,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:17:01,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 20:17:01,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:17:01,612 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 12 states. [2019-11-15 20:17:02,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:17:02,052 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2019-11-15 20:17:02,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:17:02,052 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-11-15 20:17:02,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:17:02,053 INFO L225 Difference]: With dead ends: 112 [2019-11-15 20:17:02,053 INFO L226 Difference]: Without dead ends: 110 [2019-11-15 20:17:02,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 20 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-15 20:17:02,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-15 20:17:02,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-11-15 20:17:02,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-15 20:17:02,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2019-11-15 20:17:02,061 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 28 [2019-11-15 20:17:02,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:17:02,061 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2019-11-15 20:17:02,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 20:17:02,061 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2019-11-15 20:17:02,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 20:17:02,062 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:17:02,062 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:17:02,266 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:17:02,267 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:17:02,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:17:02,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1259768676, now seen corresponding path program 1 times [2019-11-15 20:17:02,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:17:02,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792096320] [2019-11-15 20:17:02,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:17:02,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:17:02,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:17:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:17:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 20:17:02,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792096320] [2019-11-15 20:17:02,303 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:17:02,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:17:02,303 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905013103] [2019-11-15 20:17:02,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:17:02,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:17:02,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:17:02,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:17:02,304 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 3 states. [2019-11-15 20:17:02,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:17:02,318 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2019-11-15 20:17:02,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:17:02,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-15 20:17:02,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:17:02,319 INFO L225 Difference]: With dead ends: 111 [2019-11-15 20:17:02,319 INFO L226 Difference]: Without dead ends: 109 [2019-11-15 20:17:02,320 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:17:02,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-15 20:17:02,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-11-15 20:17:02,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 20:17:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2019-11-15 20:17:02,328 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 29 [2019-11-15 20:17:02,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:17:02,328 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2019-11-15 20:17:02,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:17:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2019-11-15 20:17:02,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 20:17:02,330 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:17:02,330 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:17:02,331 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:17:02,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:17:02,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1259766754, now seen corresponding path program 1 times [2019-11-15 20:17:02,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:17:02,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552982879] [2019-11-15 20:17:02,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:17:02,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:17:02,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:17:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:17:02,714 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 20:17:02,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552982879] [2019-11-15 20:17:02,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216126426] [2019-11-15 20:17:02,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27cad639-495f-4e3f-bd9c-0c199be71841/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 20:17:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:17:02,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-15 20:17:02,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:17:02,786 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 20:17:02,787 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:02,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:02,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:02,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 20:17:02,851 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:02,852 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 20:17:02,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:02,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:02,877 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 27 treesize of output 15 [2019-11-15 20:17:02,877 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:02,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:02,899 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 27 treesize of output 15 [2019-11-15 20:17:02,900 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:02,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:02,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:02,914 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:36 [2019-11-15 20:17:02,944 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_17|], 4=[|v_#memory_$Pointer$.offset_24|, |v_#memory_$Pointer$.base_30|]} [2019-11-15 20:17:02,949 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 19 treesize of output 11 [2019-11-15 20:17:02,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:02,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:02,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2019-11-15 20:17:02,968 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:02,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:03,005 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:03,005 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 90 [2019-11-15 20:17:03,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:03,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:03,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:03,008 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-11-15 20:17:03,048 INFO L567 ElimStorePlain]: treesize reduction 126, result has 28.4 percent of original size [2019-11-15 20:17:03,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:03,049 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:111, output treesize:49 [2019-11-15 20:17:03,093 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:03,093 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 49 treesize of output 40 [2019-11-15 20:17:03,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:03,120 INFO L567 ElimStorePlain]: treesize reduction 12, result has 73.3 percent of original size [2019-11-15 20:17:03,122 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 20:17:03,123 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:03,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:03,134 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 20:17:03,134 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:11 [2019-11-15 20:17:03,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:03,168 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 20:17:03,168 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:17:03,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2019-11-15 20:17:03,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133804647] [2019-11-15 20:17:03,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 20:17:03,171 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:17:03,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 20:17:03,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:17:03,172 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 14 states. [2019-11-15 20:17:03,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:17:03,847 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2019-11-15 20:17:03,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 20:17:03,848 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-11-15 20:17:03,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:17:03,849 INFO L225 Difference]: With dead ends: 145 [2019-11-15 20:17:03,849 INFO L226 Difference]: Without dead ends: 143 [2019-11-15 20:17:03,849 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2019-11-15 20:17:03,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-15 20:17:03,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 118. [2019-11-15 20:17:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-15 20:17:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2019-11-15 20:17:03,856 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 29 [2019-11-15 20:17:03,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:17:03,857 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2019-11-15 20:17:03,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 20:17:03,857 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2019-11-15 20:17:03,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 20:17:03,858 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:17:03,859 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:17:04,059 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:17:04,060 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:17:04,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:17:04,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1992708989, now seen corresponding path program 1 times [2019-11-15 20:17:04,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:17:04,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068668067] [2019-11-15 20:17:04,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:17:04,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:17:04,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:17:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:17:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:17:04,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068668067] [2019-11-15 20:17:04,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866837791] [2019-11-15 20:17:04,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27cad639-495f-4e3f-bd9c-0c199be71841/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 20:17:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:17:04,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-15 20:17:04,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:17:04,297 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 20:17:04,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:04,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:04,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:04,306 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-15 20:17:04,351 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:04,351 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 20:17:04,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:04,395 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.3 percent of original size [2019-11-15 20:17:04,400 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 27 treesize of output 15 [2019-11-15 20:17:04,400 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:04,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:04,419 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 27 treesize of output 15 [2019-11-15 20:17:04,420 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:04,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:04,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:04,434 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:49 [2019-11-15 20:17:04,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:04,465 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 20:17:04,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:04,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:04,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:04,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 20:17:04,488 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:04,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:04,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:04,502 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:49 [2019-11-15 20:17:04,525 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:04,525 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 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 20:17:04,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:04,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:04,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 32 [2019-11-15 20:17:04,582 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:04,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:04,634 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:04,634 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 83 [2019-11-15 20:17:04,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:04,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:04,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:04,637 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:04,756 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-11-15 20:17:04,756 INFO L567 ElimStorePlain]: treesize reduction 147, result has 28.6 percent of original size [2019-11-15 20:17:04,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:04,757 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:153, output treesize:58 [2019-11-15 20:17:04,797 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:04,797 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 103 [2019-11-15 20:17:04,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:04,833 INFO L567 ElimStorePlain]: treesize reduction 96, result has 54.5 percent of original size [2019-11-15 20:17:04,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:04,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:04,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 43 [2019-11-15 20:17:04,839 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:04,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:04,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:04,851 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:154, output treesize:76 [2019-11-15 20:17:04,955 INFO L392 ElimStorePlain]: Different costs {3=[|#memory_$Pointer$.offset|], 9=[|#memory_$Pointer$.base|]} [2019-11-15 20:17:04,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:04,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:04,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:04,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 21 [2019-11-15 20:17:04,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:04,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:04,997 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:04,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 45 [2019-11-15 20:17:04,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:04,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:04,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:04,999 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:05,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:05,004 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 20:17:05,005 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:4 [2019-11-15 20:17:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:17:05,015 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:17:05,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2019-11-15 20:17:05,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393023722] [2019-11-15 20:17:05,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 20:17:05,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:17:05,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 20:17:05,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:17:05,017 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand 14 states. [2019-11-15 20:17:05,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:17:05,677 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2019-11-15 20:17:05,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:17:05,677 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-11-15 20:17:05,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:17:05,678 INFO L225 Difference]: With dead ends: 156 [2019-11-15 20:17:05,679 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 20:17:05,679 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-11-15 20:17:05,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 20:17:05,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 137. [2019-11-15 20:17:05,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-15 20:17:05,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2019-11-15 20:17:05,691 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 31 [2019-11-15 20:17:05,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:17:05,693 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2019-11-15 20:17:05,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 20:17:05,693 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2019-11-15 20:17:05,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 20:17:05,699 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:17:05,700 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:17:05,900 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:17:05,901 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:17:05,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:17:05,901 INFO L82 PathProgramCache]: Analyzing trace with hash 509365297, now seen corresponding path program 1 times [2019-11-15 20:17:05,901 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:17:05,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366921575] [2019-11-15 20:17:05,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:17:05,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:17:05,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:17:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:17:05,959 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-15 20:17:05,959 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366921575] [2019-11-15 20:17:05,959 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:17:05,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:17:05,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562259375] [2019-11-15 20:17:05,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:17:05,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:17:05,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:17:05,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:17:05,961 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand 3 states. [2019-11-15 20:17:06,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:17:06,002 INFO L93 Difference]: Finished difference Result 202 states and 224 transitions. [2019-11-15 20:17:06,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:17:06,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-15 20:17:06,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:17:06,003 INFO L225 Difference]: With dead ends: 202 [2019-11-15 20:17:06,004 INFO L226 Difference]: Without dead ends: 111 [2019-11-15 20:17:06,004 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:17:06,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-15 20:17:06,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2019-11-15 20:17:06,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-15 20:17:06,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2019-11-15 20:17:06,013 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 36 [2019-11-15 20:17:06,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:17:06,014 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2019-11-15 20:17:06,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:17:06,014 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2019-11-15 20:17:06,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 20:17:06,015 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:17:06,015 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:17:06,016 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:17:06,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:17:06,016 INFO L82 PathProgramCache]: Analyzing trace with hash 525270376, now seen corresponding path program 1 times [2019-11-15 20:17:06,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:17:06,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669536519] [2019-11-15 20:17:06,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:17:06,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:17:06,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:17:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:17:06,053 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:17:06,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669536519] [2019-11-15 20:17:06,054 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:17:06,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:17:06,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667157940] [2019-11-15 20:17:06,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:17:06,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:17:06,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:17:06,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:17:06,055 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 4 states. [2019-11-15 20:17:06,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:17:06,104 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2019-11-15 20:17:06,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:17:06,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-15 20:17:06,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:17:06,106 INFO L225 Difference]: With dead ends: 118 [2019-11-15 20:17:06,106 INFO L226 Difference]: Without dead ends: 107 [2019-11-15 20:17:06,106 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:17:06,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-15 20:17:06,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-11-15 20:17:06,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-15 20:17:06,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2019-11-15 20:17:06,115 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 37 [2019-11-15 20:17:06,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:17:06,115 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2019-11-15 20:17:06,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:17:06,116 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2019-11-15 20:17:06,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 20:17:06,116 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:17:06,116 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:17:06,117 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:17:06,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:17:06,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1226334954, now seen corresponding path program 1 times [2019-11-15 20:17:06,118 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:17:06,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972248576] [2019-11-15 20:17:06,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:17:06,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:17:06,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:17:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:17:06,330 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 20:17:06,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972248576] [2019-11-15 20:17:06,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272685111] [2019-11-15 20:17:06,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27cad639-495f-4e3f-bd9c-0c199be71841/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 20:17:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:17:06,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-15 20:17:06,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:17:06,407 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 20:17:06,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:06,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:06,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:06,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 20:17:06,434 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:06,434 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 20:17:06,435 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:06,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:06,460 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 27 treesize of output 15 [2019-11-15 20:17:06,460 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:06,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:06,478 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 27 treesize of output 15 [2019-11-15 20:17:06,478 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:06,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:06,491 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:06,491 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:36 [2019-11-15 20:17:06,540 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:06,541 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 98 [2019-11-15 20:17:06,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:06,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:06,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:06,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 20:17:06,588 INFO L567 ElimStorePlain]: treesize reduction 220, result has 23.1 percent of original size [2019-11-15 20:17:06,592 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 44 [2019-11-15 20:17:06,593 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:06,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:06,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:06,603 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:38 [2019-11-15 20:17:06,690 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:06,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 63 [2019-11-15 20:17:06,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:06,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:06,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:06,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:06,694 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:17:06,720 INFO L567 ElimStorePlain]: treesize reduction 28, result has 54.1 percent of original size [2019-11-15 20:17:06,727 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:06,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 20:17:06,728 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:06,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:06,738 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 20:17:06,738 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:7 [2019-11-15 20:17:06,747 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 20:17:06,747 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:17:06,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2019-11-15 20:17:06,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315457518] [2019-11-15 20:17:06,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 20:17:06,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:17:06,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 20:17:06,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:17:06,749 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 14 states. [2019-11-15 20:17:07,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:17:07,094 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2019-11-15 20:17:07,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:17:07,094 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-11-15 20:17:07,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:17:07,095 INFO L225 Difference]: With dead ends: 111 [2019-11-15 20:17:07,095 INFO L226 Difference]: Without dead ends: 80 [2019-11-15 20:17:07,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-11-15 20:17:07,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-15 20:17:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-15 20:17:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-15 20:17:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2019-11-15 20:17:07,101 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 37 [2019-11-15 20:17:07,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:17:07,102 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2019-11-15 20:17:07,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 20:17:07,102 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2019-11-15 20:17:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 20:17:07,103 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:17:07,103 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:17:07,306 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:17:07,306 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:17:07,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:17:07,306 INFO L82 PathProgramCache]: Analyzing trace with hash 778254669, now seen corresponding path program 1 times [2019-11-15 20:17:07,307 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:17:07,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558992945] [2019-11-15 20:17:07,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:17:07,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:17:07,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:17:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:17:07,471 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:17:07,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558992945] [2019-11-15 20:17:07,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703954856] [2019-11-15 20:17:07,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27cad639-495f-4e3f-bd9c-0c199be71841/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 20:17:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:17:07,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-15 20:17:07,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:17:07,543 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 20:17:07,544 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:07,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:07,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:07,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 20:17:07,568 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:07,569 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 39 [2019-11-15 20:17:07,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:07,593 INFO L567 ElimStorePlain]: treesize reduction 14, result has 76.7 percent of original size [2019-11-15 20:17:07,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 20:17:07,597 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:07,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:07,606 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 20:17:07,606 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2019-11-15 20:17:07,637 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-15 20:17:07,637 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 20:17:07,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:07,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:07,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:07,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2019-11-15 20:17:07,698 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:07,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-11-15 20:17:07,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:07,749 INFO L567 ElimStorePlain]: treesize reduction 40, result has 72.4 percent of original size [2019-11-15 20:17:07,782 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:07,783 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 88 treesize of output 105 [2019-11-15 20:17:07,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:07,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:07,785 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:07,896 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-11-15 20:17:07,896 INFO L567 ElimStorePlain]: treesize reduction 162, result has 30.2 percent of original size [2019-11-15 20:17:07,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:17:07,897 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:69 [2019-11-15 20:17:08,024 INFO L341 Elim1Store]: treesize reduction 62, result has 37.4 percent of original size [2019-11-15 20:17:08,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 70 [2019-11-15 20:17:08,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:08,062 INFO L567 ElimStorePlain]: treesize reduction 34, result has 66.0 percent of original size [2019-11-15 20:17:08,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:17:08,062 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:85, output treesize:66 [2019-11-15 20:17:08,111 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:08,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-11-15 20:17:08,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:08,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:08,265 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-15 20:17:08,265 INFO L341 Elim1Store]: treesize reduction 23, result has 85.6 percent of original size [2019-11-15 20:17:08,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 139 treesize of output 177 [2019-11-15 20:17:08,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,321 INFO L496 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 20:17:08,580 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 64 [2019-11-15 20:17:08,580 INFO L567 ElimStorePlain]: treesize reduction 353, result has 35.3 percent of original size [2019-11-15 20:17:08,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-15 20:17:08,582 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:151, output treesize:264 [2019-11-15 20:17:08,872 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2019-11-15 20:17:08,872 INFO L341 Elim1Store]: treesize reduction 62, result has 72.9 percent of original size [2019-11-15 20:17:08,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 179 treesize of output 222 [2019-11-15 20:17:08,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:08,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:08,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:09,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:09,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 15 xjuncts. [2019-11-15 20:17:09,174 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 31 [2019-11-15 20:17:09,174 INFO L567 ElimStorePlain]: treesize reduction 5390, result has 2.2 percent of original size [2019-11-15 20:17:09,175 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 20:17:09,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:179, output treesize:124 [2019-11-15 20:17:09,291 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:09,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 116 [2019-11-15 20:17:09,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:09,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:09,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:09,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:09,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:09,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:09,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:09,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:09,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:09,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:09,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:09,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:09,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:09,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:09,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:09,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:09,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:09,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:09,303 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 20:17:09,346 INFO L567 ElimStorePlain]: treesize reduction 72, result has 28.7 percent of original size [2019-11-15 20:17:09,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:09,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:131, output treesize:4 [2019-11-15 20:17:09,365 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:17:09,366 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:17:09,366 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-11-15 20:17:09,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479290708] [2019-11-15 20:17:09,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 20:17:09,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:17:09,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 20:17:09,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-11-15 20:17:09,367 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 16 states. [2019-11-15 20:17:09,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:17:09,990 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2019-11-15 20:17:09,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:17:09,991 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2019-11-15 20:17:09,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:17:09,992 INFO L225 Difference]: With dead ends: 149 [2019-11-15 20:17:09,992 INFO L226 Difference]: Without dead ends: 147 [2019-11-15 20:17:09,992 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-11-15 20:17:09,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-15 20:17:09,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 78. [2019-11-15 20:17:09,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-15 20:17:09,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2019-11-15 20:17:09,998 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 38 [2019-11-15 20:17:09,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:17:09,998 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2019-11-15 20:17:09,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 20:17:09,998 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2019-11-15 20:17:09,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 20:17:09,999 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:17:09,999 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:17:10,203 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:17:10,203 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:17:10,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:17:10,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1793269558, now seen corresponding path program 1 times [2019-11-15 20:17:10,204 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:17:10,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074077680] [2019-11-15 20:17:10,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:17:10,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:17:10,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:17:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:17:10,688 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:17:10,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074077680] [2019-11-15 20:17:10,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888430773] [2019-11-15 20:17:10,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27cad639-495f-4e3f-bd9c-0c199be71841/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 20:17:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:17:10,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-15 20:17:10,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:17:10,785 INFO L341 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-11-15 20:17:10,785 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 1 case distinctions, treesize of input 27 treesize of output 15 [2019-11-15 20:17:10,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:10,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:10,815 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:10,815 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 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-15 20:17:10,816 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:10,847 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.5 percent of original size [2019-11-15 20:17:10,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:10,847 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:39 [2019-11-15 20:17:10,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:10,891 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_19|], 6=[|v_#memory_$Pointer$.offset_32|, |v_#memory_$Pointer$.base_44|]} [2019-11-15 20:17:10,900 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 82 treesize of output 78 [2019-11-15 20:17:10,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:10,905 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 86 treesize of output 82 [2019-11-15 20:17:10,906 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:11,000 INFO L567 ElimStorePlain]: treesize reduction 7, result has 95.7 percent of original size [2019-11-15 20:17:11,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:11,017 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:11,017 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 82 treesize of output 77 [2019-11-15 20:17:11,017 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:11,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:11,023 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 71 treesize of output 55 [2019-11-15 20:17:11,023 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:11,096 INFO L567 ElimStorePlain]: treesize reduction 12, result has 90.6 percent of original size [2019-11-15 20:17:11,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:11,103 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 52 treesize of output 36 [2019-11-15 20:17:11,103 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:11,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:11,121 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:11,122 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 63 treesize of output 58 [2019-11-15 20:17:11,122 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:11,192 INFO L567 ElimStorePlain]: treesize reduction 8, result has 90.7 percent of original size [2019-11-15 20:17:11,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 20:17:11,192 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:169, output treesize:78 [2019-11-15 20:17:11,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:11,247 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_14, |v_#memory_int_20|], 2=[|v_#memory_int_18|, v_prenex_12], 3=[v_prenex_13, v_prenex_11], 9=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_33|]} [2019-11-15 20:17:11,298 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 112 treesize of output 100 [2019-11-15 20:17:11,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:11,711 WARN L191 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-15 20:17:11,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:11,735 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 175 treesize of output 151 [2019-11-15 20:17:11,735 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:12,003 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-15 20:17:12,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:12,046 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 148 treesize of output 136 [2019-11-15 20:17:12,046 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:12,276 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-15 20:17:12,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:12,297 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 97 treesize of output 85 [2019-11-15 20:17:12,298 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:12,448 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-15 20:17:12,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:12,473 INFO L341 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-11-15 20:17:12,473 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 65 [2019-11-15 20:17:12,474 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:12,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:12,584 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:12,585 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 61 [2019-11-15 20:17:12,585 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:12,696 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-15 20:17:12,696 INFO L567 ElimStorePlain]: treesize reduction 12, result has 93.8 percent of original size [2019-11-15 20:17:12,738 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:12,738 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 133 treesize of output 140 [2019-11-15 20:17:12,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:12,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:12,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:12,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:12,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:12,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:12,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:12,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:12,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:12,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:12,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:12,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:12,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:12,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:12,746 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:17:12,858 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-15 20:17:12,859 INFO L567 ElimStorePlain]: treesize reduction 50, result has 72.4 percent of original size [2019-11-15 20:17:12,912 INFO L341 Elim1Store]: treesize reduction 19, result has 74.0 percent of original size [2019-11-15 20:17:12,912 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 84 treesize of output 109 [2019-11-15 20:17:12,914 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:12,997 INFO L567 ElimStorePlain]: treesize reduction 31, result has 78.2 percent of original size [2019-11-15 20:17:12,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:12,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:12,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-15 20:17:12,998 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:288, output treesize:111 [2019-11-15 20:17:12,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:12,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:13,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:13,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:13,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:13,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:13,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:13,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:13,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:13,182 INFO L392 ElimStorePlain]: Different costs {1=[v_prenex_17, v_prenex_16, v_prenex_15], 12=[|v_#memory_int_21|], 20=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.offset_34|]} [2019-11-15 20:17:13,225 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:13,226 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 132 [2019-11-15 20:17:13,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:16,272 WARN L191 SmtUtils]: Spent 3.04 s on a formula simplification. DAG size of input: 130 DAG size of output: 127 [2019-11-15 20:17:16,272 INFO L567 ElimStorePlain]: treesize reduction 30, result has 94.8 percent of original size [2019-11-15 20:17:16,300 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:16,301 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 113 treesize of output 104 [2019-11-15 20:17:16,301 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:18,567 WARN L191 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 123 DAG size of output: 120 [2019-11-15 20:17:18,567 INFO L567 ElimStorePlain]: treesize reduction 24, result has 95.6 percent of original size [2019-11-15 20:17:18,593 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:18,593 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 75 [2019-11-15 20:17:18,594 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:20,160 WARN L191 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 116 DAG size of output: 113 [2019-11-15 20:17:20,160 INFO L567 ElimStorePlain]: treesize reduction 24, result has 95.3 percent of original size [2019-11-15 20:17:20,220 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:20,221 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 203 [2019-11-15 20:17:20,221 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:20,257 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 101 [2019-11-15 20:17:20,258 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:20,314 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:20,315 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 95 [2019-11-15 20:17:20,315 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:20,333 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2019-11-15 20:17:20,333 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:21,189 WARN L191 SmtUtils]: Spent 855.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2019-11-15 20:17:21,190 INFO L567 ElimStorePlain]: treesize reduction 136, result has 73.1 percent of original size [2019-11-15 20:17:21,210 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:21,210 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 79 [2019-11-15 20:17:21,211 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:21,224 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 55 treesize of output 43 [2019-11-15 20:17:21,224 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:21,253 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:21,253 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 156 treesize of output 119 [2019-11-15 20:17:21,254 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:21,457 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-11-15 20:17:21,457 INFO L567 ElimStorePlain]: treesize reduction 120, result has 70.6 percent of original size [2019-11-15 20:17:21,473 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:21,474 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 71 treesize of output 62 [2019-11-15 20:17:21,474 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:21,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:21,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:21,514 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:21,515 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 103 [2019-11-15 20:17:21,515 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:21,526 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 40 treesize of output 28 [2019-11-15 20:17:21,526 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:21,597 INFO L567 ElimStorePlain]: treesize reduction 59, result has 71.5 percent of original size [2019-11-15 20:17:21,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-15 20:17:21,597 INFO L221 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:559, output treesize:148 [2019-11-15 20:17:21,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:21,799 INFO L392 ElimStorePlain]: Different costs {1=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 3=[v_prenex_19, v_prenex_20]} [2019-11-15 20:17:21,819 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:21,820 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 63 treesize of output 50 [2019-11-15 20:17:21,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:21,890 INFO L567 ElimStorePlain]: treesize reduction 4, result has 97.1 percent of original size [2019-11-15 20:17:21,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2019-11-15 20:17:21,894 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:21,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:21,936 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:21,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 83 [2019-11-15 20:17:21,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:21,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:21,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:21,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:21,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:21,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:21,940 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 20:17:21,988 INFO L567 ElimStorePlain]: treesize reduction 16, result has 82.4 percent of original size [2019-11-15 20:17:21,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:21,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 39 [2019-11-15 20:17:21,993 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:22,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:22,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-15 20:17:22,011 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:161, output treesize:38 [2019-11-15 20:17:22,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:22,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:22,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:22,095 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:17:22,095 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:17:22,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-11-15 20:17:22,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200248571] [2019-11-15 20:17:22,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-15 20:17:22,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:17:22,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 20:17:22,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-11-15 20:17:22,097 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 20 states. [2019-11-15 20:17:23,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:17:23,360 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2019-11-15 20:17:23,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 20:17:23,360 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-11-15 20:17:23,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:17:23,361 INFO L225 Difference]: With dead ends: 101 [2019-11-15 20:17:23,361 INFO L226 Difference]: Without dead ends: 99 [2019-11-15 20:17:23,362 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2019-11-15 20:17:23,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-15 20:17:23,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 84. [2019-11-15 20:17:23,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-15 20:17:23,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2019-11-15 20:17:23,368 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 40 [2019-11-15 20:17:23,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:17:23,369 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2019-11-15 20:17:23,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-15 20:17:23,369 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2019-11-15 20:17:23,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 20:17:23,369 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:17:23,370 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:17:23,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:17:23,573 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:17:23,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:17:23,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1428751921, now seen corresponding path program 1 times [2019-11-15 20:17:23,576 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:17:23,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266486963] [2019-11-15 20:17:23,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:17:23,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:17:23,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:17:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:17:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-15 20:17:23,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266486963] [2019-11-15 20:17:23,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:17:23,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:17:23,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581166306] [2019-11-15 20:17:23,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:17:23,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:17:23,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:17:23,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:17:23,605 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 3 states. [2019-11-15 20:17:23,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:17:23,634 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2019-11-15 20:17:23,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:17:23,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-15 20:17:23,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:17:23,635 INFO L225 Difference]: With dead ends: 110 [2019-11-15 20:17:23,635 INFO L226 Difference]: Without dead ends: 98 [2019-11-15 20:17:23,635 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:17:23,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-15 20:17:23,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2019-11-15 20:17:23,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-15 20:17:23,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2019-11-15 20:17:23,641 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 41 [2019-11-15 20:17:23,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:17:23,642 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2019-11-15 20:17:23,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:17:23,642 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2019-11-15 20:17:23,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 20:17:23,642 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:17:23,642 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:17:23,646 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:17:23,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:17:23,646 INFO L82 PathProgramCache]: Analyzing trace with hash 755507507, now seen corresponding path program 1 times [2019-11-15 20:17:23,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:17:23,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869670497] [2019-11-15 20:17:23,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:17:23,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:17:23,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:17:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:17:23,867 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:17:23,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869670497] [2019-11-15 20:17:23,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701736938] [2019-11-15 20:17:23,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27cad639-495f-4e3f-bd9c-0c199be71841/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 20:17:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:17:23,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 63 conjunts are in the unsatisfiable core [2019-11-15 20:17:23,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:17:23,957 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 20:17:23,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:23,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:23,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:23,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-15 20:17:24,018 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:24,018 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 20:17:24,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:24,062 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.3 percent of original size [2019-11-15 20:17:24,067 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 27 treesize of output 15 [2019-11-15 20:17:24,067 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:24,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:24,085 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 27 treesize of output 15 [2019-11-15 20:17:24,085 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:24,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:24,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:24,099 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:49 [2019-11-15 20:17:24,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:24,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 20:17:24,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:24,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:24,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:24,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 20:17:24,152 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:24,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:24,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:24,166 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:49 [2019-11-15 20:17:24,203 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:24,203 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-11-15 20:17:24,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:24,289 INFO L567 ElimStorePlain]: treesize reduction 40, result has 80.5 percent of original size [2019-11-15 20:17:24,305 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 32 [2019-11-15 20:17:24,306 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:24,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:24,359 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:24,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 88 [2019-11-15 20:17:24,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,360 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:24,432 INFO L567 ElimStorePlain]: treesize reduction 76, result has 50.3 percent of original size [2019-11-15 20:17:24,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:24,433 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:159, output treesize:77 [2019-11-15 20:17:24,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:24,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:24,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:24,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-11-15 20:17:24,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:24,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:24,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:24,520 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:24,520 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 59 [2019-11-15 20:17:24,521 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:24,562 INFO L567 ElimStorePlain]: treesize reduction 44, result has 63.6 percent of original size [2019-11-15 20:17:24,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:24,562 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:115, output treesize:77 [2019-11-15 20:17:24,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:24,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:24,621 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:24,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-11-15 20:17:24,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:24,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:24,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:24,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:24,708 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 50 [2019-11-15 20:17:24,708 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:24,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:24,883 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-11-15 20:17:24,883 INFO L341 Elim1Store]: treesize reduction 15, result has 86.6 percent of original size [2019-11-15 20:17:24,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 145 treesize of output 143 [2019-11-15 20:17:24,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:24,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:24,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:24,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:24,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:24,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:24,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:24,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:24,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:24,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:24,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:24,920 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 20:17:25,125 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 37 [2019-11-15 20:17:25,125 INFO L567 ElimStorePlain]: treesize reduction 455, result has 15.9 percent of original size [2019-11-15 20:17:25,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:25,126 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:229, output treesize:85 [2019-11-15 20:17:25,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:25,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:25,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:25,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:25,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:25,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 65 [2019-11-15 20:17:25,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:25,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:25,258 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:25,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 129 [2019-11-15 20:17:25,260 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:25,317 INFO L567 ElimStorePlain]: treesize reduction 240, result has 30.0 percent of original size [2019-11-15 20:17:25,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:25,318 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:205, output treesize:103 [2019-11-15 20:17:25,513 INFO L392 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.offset|], 14=[|#memory_$Pointer$.base|]} [2019-11-15 20:17:25,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:25,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:25,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:25,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:25,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:25,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:25,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 24 [2019-11-15 20:17:25,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:25,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:25,556 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:25,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 72 [2019-11-15 20:17:25,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:25,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:25,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:25,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:25,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:25,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:25,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:25,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:25,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:25,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:25,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:25,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:25,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:25,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:25,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:25,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:25,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:25,563 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:25,582 INFO L567 ElimStorePlain]: treesize reduction 22, result has 29.0 percent of original size [2019-11-15 20:17:25,583 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 20:17:25,583 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:4 [2019-11-15 20:17:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:17:25,606 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:17:25,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-11-15 20:17:25,606 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738593758] [2019-11-15 20:17:25,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 20:17:25,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:17:25,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 20:17:25,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-11-15 20:17:25,607 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 18 states. [2019-11-15 20:17:26,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:17:26,431 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2019-11-15 20:17:26,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 20:17:26,432 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2019-11-15 20:17:26,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:17:26,433 INFO L225 Difference]: With dead ends: 131 [2019-11-15 20:17:26,433 INFO L226 Difference]: Without dead ends: 129 [2019-11-15 20:17:26,433 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2019-11-15 20:17:26,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-15 20:17:26,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 82. [2019-11-15 20:17:26,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-15 20:17:26,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2019-11-15 20:17:26,440 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 41 [2019-11-15 20:17:26,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:17:26,440 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2019-11-15 20:17:26,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 20:17:26,440 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2019-11-15 20:17:26,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 20:17:26,441 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:17:26,441 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:17:26,645 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:17:26,646 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:17:26,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:17:26,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1699655007, now seen corresponding path program 1 times [2019-11-15 20:17:26,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:17:26,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010597118] [2019-11-15 20:17:26,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:17:26,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:17:26,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:17:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:17:26,891 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:17:26,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010597118] [2019-11-15 20:17:26,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474804923] [2019-11-15 20:17:26,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_27cad639-495f-4e3f-bd9c-0c199be71841/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:17:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:17:26,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 76 conjunts are in the unsatisfiable core [2019-11-15 20:17:26,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:17:26,985 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 20:17:26,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:27,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:27,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:27,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-15 20:17:27,063 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:27,064 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 20:17:27,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:27,121 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.3 percent of original size [2019-11-15 20:17:27,126 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 27 treesize of output 15 [2019-11-15 20:17:27,127 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:27,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:27,146 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 27 treesize of output 15 [2019-11-15 20:17:27,146 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:27,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:27,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:27,178 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:49 [2019-11-15 20:17:27,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:27,213 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 20:17:27,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:27,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:27,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:27,248 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 20:17:27,248 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:27,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:27,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:27,267 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:49 [2019-11-15 20:17:27,312 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:27,312 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-11-15 20:17:27,313 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:27,418 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-11-15 20:17:27,419 INFO L567 ElimStorePlain]: treesize reduction 40, result has 80.1 percent of original size [2019-11-15 20:17:27,423 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 62 treesize of output 32 [2019-11-15 20:17:27,423 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:27,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:27,474 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:27,474 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 88 [2019-11-15 20:17:27,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:27,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:27,476 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:27,523 INFO L567 ElimStorePlain]: treesize reduction 60, result has 57.4 percent of original size [2019-11-15 20:17:27,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:27,523 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:155, output treesize:81 [2019-11-15 20:17:27,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:27,573 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:27,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 63 [2019-11-15 20:17:27,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:27,625 INFO L567 ElimStorePlain]: treesize reduction 32, result has 75.8 percent of original size [2019-11-15 20:17:27,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:27,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:27,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-11-15 20:17:27,631 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:27,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:27,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:27,651 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:119, output treesize:81 [2019-11-15 20:17:27,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:27,684 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:27,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-11-15 20:17:27,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:27,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:27,807 INFO L341 Elim1Store]: treesize reduction 15, result has 86.6 percent of original size [2019-11-15 20:17:27,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 208 treesize of output 170 [2019-11-15 20:17:27,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:27,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:17:27,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:27,809 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:27,879 INFO L567 ElimStorePlain]: treesize reduction 176, result has 43.8 percent of original size [2019-11-15 20:17:27,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:27,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:27,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:27,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:27,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 50 [2019-11-15 20:17:27,886 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:27,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:27,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:27,905 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:237, output treesize:85 [2019-11-15 20:17:27,977 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:27,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 219 treesize of output 148 [2019-11-15 20:17:27,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:28,034 INFO L567 ElimStorePlain]: treesize reduction 240, result has 42.6 percent of original size [2019-11-15 20:17:28,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:28,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:28,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:28,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:28,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 65 [2019-11-15 20:17:28,042 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:28,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:28,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:17:28,059 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:229, output treesize:127 [2019-11-15 20:17:28,329 INFO L392 ElimStorePlain]: Different costs {14=[|#memory_$Pointer$.offset|], 24=[|#memory_$Pointer$.base|]} [2019-11-15 20:17:28,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:28,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:28,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:28,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:17:28,400 INFO L341 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2019-11-15 20:17:28,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 100 treesize of output 91 [2019-11-15 20:17:28,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:28,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:28,455 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:28,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 76 [2019-11-15 20:17:28,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:28,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:28,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:28,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:28,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:28,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:28,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:28,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:28,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:17:28,459 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:17:28,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:17:28,464 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 20:17:28,464 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:143, output treesize:4 [2019-11-15 20:17:28,488 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:17:28,488 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:17:28,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2019-11-15 20:17:28,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058958823] [2019-11-15 20:17:28,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-15 20:17:28,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:17:28,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 20:17:28,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-11-15 20:17:28,489 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 20 states. [2019-11-15 20:17:29,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:17:29,342 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2019-11-15 20:17:29,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 20:17:29,342 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2019-11-15 20:17:29,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:17:29,343 INFO L225 Difference]: With dead ends: 129 [2019-11-15 20:17:29,343 INFO L226 Difference]: Without dead ends: 127 [2019-11-15 20:17:29,343 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2019-11-15 20:17:29,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-15 20:17:29,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 106. [2019-11-15 20:17:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-15 20:17:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2019-11-15 20:17:29,350 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 44 [2019-11-15 20:17:29,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:17:29,350 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2019-11-15 20:17:29,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-15 20:17:29,351 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2019-11-15 20:17:29,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 20:17:29,351 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:17:29,351 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:17:29,555 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:17:29,555 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:17:29,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:17:29,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1057023877, now seen corresponding path program 1 times [2019-11-15 20:17:29,556 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:17:29,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464330930] [2019-11-15 20:17:29,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:17:29,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:17:29,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:17:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:17:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:17:29,666 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:17:29,667 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:17:29,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:17:29 BoogieIcfgContainer [2019-11-15 20:17:29,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:17:29,737 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:17:29,737 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:17:29,738 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:17:29,738 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:16:52" (3/4) ... [2019-11-15 20:17:29,740 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 20:17:29,810 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_27cad639-495f-4e3f-bd9c-0c199be71841/bin/uautomizer/witness.graphml [2019-11-15 20:17:29,810 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:17:29,811 INFO L168 Benchmark]: Toolchain (without parser) took 38366.73 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 432.5 MB). Free memory was 943.5 MB in the beginning and 981.7 MB in the end (delta: -38.2 MB). Peak memory consumption was 394.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:17:29,811 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:17:29,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 556.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -198.2 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:17:29,812 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.16 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 20:17:29,812 INFO L168 Benchmark]: Boogie Preprocessor took 41.00 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 20:17:29,813 INFO L168 Benchmark]: RCFGBuilder took 612.87 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: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:17:29,813 INFO L168 Benchmark]: TraceAbstraction took 37007.27 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 267.9 MB). Free memory was 1.1 GB in the beginning and 985.5 MB in the end (delta: 115.9 MB). Peak memory consumption was 383.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:17:29,818 INFO L168 Benchmark]: Witness Printer took 72.78 ms. Allocated memory is still 1.5 GB. Free memory was 985.5 MB in the beginning and 981.7 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:17:29,821 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 556.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -198.2 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.16 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 41.00 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 612.87 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: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37007.27 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 267.9 MB). Free memory was 1.1 GB in the beginning and 985.5 MB in the end (delta: 115.9 MB). Peak memory consumption was 383.8 MB. Max. memory is 11.5 GB. * Witness Printer took 72.78 ms. Allocated memory is still 1.5 GB. Free memory was 985.5 MB in the beginning and 981.7 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1035]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L985] SLL* head = malloc(sizeof(SLL)); [L986] head->next = ((void*)0) [L987] head->data = 0 [L988] SLL* item = head; [L989] int status = 0; [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) [L997] COND TRUE !status [L999] item->data = 1 [L1000] status = 1 [L1013] COND FALSE !(!(head != ((void*)0))) [L1014] COND FALSE !(!(item != ((void*)0))) [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) [L997] COND FALSE !(!status) [L1002] COND TRUE status == 1 [L1004] item->data = 2 [L1005] status = 2 [L1013] COND FALSE !(!(head != ((void*)0))) [L1014] COND FALSE !(!(item != ((void*)0))) [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) [L997] COND FALSE !(!status) [L1002] COND FALSE !(status == 1) [L1007] COND TRUE status >= 2 [L1009] item->data = 3 [L1010] status = 3 [L1013] COND FALSE !(!(head != ((void*)0))) [L1014] COND FALSE !(!(item != ((void*)0))) [L991] COND FALSE !(__VERIFIER_nondet_int()) [L1017] COND FALSE !(!(head != ((void*)0))) [L1018] COND FALSE !(status == 1) [L1023] COND FALSE !(status == 2) [L1029] COND TRUE status == 3 [L1031] COND FALSE !(!(head != ((void*)0))) [L1032] EXPR head->next [L1032] COND FALSE !(!(head->next != ((void*)0))) [L1033] EXPR head->next [L1033] EXPR head->next->next [L1033] COND FALSE !(!(head->next->next != ((void*)0))) [L1034] EXPR head->next [L1034] EXPR head->next->next [L1034] EXPR head->next->next->next [L1034] COND FALSE !(!(head->next->next->next != ((void*)0))) [L1035] EXPR head->next [L1035] EXPR head->next->next [L1035] EXPR head->next->next->next [L1035] EXPR head->next->next->next->data [L1035] COND TRUE !(head->next->next->next->data != 3) [L1035] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 14 error locations. Result: UNSAFE, OverallTime: 36.9s, OverallIterations: 21, TraceHistogramMax: 4, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1365 SDtfs, 1724 SDslu, 4712 SDs, 0 SdLazy, 2841 SolverSat, 217 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 481 GetRequests, 269 SyntacticMatches, 28 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred 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, 20 MinimizatonAttempts, 319 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 26.7s InterpolantComputationTime, 900 NumberOfCodeBlocks, 900 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 824 ConstructedInterpolants, 74 QuantifiedInterpolants, 985380 SizeOfPredicates, 118 NumberOfNonLiveVariables, 1108 ConjunctsInSsa, 376 ConjunctsInUnsatCore, 29 InterpolantComputations, 11 PerfectInterpolantSequences, 88/337 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...