./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.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_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i -s /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/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 7c39ea866ecd4619e97b65a7639eefeeaf4c0097 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i -s /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/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 7c39ea866ecd4619e97b65a7639eefeeaf4c0097 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:14:06,985 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:14:06,987 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:14:07,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:14:07,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:14:07,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:14:07,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:14:07,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:14:07,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:14:07,022 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:14:07,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:14:07,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:14:07,025 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:14:07,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:14:07,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:14:07,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:14:07,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:14:07,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:14:07,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:14:07,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:14:07,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:14:07,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:14:07,042 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:14:07,043 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:14:07,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:14:07,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:14:07,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:14:07,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:14:07,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:14:07,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:14:07,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:14:07,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:14:07,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:14:07,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:14:07,052 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:14:07,052 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:14:07,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:14:07,053 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:14:07,053 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:14:07,054 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:14:07,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:14:07,055 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:14:07,080 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:14:07,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:14:07,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:14:07,082 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:14:07,082 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:14:07,082 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:14:07,082 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:14:07,082 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:14:07,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:14:07,083 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:14:07,083 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:14:07,083 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:14:07,083 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:14:07,084 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:14:07,084 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:14:07,084 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:14:07,084 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:14:07,085 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:14:07,085 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:14:07,085 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:14:07,085 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:14:07,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:14:07,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:14:07,086 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:14:07,086 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:14:07,086 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:14:07,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:14:07,087 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:14:07,087 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_15442461-56c7-4246-bc5e-d695aa403c6b/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 -> 7c39ea866ecd4619e97b65a7639eefeeaf4c0097 [2019-11-15 22:14:07,115 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:14:07,126 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:14:07,131 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:14:07,132 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:14:07,132 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:14:07,134 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2019-11-15 22:14:07,193 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/data/e2fd23325/bc8d993733ee4cc8a17b6f1edd7423ce/FLAGe7df92429 [2019-11-15 22:14:07,624 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:14:07,625 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2019-11-15 22:14:07,640 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/data/e2fd23325/bc8d993733ee4cc8a17b6f1edd7423ce/FLAGe7df92429 [2019-11-15 22:14:07,998 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/data/e2fd23325/bc8d993733ee4cc8a17b6f1edd7423ce [2019-11-15 22:14:08,000 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:14:08,001 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:14:08,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:14:08,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:14:08,009 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:14:08,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:14:07" (1/1) ... [2019-11-15 22:14:08,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e1c72df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:08, skipping insertion in model container [2019-11-15 22:14:08,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:14:07" (1/1) ... [2019-11-15 22:14:08,024 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:14:08,084 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:14:08,542 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:14:08,555 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:14:08,615 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:14:08,699 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:14:08,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:08 WrapperNode [2019-11-15 22:14:08,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:14:08,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:14:08,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:14:08,701 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:14:08,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:08" (1/1) ... [2019-11-15 22:14:08,730 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:08" (1/1) ... [2019-11-15 22:14:08,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:14:08,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:14:08,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:14:08,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:14:08,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:08" (1/1) ... [2019-11-15 22:14:08,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:08" (1/1) ... [2019-11-15 22:14:08,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:08" (1/1) ... [2019-11-15 22:14:08,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:08" (1/1) ... [2019-11-15 22:14:08,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:08" (1/1) ... [2019-11-15 22:14:08,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:08" (1/1) ... [2019-11-15 22:14:08,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:08" (1/1) ... [2019-11-15 22:14:08,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:14:08,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:14:08,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:14:08,822 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:14:08,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/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 22:14:08,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:14:08,918 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2019-11-15 22:14:08,919 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2019-11-15 22:14:08,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:14:08,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:14:08,921 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2019-11-15 22:14:08,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2019-11-15 22:14:08,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:14:08,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:14:08,921 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2019-11-15 22:14:08,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2019-11-15 22:14:08,924 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2019-11-15 22:14:08,924 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2019-11-15 22:14:08,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:14:08,924 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2019-11-15 22:14:08,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2019-11-15 22:14:08,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:14:08,925 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2019-11-15 22:14:08,925 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2019-11-15 22:14:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-15 22:14:08,926 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2019-11-15 22:14:08,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2019-11-15 22:14:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-15 22:14:08,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:14:08,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:14:09,791 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:14:09,792 INFO L284 CfgBuilder]: Removed 38 assume(true) statements. [2019-11-15 22:14:09,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:14:09 BoogieIcfgContainer [2019-11-15 22:14:09,793 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:14:09,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:14:09,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:14:09,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:14:09,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:14:07" (1/3) ... [2019-11-15 22:14:09,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dde638d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:14:09, skipping insertion in model container [2019-11-15 22:14:09,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:14:08" (2/3) ... [2019-11-15 22:14:09,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dde638d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:14:09, skipping insertion in model container [2019-11-15 22:14:09,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:14:09" (3/3) ... [2019-11-15 22:14:09,801 INFO L109 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2019-11-15 22:14:09,809 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:14:09,817 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:14:09,826 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:14:09,849 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:14:09,849 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:14:09,849 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:14:09,849 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:14:09,849 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:14:09,850 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:14:09,850 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:14:09,850 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:14:09,874 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-11-15 22:14:09,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 22:14:09,882 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:09,882 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:09,884 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:09,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:09,890 INFO L82 PathProgramCache]: Analyzing trace with hash 191678913, now seen corresponding path program 1 times [2019-11-15 22:14:09,897 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:09,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858504943] [2019-11-15 22:14:09,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:09,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:09,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:10,337 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 22:14:10,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858504943] [2019-11-15 22:14:10,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:10,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:14:10,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926698949] [2019-11-15 22:14:10,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:14:10,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:10,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:14:10,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:14:10,355 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 8 states. [2019-11-15 22:14:11,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:11,320 INFO L93 Difference]: Finished difference Result 269 states and 399 transitions. [2019-11-15 22:14:11,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:14:11,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-15 22:14:11,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:11,334 INFO L225 Difference]: With dead ends: 269 [2019-11-15 22:14:11,335 INFO L226 Difference]: Without dead ends: 125 [2019-11-15 22:14:11,342 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:14:11,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-15 22:14:11,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-11-15 22:14:11,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-15 22:14:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 172 transitions. [2019-11-15 22:14:11,395 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 172 transitions. Word has length 15 [2019-11-15 22:14:11,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:11,395 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 172 transitions. [2019-11-15 22:14:11,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:14:11,396 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 172 transitions. [2019-11-15 22:14:11,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 22:14:11,399 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:11,400 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:11,400 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:11,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:11,401 INFO L82 PathProgramCache]: Analyzing trace with hash -835354618, now seen corresponding path program 1 times [2019-11-15 22:14:11,401 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:11,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997070588] [2019-11-15 22:14:11,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:11,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:11,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:11,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:14:11,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997070588] [2019-11-15 22:14:11,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:11,704 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:14:11,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900281006] [2019-11-15 22:14:11,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:14:11,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:11,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:14:11,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:14:11,707 INFO L87 Difference]: Start difference. First operand 124 states and 172 transitions. Second operand 8 states. [2019-11-15 22:14:12,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:12,601 INFO L93 Difference]: Finished difference Result 276 states and 411 transitions. [2019-11-15 22:14:12,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:14:12,601 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-11-15 22:14:12,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:12,605 INFO L225 Difference]: With dead ends: 276 [2019-11-15 22:14:12,605 INFO L226 Difference]: Without dead ends: 166 [2019-11-15 22:14:12,607 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:14:12,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-15 22:14:12,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2019-11-15 22:14:12,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-15 22:14:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 214 transitions. [2019-11-15 22:14:12,627 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 214 transitions. Word has length 27 [2019-11-15 22:14:12,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:12,627 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 214 transitions. [2019-11-15 22:14:12,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:14:12,628 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 214 transitions. [2019-11-15 22:14:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 22:14:12,630 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:12,630 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:12,631 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:12,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:12,631 INFO L82 PathProgramCache]: Analyzing trace with hash -577189180, now seen corresponding path program 1 times [2019-11-15 22:14:12,631 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:12,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455462241] [2019-11-15 22:14:12,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:12,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:12,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:14:12,735 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455462241] [2019-11-15 22:14:12,735 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:12,735 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:14:12,735 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720063062] [2019-11-15 22:14:12,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:14:12,736 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:12,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:14:12,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:14:12,736 INFO L87 Difference]: Start difference. First operand 154 states and 214 transitions. Second operand 3 states. [2019-11-15 22:14:12,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:12,751 INFO L93 Difference]: Finished difference Result 296 states and 433 transitions. [2019-11-15 22:14:12,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:14:12,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 22:14:12,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:12,754 INFO L225 Difference]: With dead ends: 296 [2019-11-15 22:14:12,754 INFO L226 Difference]: Without dead ends: 156 [2019-11-15 22:14:12,755 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 2 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 22:14:12,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-15 22:14:12,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2019-11-15 22:14:12,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-15 22:14:12,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 213 transitions. [2019-11-15 22:14:12,770 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 213 transitions. Word has length 27 [2019-11-15 22:14:12,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:12,770 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 213 transitions. [2019-11-15 22:14:12,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:14:12,771 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 213 transitions. [2019-11-15 22:14:12,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 22:14:12,773 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:12,773 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:12,774 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:12,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:12,774 INFO L82 PathProgramCache]: Analyzing trace with hash 571761420, now seen corresponding path program 1 times [2019-11-15 22:14:12,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:12,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164374771] [2019-11-15 22:14:12,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:12,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:12,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:13,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:14:13,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164374771] [2019-11-15 22:14:13,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823676034] [2019-11-15 22:14:13,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/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 22:14:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:13,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 22:14:13,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:13,417 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:14:13,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:14:13,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:14:13,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:14:13,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-15 22:14:13,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:14:13,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:14:13,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:14:13,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:14:13,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 22:14:13,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:20 [2019-11-15 22:14:13,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:14:13,538 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 22:14:13,538 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:14:13,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:14:13,549 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:14:13,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:27, output treesize:3 [2019-11-15 22:14:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:14:13,610 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:14:13,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2019-11-15 22:14:13,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880313478] [2019-11-15 22:14:13,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-15 22:14:13,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:13,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 22:14:13,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-11-15 22:14:13,612 INFO L87 Difference]: Start difference. First operand 154 states and 213 transitions. Second operand 20 states. [2019-11-15 22:14:18,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:18,749 INFO L93 Difference]: Finished difference Result 676 states and 1112 transitions. [2019-11-15 22:14:18,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-11-15 22:14:18,750 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 28 [2019-11-15 22:14:18,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:18,765 INFO L225 Difference]: With dead ends: 676 [2019-11-15 22:14:18,765 INFO L226 Difference]: Without dead ends: 536 [2019-11-15 22:14:18,768 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=597, Invalid=3309, Unknown=0, NotChecked=0, Total=3906 [2019-11-15 22:14:18,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-11-15 22:14:18,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 374. [2019-11-15 22:14:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-11-15 22:14:18,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 567 transitions. [2019-11-15 22:14:18,848 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 567 transitions. Word has length 28 [2019-11-15 22:14:18,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:18,848 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 567 transitions. [2019-11-15 22:14:18,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-15 22:14:18,849 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 567 transitions. [2019-11-15 22:14:18,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 22:14:18,852 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:18,852 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:19,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:14:19,057 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:19,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:19,058 INFO L82 PathProgramCache]: Analyzing trace with hash -2025119411, now seen corresponding path program 1 times [2019-11-15 22:14:19,058 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:19,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793376313] [2019-11-15 22:14:19,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:19,058 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:19,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:14:19,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793376313] [2019-11-15 22:14:19,329 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:19,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:14:19,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592902790] [2019-11-15 22:14:19,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:14:19,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:19,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:14:19,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:14:19,330 INFO L87 Difference]: Start difference. First operand 374 states and 567 transitions. Second operand 8 states. [2019-11-15 22:14:20,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:20,080 INFO L93 Difference]: Finished difference Result 785 states and 1344 transitions. [2019-11-15 22:14:20,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:14:20,083 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-15 22:14:20,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:20,092 INFO L225 Difference]: With dead ends: 785 [2019-11-15 22:14:20,092 INFO L226 Difference]: Without dead ends: 425 [2019-11-15 22:14:20,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:14:20,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-11-15 22:14:20,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 411. [2019-11-15 22:14:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-11-15 22:14:20,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 617 transitions. [2019-11-15 22:14:20,136 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 617 transitions. Word has length 29 [2019-11-15 22:14:20,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:20,145 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 617 transitions. [2019-11-15 22:14:20,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:14:20,145 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 617 transitions. [2019-11-15 22:14:20,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:14:20,148 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:20,148 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:20,148 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:20,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:20,149 INFO L82 PathProgramCache]: Analyzing trace with hash -887190847, now seen corresponding path program 1 times [2019-11-15 22:14:20,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:20,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673382858] [2019-11-15 22:14:20,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:20,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:20,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:20,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:14:20,236 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673382858] [2019-11-15 22:14:20,237 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:20,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:14:20,237 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289124303] [2019-11-15 22:14:20,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:14:20,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:20,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:14:20,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:14:20,238 INFO L87 Difference]: Start difference. First operand 411 states and 617 transitions. Second operand 7 states. [2019-11-15 22:14:21,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:21,086 INFO L93 Difference]: Finished difference Result 818 states and 1373 transitions. [2019-11-15 22:14:21,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:14:21,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-11-15 22:14:21,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:21,091 INFO L225 Difference]: With dead ends: 818 [2019-11-15 22:14:21,091 INFO L226 Difference]: Without dead ends: 421 [2019-11-15 22:14:21,095 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:14:21,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-11-15 22:14:21,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 419. [2019-11-15 22:14:21,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-11-15 22:14:21,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 625 transitions. [2019-11-15 22:14:21,128 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 625 transitions. Word has length 30 [2019-11-15 22:14:21,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:21,130 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 625 transitions. [2019-11-15 22:14:21,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:14:21,130 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 625 transitions. [2019-11-15 22:14:21,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 22:14:21,134 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:21,134 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:21,134 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:21,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:21,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1592982185, now seen corresponding path program 1 times [2019-11-15 22:14:21,135 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:21,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311837478] [2019-11-15 22:14:21,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:21,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:21,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:21,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 22:14:21,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311837478] [2019-11-15 22:14:21,251 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:21,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:14:21,251 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581300937] [2019-11-15 22:14:21,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:14:21,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:21,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:14:21,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:14:21,252 INFO L87 Difference]: Start difference. First operand 419 states and 625 transitions. Second operand 8 states. [2019-11-15 22:14:22,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:22,367 INFO L93 Difference]: Finished difference Result 828 states and 1389 transitions. [2019-11-15 22:14:22,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:14:22,368 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-11-15 22:14:22,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:22,372 INFO L225 Difference]: With dead ends: 828 [2019-11-15 22:14:22,372 INFO L226 Difference]: Without dead ends: 416 [2019-11-15 22:14:22,376 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:14:22,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-11-15 22:14:22,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 414. [2019-11-15 22:14:22,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-15 22:14:22,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 611 transitions. [2019-11-15 22:14:22,409 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 611 transitions. Word has length 31 [2019-11-15 22:14:22,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:22,410 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 611 transitions. [2019-11-15 22:14:22,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:14:22,410 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 611 transitions. [2019-11-15 22:14:22,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 22:14:22,414 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:22,414 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:22,414 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:22,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:22,415 INFO L82 PathProgramCache]: Analyzing trace with hash 430597727, now seen corresponding path program 1 times [2019-11-15 22:14:22,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:22,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461059367] [2019-11-15 22:14:22,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:22,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:22,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:22,585 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:14:22,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461059367] [2019-11-15 22:14:22,586 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:22,586 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:14:22,586 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293332999] [2019-11-15 22:14:22,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:14:22,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:22,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:14:22,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:14:22,587 INFO L87 Difference]: Start difference. First operand 414 states and 611 transitions. Second operand 7 states. [2019-11-15 22:14:23,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:23,429 INFO L93 Difference]: Finished difference Result 832 states and 1382 transitions. [2019-11-15 22:14:23,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:14:23,429 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-11-15 22:14:23,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:23,434 INFO L225 Difference]: With dead ends: 832 [2019-11-15 22:14:23,434 INFO L226 Difference]: Without dead ends: 433 [2019-11-15 22:14:23,438 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:14:23,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-11-15 22:14:23,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 420. [2019-11-15 22:14:23,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-11-15 22:14:23,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 617 transitions. [2019-11-15 22:14:23,463 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 617 transitions. Word has length 41 [2019-11-15 22:14:23,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:23,464 INFO L462 AbstractCegarLoop]: Abstraction has 420 states and 617 transitions. [2019-11-15 22:14:23,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:14:23,464 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 617 transitions. [2019-11-15 22:14:23,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 22:14:23,466 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:23,466 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-15 22:14:23,466 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:23,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:23,467 INFO L82 PathProgramCache]: Analyzing trace with hash 591802485, now seen corresponding path program 1 times [2019-11-15 22:14:23,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:23,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43517939] [2019-11-15 22:14:23,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:23,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:23,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:23,589 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:14:23,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43517939] [2019-11-15 22:14:23,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958869589] [2019-11-15 22:14:23,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/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 22:14:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:23,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:14:23,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:14:23,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:14:23,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-11-15 22:14:23,751 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965424198] [2019-11-15 22:14:23,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:14:23,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:23,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:14:23,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:14:23,752 INFO L87 Difference]: Start difference. First operand 420 states and 617 transitions. Second operand 3 states. [2019-11-15 22:14:23,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:23,775 INFO L93 Difference]: Finished difference Result 843 states and 1371 transitions. [2019-11-15 22:14:23,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:14:23,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-15 22:14:23,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:23,780 INFO L225 Difference]: With dead ends: 843 [2019-11-15 22:14:23,780 INFO L226 Difference]: Without dead ends: 438 [2019-11-15 22:14:23,784 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:14:23,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-11-15 22:14:23,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 420. [2019-11-15 22:14:23,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-11-15 22:14:23,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 613 transitions. [2019-11-15 22:14:23,809 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 613 transitions. Word has length 41 [2019-11-15 22:14:23,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:23,809 INFO L462 AbstractCegarLoop]: Abstraction has 420 states and 613 transitions. [2019-11-15 22:14:23,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:14:23,809 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 613 transitions. [2019-11-15 22:14:23,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 22:14:23,811 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:23,811 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-15 22:14:24,017 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:14:24,017 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:24,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:24,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1512306975, now seen corresponding path program 1 times [2019-11-15 22:14:24,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:24,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895145809] [2019-11-15 22:14:24,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:24,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:24,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:24,124 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:14:24,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895145809] [2019-11-15 22:14:24,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151670983] [2019-11-15 22:14:24,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/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 22:14:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:24,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 22:14:24,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:24,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 22:14:24,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:14:24,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:14:24,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:14:24,313 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2019-11-15 22:14:24,332 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 22:14:24,332 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:14:24,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2019-11-15 22:14:24,332 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970764067] [2019-11-15 22:14:24,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:14:24,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:24,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:14:24,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:14:24,333 INFO L87 Difference]: Start difference. First operand 420 states and 613 transitions. Second operand 7 states. [2019-11-15 22:14:25,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:25,602 INFO L93 Difference]: Finished difference Result 986 states and 1693 transitions. [2019-11-15 22:14:25,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:14:25,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-15 22:14:25,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:25,609 INFO L225 Difference]: With dead ends: 986 [2019-11-15 22:14:25,609 INFO L226 Difference]: Without dead ends: 579 [2019-11-15 22:14:25,613 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-11-15 22:14:25,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-11-15 22:14:25,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 484. [2019-11-15 22:14:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-11-15 22:14:25,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 745 transitions. [2019-11-15 22:14:25,651 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 745 transitions. Word has length 42 [2019-11-15 22:14:25,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:25,651 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 745 transitions. [2019-11-15 22:14:25,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:14:25,652 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 745 transitions. [2019-11-15 22:14:25,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 22:14:25,653 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:25,653 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:25,856 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:14:25,857 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:25,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:25,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1869230798, now seen corresponding path program 1 times [2019-11-15 22:14:25,857 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:25,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026851020] [2019-11-15 22:14:25,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:25,857 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:25,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:14:25,967 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026851020] [2019-11-15 22:14:25,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:25,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:14:25,968 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108011111] [2019-11-15 22:14:25,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:14:25,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:25,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:14:25,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:14:25,969 INFO L87 Difference]: Start difference. First operand 484 states and 745 transitions. Second operand 6 states. [2019-11-15 22:14:26,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:26,743 INFO L93 Difference]: Finished difference Result 1070 states and 1976 transitions. [2019-11-15 22:14:26,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:14:26,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-11-15 22:14:26,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:26,749 INFO L225 Difference]: With dead ends: 1070 [2019-11-15 22:14:26,749 INFO L226 Difference]: Without dead ends: 597 [2019-11-15 22:14:26,753 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:14:26,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-11-15 22:14:26,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 535. [2019-11-15 22:14:26,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-11-15 22:14:26,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 839 transitions. [2019-11-15 22:14:26,790 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 839 transitions. Word has length 46 [2019-11-15 22:14:26,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:26,791 INFO L462 AbstractCegarLoop]: Abstraction has 535 states and 839 transitions. [2019-11-15 22:14:26,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:14:26,791 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 839 transitions. [2019-11-15 22:14:26,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 22:14:26,792 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:26,792 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:26,792 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:26,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:26,793 INFO L82 PathProgramCache]: Analyzing trace with hash 214285764, now seen corresponding path program 1 times [2019-11-15 22:14:26,793 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:26,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107940071] [2019-11-15 22:14:26,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:26,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:26,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:26,910 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:14:26,911 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107940071] [2019-11-15 22:14:26,911 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:26,911 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:14:26,911 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917273372] [2019-11-15 22:14:26,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:14:26,912 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:26,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:14:26,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:14:26,912 INFO L87 Difference]: Start difference. First operand 535 states and 839 transitions. Second operand 6 states. [2019-11-15 22:14:27,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:27,677 INFO L93 Difference]: Finished difference Result 1113 states and 2055 transitions. [2019-11-15 22:14:27,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:14:27,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-11-15 22:14:27,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:27,684 INFO L225 Difference]: With dead ends: 1113 [2019-11-15 22:14:27,684 INFO L226 Difference]: Without dead ends: 589 [2019-11-15 22:14:27,688 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:14:27,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-11-15 22:14:27,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 537. [2019-11-15 22:14:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-11-15 22:14:27,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 841 transitions. [2019-11-15 22:14:27,726 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 841 transitions. Word has length 47 [2019-11-15 22:14:27,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:27,726 INFO L462 AbstractCegarLoop]: Abstraction has 537 states and 841 transitions. [2019-11-15 22:14:27,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:14:27,727 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 841 transitions. [2019-11-15 22:14:27,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 22:14:27,728 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:27,728 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:27,728 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:27,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:27,728 INFO L82 PathProgramCache]: Analyzing trace with hash 917449758, now seen corresponding path program 1 times [2019-11-15 22:14:27,729 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:27,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672715414] [2019-11-15 22:14:27,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:27,729 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:27,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:27,861 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:14:27,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672715414] [2019-11-15 22:14:27,861 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:27,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:14:27,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439429784] [2019-11-15 22:14:27,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:14:27,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:27,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:14:27,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:14:27,865 INFO L87 Difference]: Start difference. First operand 537 states and 841 transitions. Second operand 8 states. [2019-11-15 22:14:29,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:29,176 INFO L93 Difference]: Finished difference Result 1172 states and 2220 transitions. [2019-11-15 22:14:29,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:14:29,177 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-11-15 22:14:29,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:29,184 INFO L225 Difference]: With dead ends: 1172 [2019-11-15 22:14:29,184 INFO L226 Difference]: Without dead ends: 646 [2019-11-15 22:14:29,189 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:14:29,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-11-15 22:14:29,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 622. [2019-11-15 22:14:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-11-15 22:14:29,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1032 transitions. [2019-11-15 22:14:29,234 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1032 transitions. Word has length 48 [2019-11-15 22:14:29,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:29,234 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 1032 transitions. [2019-11-15 22:14:29,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:14:29,234 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1032 transitions. [2019-11-15 22:14:29,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 22:14:29,236 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:29,236 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:29,236 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:29,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:29,237 INFO L82 PathProgramCache]: Analyzing trace with hash -631761552, now seen corresponding path program 1 times [2019-11-15 22:14:29,237 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:29,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899711167] [2019-11-15 22:14:29,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:29,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:29,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:29,485 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:14:29,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899711167] [2019-11-15 22:14:29,486 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:29,486 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:14:29,486 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941967399] [2019-11-15 22:14:29,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:14:29,487 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:29,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:14:29,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:14:29,487 INFO L87 Difference]: Start difference. First operand 622 states and 1032 transitions. Second operand 9 states. [2019-11-15 22:14:30,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:30,794 INFO L93 Difference]: Finished difference Result 1318 states and 2504 transitions. [2019-11-15 22:14:30,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:14:30,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2019-11-15 22:14:30,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:30,805 INFO L225 Difference]: With dead ends: 1318 [2019-11-15 22:14:30,805 INFO L226 Difference]: Without dead ends: 707 [2019-11-15 22:14:30,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:14:30,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-11-15 22:14:30,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 683. [2019-11-15 22:14:30,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2019-11-15 22:14:30,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1139 transitions. [2019-11-15 22:14:30,863 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1139 transitions. Word has length 49 [2019-11-15 22:14:30,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:30,865 INFO L462 AbstractCegarLoop]: Abstraction has 683 states and 1139 transitions. [2019-11-15 22:14:30,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:14:30,865 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1139 transitions. [2019-11-15 22:14:30,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 22:14:30,867 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:30,867 INFO L380 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:30,867 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:30,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:30,868 INFO L82 PathProgramCache]: Analyzing trace with hash -103288946, now seen corresponding path program 1 times [2019-11-15 22:14:30,868 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:30,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71642060] [2019-11-15 22:14:30,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:30,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:30,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:31,022 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:14:31,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71642060] [2019-11-15 22:14:31,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020413796] [2019-11-15 22:14:31,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/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 22:14:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:31,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:14:31,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:31,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 22:14:31,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:14:31,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:14:31,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:14:31,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-15 22:14:31,223 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 22:14:31,223 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:14:31,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2019-11-15 22:14:31,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808428988] [2019-11-15 22:14:31,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:14:31,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:31,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:14:31,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:14:31,224 INFO L87 Difference]: Start difference. First operand 683 states and 1139 transitions. Second operand 8 states. [2019-11-15 22:14:32,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:32,450 INFO L93 Difference]: Finished difference Result 1565 states and 3026 transitions. [2019-11-15 22:14:32,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:14:32,450 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-11-15 22:14:32,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:32,459 INFO L225 Difference]: With dead ends: 1565 [2019-11-15 22:14:32,460 INFO L226 Difference]: Without dead ends: 893 [2019-11-15 22:14:32,467 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:14:32,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-11-15 22:14:32,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 876. [2019-11-15 22:14:32,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-11-15 22:14:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1495 transitions. [2019-11-15 22:14:32,532 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1495 transitions. Word has length 54 [2019-11-15 22:14:32,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:32,532 INFO L462 AbstractCegarLoop]: Abstraction has 876 states and 1495 transitions. [2019-11-15 22:14:32,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:14:32,532 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1495 transitions. [2019-11-15 22:14:32,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 22:14:32,535 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:32,535 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:32,748 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:14:32,748 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:32,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:32,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1302218897, now seen corresponding path program 1 times [2019-11-15 22:14:32,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:32,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225106976] [2019-11-15 22:14:32,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:32,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:32,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:32,894 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 22:14:32,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225106976] [2019-11-15 22:14:32,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448133032] [2019-11-15 22:14:32,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/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 22:14:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:33,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 22:14:33,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:33,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 22:14:33,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:14:33,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:14:33,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:14:33,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2019-11-15 22:14:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 22:14:33,242 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:14:33,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2019-11-15 22:14:33,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074524236] [2019-11-15 22:14:33,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:14:33,243 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:33,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:14:33,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:14:33,243 INFO L87 Difference]: Start difference. First operand 876 states and 1495 transitions. Second operand 7 states. [2019-11-15 22:14:34,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:34,210 INFO L93 Difference]: Finished difference Result 2038 states and 4376 transitions. [2019-11-15 22:14:34,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:14:34,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-11-15 22:14:34,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:34,224 INFO L225 Difference]: With dead ends: 2038 [2019-11-15 22:14:34,224 INFO L226 Difference]: Without dead ends: 1173 [2019-11-15 22:14:34,233 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-11-15 22:14:34,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2019-11-15 22:14:34,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1137. [2019-11-15 22:14:34,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1137 states. [2019-11-15 22:14:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 2189 transitions. [2019-11-15 22:14:34,329 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 2189 transitions. Word has length 56 [2019-11-15 22:14:34,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:34,329 INFO L462 AbstractCegarLoop]: Abstraction has 1137 states and 2189 transitions. [2019-11-15 22:14:34,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:14:34,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 2189 transitions. [2019-11-15 22:14:34,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 22:14:34,332 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:34,332 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:34,544 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:14:34,544 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:34,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:34,545 INFO L82 PathProgramCache]: Analyzing trace with hash -715412883, now seen corresponding path program 1 times [2019-11-15 22:14:34,545 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:34,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521790523] [2019-11-15 22:14:34,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:34,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:34,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:34,704 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 22:14:34,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521790523] [2019-11-15 22:14:34,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:34,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:14:34,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233521051] [2019-11-15 22:14:34,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:14:34,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:34,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:14:34,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:14:34,706 INFO L87 Difference]: Start difference. First operand 1137 states and 2189 transitions. Second operand 7 states. [2019-11-15 22:14:35,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:35,498 INFO L93 Difference]: Finished difference Result 2300 states and 5319 transitions. [2019-11-15 22:14:35,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:14:35,498 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-11-15 22:14:35,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:35,511 INFO L225 Difference]: With dead ends: 2300 [2019-11-15 22:14:35,511 INFO L226 Difference]: Without dead ends: 1174 [2019-11-15 22:14:35,523 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:14:35,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2019-11-15 22:14:35,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1155. [2019-11-15 22:14:35,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2019-11-15 22:14:35,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 2229 transitions. [2019-11-15 22:14:35,610 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 2229 transitions. Word has length 56 [2019-11-15 22:14:35,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:35,611 INFO L462 AbstractCegarLoop]: Abstraction has 1155 states and 2229 transitions. [2019-11-15 22:14:35,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:14:35,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 2229 transitions. [2019-11-15 22:14:35,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 22:14:35,614 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:35,614 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:35,614 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:35,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:35,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2087220181, now seen corresponding path program 1 times [2019-11-15 22:14:35,615 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:35,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137201641] [2019-11-15 22:14:35,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:35,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:35,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:35,722 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 22:14:35,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137201641] [2019-11-15 22:14:35,723 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:35,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:14:35,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709277871] [2019-11-15 22:14:35,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:14:35,723 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:35,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:14:35,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:14:35,724 INFO L87 Difference]: Start difference. First operand 1155 states and 2229 transitions. Second operand 6 states. [2019-11-15 22:14:36,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:36,329 INFO L93 Difference]: Finished difference Result 2613 states and 5974 transitions. [2019-11-15 22:14:36,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:14:36,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-11-15 22:14:36,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:36,344 INFO L225 Difference]: With dead ends: 2613 [2019-11-15 22:14:36,345 INFO L226 Difference]: Without dead ends: 1469 [2019-11-15 22:14:36,356 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:14:36,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2019-11-15 22:14:36,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1444. [2019-11-15 22:14:36,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2019-11-15 22:14:36,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2691 transitions. [2019-11-15 22:14:36,520 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2691 transitions. Word has length 56 [2019-11-15 22:14:36,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:36,521 INFO L462 AbstractCegarLoop]: Abstraction has 1444 states and 2691 transitions. [2019-11-15 22:14:36,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:14:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2691 transitions. [2019-11-15 22:14:36,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-15 22:14:36,526 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:36,527 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:36,527 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:36,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:36,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1327114492, now seen corresponding path program 1 times [2019-11-15 22:14:36,528 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:36,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12205073] [2019-11-15 22:14:36,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:36,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:36,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:14:36,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12205073] [2019-11-15 22:14:36,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:36,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:14:36,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297001924] [2019-11-15 22:14:36,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:14:36,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:36,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:14:36,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:14:36,619 INFO L87 Difference]: Start difference. First operand 1444 states and 2691 transitions. Second operand 8 states. [2019-11-15 22:14:37,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:37,546 INFO L93 Difference]: Finished difference Result 2949 states and 6659 transitions. [2019-11-15 22:14:37,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:14:37,546 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-11-15 22:14:37,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:37,561 INFO L225 Difference]: With dead ends: 2949 [2019-11-15 22:14:37,561 INFO L226 Difference]: Without dead ends: 1516 [2019-11-15 22:14:37,573 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:14:37,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2019-11-15 22:14:37,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1496. [2019-11-15 22:14:37,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2019-11-15 22:14:37,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 2756 transitions. [2019-11-15 22:14:37,675 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 2756 transitions. Word has length 56 [2019-11-15 22:14:37,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:37,676 INFO L462 AbstractCegarLoop]: Abstraction has 1496 states and 2756 transitions. [2019-11-15 22:14:37,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:14:37,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 2756 transitions. [2019-11-15 22:14:37,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 22:14:37,678 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:37,678 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:37,679 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:37,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:37,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1709178951, now seen corresponding path program 1 times [2019-11-15 22:14:37,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:37,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104720661] [2019-11-15 22:14:37,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:37,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:37,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:37,819 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:14:37,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104720661] [2019-11-15 22:14:37,819 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:37,820 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:14:37,820 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745753186] [2019-11-15 22:14:37,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:14:37,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:37,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:14:37,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:14:37,821 INFO L87 Difference]: Start difference. First operand 1496 states and 2756 transitions. Second operand 7 states. [2019-11-15 22:14:38,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:38,564 INFO L93 Difference]: Finished difference Result 2954 states and 6614 transitions. [2019-11-15 22:14:38,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:14:38,564 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-11-15 22:14:38,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:38,578 INFO L225 Difference]: With dead ends: 2954 [2019-11-15 22:14:38,578 INFO L226 Difference]: Without dead ends: 1469 [2019-11-15 22:14:38,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:14:38,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2019-11-15 22:14:38,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1461. [2019-11-15 22:14:38,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1461 states. [2019-11-15 22:14:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 2707 transitions. [2019-11-15 22:14:38,684 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 2707 transitions. Word has length 57 [2019-11-15 22:14:38,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:38,684 INFO L462 AbstractCegarLoop]: Abstraction has 1461 states and 2707 transitions. [2019-11-15 22:14:38,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:14:38,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 2707 transitions. [2019-11-15 22:14:38,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 22:14:38,690 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:38,691 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:38,691 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:38,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:38,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1857161727, now seen corresponding path program 1 times [2019-11-15 22:14:38,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:38,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33019922] [2019-11-15 22:14:38,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:38,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:38,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:38,839 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:14:38,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33019922] [2019-11-15 22:14:38,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110094577] [2019-11-15 22:14:38,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/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 22:14:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:39,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 22:14:39,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:39,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:14:39,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-15 22:14:39,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:14:39,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-15 22:14:39,069 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:14:39,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:14:39,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 22:14:39,074 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:11 [2019-11-15 22:14:39,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:14:39,082 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-15 22:14:39,082 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:14:39,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-11-15 22:14:39,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450096511] [2019-11-15 22:14:39,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:14:39,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:39,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:14:39,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:14:39,084 INFO L87 Difference]: Start difference. First operand 1461 states and 2707 transitions. Second operand 9 states. [2019-11-15 22:14:40,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:40,888 INFO L93 Difference]: Finished difference Result 3506 states and 8559 transitions. [2019-11-15 22:14:40,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:14:40,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2019-11-15 22:14:40,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:40,910 INFO L225 Difference]: With dead ends: 3506 [2019-11-15 22:14:40,910 INFO L226 Difference]: Without dead ends: 2056 [2019-11-15 22:14:40,922 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:14:40,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2019-11-15 22:14:41,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 2037. [2019-11-15 22:14:41,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2037 states. [2019-11-15 22:14:41,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 4330 transitions. [2019-11-15 22:14:41,078 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 4330 transitions. Word has length 60 [2019-11-15 22:14:41,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:41,078 INFO L462 AbstractCegarLoop]: Abstraction has 2037 states and 4330 transitions. [2019-11-15 22:14:41,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:14:41,079 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 4330 transitions. [2019-11-15 22:14:41,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 22:14:41,084 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:41,084 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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, 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 22:14:41,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:14:41,289 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:41,289 INFO L82 PathProgramCache]: Analyzing trace with hash 662556486, now seen corresponding path program 1 times [2019-11-15 22:14:41,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:41,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645074663] [2019-11-15 22:14:41,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:41,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:41,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:41,495 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:14:41,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645074663] [2019-11-15 22:14:41,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:41,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:14:41,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786972456] [2019-11-15 22:14:41,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:14:41,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:41,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:14:41,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:14:41,497 INFO L87 Difference]: Start difference. First operand 2037 states and 4330 transitions. Second operand 9 states. [2019-11-15 22:14:42,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:42,716 INFO L93 Difference]: Finished difference Result 4108 states and 10892 transitions. [2019-11-15 22:14:42,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:14:42,718 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-11-15 22:14:42,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:42,736 INFO L225 Difference]: With dead ends: 4108 [2019-11-15 22:14:42,737 INFO L226 Difference]: Without dead ends: 2082 [2019-11-15 22:14:42,749 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:14:42,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2019-11-15 22:14:42,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 2076. [2019-11-15 22:14:42,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2076 states. [2019-11-15 22:14:42,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 4404 transitions. [2019-11-15 22:14:42,978 INFO L78 Accepts]: Start accepts. Automaton has 2076 states and 4404 transitions. Word has length 63 [2019-11-15 22:14:42,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:42,979 INFO L462 AbstractCegarLoop]: Abstraction has 2076 states and 4404 transitions. [2019-11-15 22:14:42,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:14:42,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 4404 transitions. [2019-11-15 22:14:42,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 22:14:42,985 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:42,985 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 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 22:14:42,985 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:42,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:42,986 INFO L82 PathProgramCache]: Analyzing trace with hash -678786254, now seen corresponding path program 1 times [2019-11-15 22:14:42,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:42,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132816383] [2019-11-15 22:14:42,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:42,987 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:42,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:43,105 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:14:43,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132816383] [2019-11-15 22:14:43,105 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:43,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:14:43,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542350776] [2019-11-15 22:14:43,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:14:43,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:43,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:14:43,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:14:43,106 INFO L87 Difference]: Start difference. First operand 2076 states and 4404 transitions. Second operand 9 states. [2019-11-15 22:14:44,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:44,354 INFO L93 Difference]: Finished difference Result 4238 states and 11231 transitions. [2019-11-15 22:14:44,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:14:44,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-11-15 22:14:44,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:44,375 INFO L225 Difference]: With dead ends: 4238 [2019-11-15 22:14:44,376 INFO L226 Difference]: Without dead ends: 2173 [2019-11-15 22:14:44,389 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:14:44,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2019-11-15 22:14:44,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 2133. [2019-11-15 22:14:44,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-11-15 22:14:44,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 4478 transitions. [2019-11-15 22:14:44,538 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 4478 transitions. Word has length 64 [2019-11-15 22:14:44,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:44,538 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 4478 transitions. [2019-11-15 22:14:44,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:14:44,539 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 4478 transitions. [2019-11-15 22:14:44,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 22:14:44,544 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:44,544 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:44,544 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:44,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:44,545 INFO L82 PathProgramCache]: Analyzing trace with hash 572592902, now seen corresponding path program 1 times [2019-11-15 22:14:44,545 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:44,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711781084] [2019-11-15 22:14:44,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:44,545 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:44,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:44,726 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 22:14:44,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711781084] [2019-11-15 22:14:44,727 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:44,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:14:44,727 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373694514] [2019-11-15 22:14:44,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:14:44,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:44,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:14:44,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:14:44,728 INFO L87 Difference]: Start difference. First operand 2133 states and 4478 transitions. Second operand 8 states. [2019-11-15 22:14:46,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:46,078 INFO L93 Difference]: Finished difference Result 4236 states and 11161 transitions. [2019-11-15 22:14:46,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:14:46,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-11-15 22:14:46,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:46,091 INFO L225 Difference]: With dead ends: 4236 [2019-11-15 22:14:46,091 INFO L226 Difference]: Without dead ends: 2114 [2019-11-15 22:14:46,100 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:14:46,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2019-11-15 22:14:46,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2084. [2019-11-15 22:14:46,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2084 states. [2019-11-15 22:14:46,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 4382 transitions. [2019-11-15 22:14:46,323 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 4382 transitions. Word has length 65 [2019-11-15 22:14:46,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:46,323 INFO L462 AbstractCegarLoop]: Abstraction has 2084 states and 4382 transitions. [2019-11-15 22:14:46,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:14:46,324 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 4382 transitions. [2019-11-15 22:14:46,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-15 22:14:46,329 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:46,330 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:46,330 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:46,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:46,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1835600644, now seen corresponding path program 1 times [2019-11-15 22:14:46,330 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:46,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856213608] [2019-11-15 22:14:46,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:46,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:46,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:46,496 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 22:14:46,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856213608] [2019-11-15 22:14:46,497 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:46,497 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:14:46,497 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498778494] [2019-11-15 22:14:46,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:14:46,498 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:46,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:14:46,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:14:46,498 INFO L87 Difference]: Start difference. First operand 2084 states and 4382 transitions. Second operand 9 states. [2019-11-15 22:14:47,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:47,562 INFO L93 Difference]: Finished difference Result 4195 states and 10968 transitions. [2019-11-15 22:14:47,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:14:47,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2019-11-15 22:14:47,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:47,576 INFO L225 Difference]: With dead ends: 4195 [2019-11-15 22:14:47,577 INFO L226 Difference]: Without dead ends: 2122 [2019-11-15 22:14:47,590 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:14:47,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2019-11-15 22:14:47,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2112. [2019-11-15 22:14:47,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2112 states. [2019-11-15 22:14:47,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 4425 transitions. [2019-11-15 22:14:47,728 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 4425 transitions. Word has length 80 [2019-11-15 22:14:47,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:47,729 INFO L462 AbstractCegarLoop]: Abstraction has 2112 states and 4425 transitions. [2019-11-15 22:14:47,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:14:47,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 4425 transitions. [2019-11-15 22:14:47,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 22:14:47,734 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:47,735 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:47,735 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:47,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:47,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1499328999, now seen corresponding path program 1 times [2019-11-15 22:14:47,735 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:47,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005662508] [2019-11-15 22:14:47,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:47,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:47,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:47,826 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 22:14:47,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005662508] [2019-11-15 22:14:47,826 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:47,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:14:47,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253599179] [2019-11-15 22:14:47,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:14:47,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:47,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:14:47,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:14:47,828 INFO L87 Difference]: Start difference. First operand 2112 states and 4425 transitions. Second operand 4 states. [2019-11-15 22:14:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:48,350 INFO L93 Difference]: Finished difference Result 4279 states and 11261 transitions. [2019-11-15 22:14:48,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:14:48,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 22:14:48,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:48,369 INFO L225 Difference]: With dead ends: 4279 [2019-11-15 22:14:48,369 INFO L226 Difference]: Without dead ends: 2178 [2019-11-15 22:14:48,383 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:14:48,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2019-11-15 22:14:48,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 2140. [2019-11-15 22:14:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2019-11-15 22:14:48,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 4538 transitions. [2019-11-15 22:14:48,526 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 4538 transitions. Word has length 66 [2019-11-15 22:14:48,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:48,527 INFO L462 AbstractCegarLoop]: Abstraction has 2140 states and 4538 transitions. [2019-11-15 22:14:48,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:14:48,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 4538 transitions. [2019-11-15 22:14:48,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 22:14:48,533 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:48,533 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:48,534 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:48,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:48,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1099686263, now seen corresponding path program 1 times [2019-11-15 22:14:48,534 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:48,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130397473] [2019-11-15 22:14:48,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:48,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:48,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:48,994 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-15 22:14:48,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130397473] [2019-11-15 22:14:48,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:48,995 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 22:14:48,995 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587590801] [2019-11-15 22:14:48,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:14:48,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:48,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:14:48,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:14:48,998 INFO L87 Difference]: Start difference. First operand 2140 states and 4538 transitions. Second operand 10 states. [2019-11-15 22:14:50,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:50,466 INFO L93 Difference]: Finished difference Result 4281 states and 9111 transitions. [2019-11-15 22:14:50,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:14:50,467 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-11-15 22:14:50,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:50,498 INFO L225 Difference]: With dead ends: 4281 [2019-11-15 22:14:50,498 INFO L226 Difference]: Without dead ends: 2152 [2019-11-15 22:14:50,506 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:14:50,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2152 states. [2019-11-15 22:14:50,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2152 to 2146. [2019-11-15 22:14:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2019-11-15 22:14:50,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 4544 transitions. [2019-11-15 22:14:50,654 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 4544 transitions. Word has length 67 [2019-11-15 22:14:50,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:50,654 INFO L462 AbstractCegarLoop]: Abstraction has 2146 states and 4544 transitions. [2019-11-15 22:14:50,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:14:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 4544 transitions. [2019-11-15 22:14:50,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 22:14:50,661 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:50,661 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:50,661 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:50,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:50,664 INFO L82 PathProgramCache]: Analyzing trace with hash 552019016, now seen corresponding path program 1 times [2019-11-15 22:14:50,664 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:50,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236849806] [2019-11-15 22:14:50,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:50,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:50,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:50,904 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 51 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 22:14:50,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236849806] [2019-11-15 22:14:50,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818483063] [2019-11-15 22:14:50,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/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 22:14:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:51,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 22:14:51,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:51,263 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-15 22:14:51,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:14:51,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2019-11-15 22:14:51,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991810894] [2019-11-15 22:14:51,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 22:14:51,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:51,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 22:14:51,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:14:51,265 INFO L87 Difference]: Start difference. First operand 2146 states and 4544 transitions. Second operand 11 states. [2019-11-15 22:14:51,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:51,464 INFO L93 Difference]: Finished difference Result 4295 states and 11351 transitions. [2019-11-15 22:14:51,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:14:51,465 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-11-15 22:14:51,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:51,488 INFO L225 Difference]: With dead ends: 4295 [2019-11-15 22:14:51,488 INFO L226 Difference]: Without dead ends: 2166 [2019-11-15 22:14:51,501 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-11-15 22:14:51,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2019-11-15 22:14:51,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2149. [2019-11-15 22:14:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2149 states. [2019-11-15 22:14:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 4550 transitions. [2019-11-15 22:14:51,645 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 4550 transitions. Word has length 95 [2019-11-15 22:14:51,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:51,645 INFO L462 AbstractCegarLoop]: Abstraction has 2149 states and 4550 transitions. [2019-11-15 22:14:51,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 22:14:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 4550 transitions. [2019-11-15 22:14:51,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-15 22:14:51,652 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:51,652 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:51,857 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:14:51,857 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:51,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:51,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1105749479, now seen corresponding path program 1 times [2019-11-15 22:14:51,857 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:51,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395101787] [2019-11-15 22:14:51,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:51,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:51,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:52,211 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-15 22:14:52,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395101787] [2019-11-15 22:14:52,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:52,212 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-15 22:14:52,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815471820] [2019-11-15 22:14:52,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 22:14:52,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:52,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:14:52,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:14:52,213 INFO L87 Difference]: Start difference. First operand 2149 states and 4550 transitions. Second operand 12 states. [2019-11-15 22:14:53,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:53,239 INFO L93 Difference]: Finished difference Result 4304 states and 11366 transitions. [2019-11-15 22:14:53,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:14:53,239 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 83 [2019-11-15 22:14:53,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:53,254 INFO L225 Difference]: With dead ends: 4304 [2019-11-15 22:14:53,254 INFO L226 Difference]: Without dead ends: 2172 [2019-11-15 22:14:53,269 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:14:53,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2019-11-15 22:14:53,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2151. [2019-11-15 22:14:53,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2151 states. [2019-11-15 22:14:53,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2151 states to 2151 states and 4552 transitions. [2019-11-15 22:14:53,407 INFO L78 Accepts]: Start accepts. Automaton has 2151 states and 4552 transitions. Word has length 83 [2019-11-15 22:14:53,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:53,408 INFO L462 AbstractCegarLoop]: Abstraction has 2151 states and 4552 transitions. [2019-11-15 22:14:53,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 22:14:53,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2151 states and 4552 transitions. [2019-11-15 22:14:53,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 22:14:53,414 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:53,414 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:53,414 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:53,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:53,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1077259773, now seen corresponding path program 1 times [2019-11-15 22:14:53,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:53,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406648282] [2019-11-15 22:14:53,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:53,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:53,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:53,532 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-15 22:14:53,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406648282] [2019-11-15 22:14:53,532 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:53,533 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:14:53,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500236759] [2019-11-15 22:14:53,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:14:53,533 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:53,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:14:53,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:14:53,534 INFO L87 Difference]: Start difference. First operand 2151 states and 4552 transitions. Second operand 7 states. [2019-11-15 22:14:54,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:54,163 INFO L93 Difference]: Finished difference Result 5818 states and 16755 transitions. [2019-11-15 22:14:54,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:14:54,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-11-15 22:14:54,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:54,190 INFO L225 Difference]: With dead ends: 5818 [2019-11-15 22:14:54,190 INFO L226 Difference]: Without dead ends: 3684 [2019-11-15 22:14:54,203 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:14:54,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3684 states. [2019-11-15 22:14:54,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3684 to 3660. [2019-11-15 22:14:54,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3660 states. [2019-11-15 22:14:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3660 states to 3660 states and 8590 transitions. [2019-11-15 22:14:54,481 INFO L78 Accepts]: Start accepts. Automaton has 3660 states and 8590 transitions. Word has length 72 [2019-11-15 22:14:54,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:54,481 INFO L462 AbstractCegarLoop]: Abstraction has 3660 states and 8590 transitions. [2019-11-15 22:14:54,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:14:54,481 INFO L276 IsEmpty]: Start isEmpty. Operand 3660 states and 8590 transitions. [2019-11-15 22:14:54,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:14:54,488 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:54,488 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:54,489 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:54,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:54,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1882099585, now seen corresponding path program 1 times [2019-11-15 22:14:54,489 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:54,489 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189399779] [2019-11-15 22:14:54,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:54,490 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:54,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:54,775 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 47 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 22:14:54,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189399779] [2019-11-15 22:14:54,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136649628] [2019-11-15 22:14:54,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/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 22:14:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:54,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:14:54,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:14:55,037 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-15 22:14:55,038 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:14:55,038 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 10 [2019-11-15 22:14:55,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033532021] [2019-11-15 22:14:55,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:14:55,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:55,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:14:55,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:14:55,041 INFO L87 Difference]: Start difference. First operand 3660 states and 8590 transitions. Second operand 10 states. [2019-11-15 22:14:56,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:56,398 INFO L93 Difference]: Finished difference Result 7323 states and 22272 transitions. [2019-11-15 22:14:56,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:14:56,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2019-11-15 22:14:56,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:56,434 INFO L225 Difference]: With dead ends: 7323 [2019-11-15 22:14:56,434 INFO L226 Difference]: Without dead ends: 3675 [2019-11-15 22:14:56,463 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:14:56,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3675 states. [2019-11-15 22:14:56,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3675 to 3642. [2019-11-15 22:14:56,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3642 states. [2019-11-15 22:14:56,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3642 states and 8606 transitions. [2019-11-15 22:14:56,727 INFO L78 Accepts]: Start accepts. Automaton has 3642 states and 8606 transitions. Word has length 98 [2019-11-15 22:14:56,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:56,727 INFO L462 AbstractCegarLoop]: Abstraction has 3642 states and 8606 transitions. [2019-11-15 22:14:56,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:14:56,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3642 states and 8606 transitions. [2019-11-15 22:14:56,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 22:14:56,733 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:56,733 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:56,945 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:14:56,945 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:56,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:56,946 INFO L82 PathProgramCache]: Analyzing trace with hash -2137231638, now seen corresponding path program 1 times [2019-11-15 22:14:56,946 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:56,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818655214] [2019-11-15 22:14:56,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:56,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:56,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:57,136 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-15 22:14:57,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818655214] [2019-11-15 22:14:57,137 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:57,137 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 22:14:57,137 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115686764] [2019-11-15 22:14:57,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 22:14:57,138 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:57,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 22:14:57,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:14:57,139 INFO L87 Difference]: Start difference. First operand 3642 states and 8606 transitions. Second operand 11 states. [2019-11-15 22:14:58,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:14:58,733 INFO L93 Difference]: Finished difference Result 7354 states and 22322 transitions. [2019-11-15 22:14:58,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 22:14:58,733 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 92 [2019-11-15 22:14:58,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:14:58,774 INFO L225 Difference]: With dead ends: 7354 [2019-11-15 22:14:58,774 INFO L226 Difference]: Without dead ends: 3729 [2019-11-15 22:14:58,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:14:58,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3729 states. [2019-11-15 22:14:59,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3729 to 3652. [2019-11-15 22:14:59,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3652 states. [2019-11-15 22:14:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3652 states to 3652 states and 8641 transitions. [2019-11-15 22:14:59,188 INFO L78 Accepts]: Start accepts. Automaton has 3652 states and 8641 transitions. Word has length 92 [2019-11-15 22:14:59,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:14:59,188 INFO L462 AbstractCegarLoop]: Abstraction has 3652 states and 8641 transitions. [2019-11-15 22:14:59,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 22:14:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3652 states and 8641 transitions. [2019-11-15 22:14:59,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 22:14:59,194 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:14:59,194 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:14:59,194 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:14:59,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:14:59,195 INFO L82 PathProgramCache]: Analyzing trace with hash 142128152, now seen corresponding path program 1 times [2019-11-15 22:14:59,195 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:14:59,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066341160] [2019-11-15 22:14:59,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:59,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:14:59,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:14:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:14:59,393 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-15 22:14:59,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066341160] [2019-11-15 22:14:59,394 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:14:59,394 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 22:14:59,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867624326] [2019-11-15 22:14:59,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 22:14:59,395 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:14:59,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 22:14:59,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:14:59,396 INFO L87 Difference]: Start difference. First operand 3652 states and 8641 transitions. Second operand 11 states. [2019-11-15 22:15:00,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:00,633 INFO L93 Difference]: Finished difference Result 7362 states and 22355 transitions. [2019-11-15 22:15:00,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 22:15:00,634 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2019-11-15 22:15:00,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:00,660 INFO L225 Difference]: With dead ends: 7362 [2019-11-15 22:15:00,660 INFO L226 Difference]: Without dead ends: 3727 [2019-11-15 22:15:00,678 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:15:00,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3727 states. [2019-11-15 22:15:00,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 3650. [2019-11-15 22:15:00,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3650 states. [2019-11-15 22:15:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 8636 transitions. [2019-11-15 22:15:00,856 INFO L78 Accepts]: Start accepts. Automaton has 3650 states and 8636 transitions. Word has length 87 [2019-11-15 22:15:00,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:00,857 INFO L462 AbstractCegarLoop]: Abstraction has 3650 states and 8636 transitions. [2019-11-15 22:15:00,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 22:15:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3650 states and 8636 transitions. [2019-11-15 22:15:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 22:15:00,864 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:00,864 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:15:00,864 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:00,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:00,864 INFO L82 PathProgramCache]: Analyzing trace with hash 488053929, now seen corresponding path program 1 times [2019-11-15 22:15:00,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:00,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349840620] [2019-11-15 22:15:00,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:00,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:00,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:01,018 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-15 22:15:01,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349840620] [2019-11-15 22:15:01,019 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:01,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:15:01,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388260036] [2019-11-15 22:15:01,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:15:01,020 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:01,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:15:01,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:15:01,020 INFO L87 Difference]: Start difference. First operand 3650 states and 8636 transitions. Second operand 8 states. [2019-11-15 22:15:02,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:02,467 INFO L93 Difference]: Finished difference Result 7327 states and 22254 transitions. [2019-11-15 22:15:02,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:15:02,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-11-15 22:15:02,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:02,497 INFO L225 Difference]: With dead ends: 7327 [2019-11-15 22:15:02,497 INFO L226 Difference]: Without dead ends: 3689 [2019-11-15 22:15:02,524 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:15:02,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2019-11-15 22:15:02,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3653. [2019-11-15 22:15:02,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3653 states. [2019-11-15 22:15:02,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3653 states to 3653 states and 8616 transitions. [2019-11-15 22:15:02,791 INFO L78 Accepts]: Start accepts. Automaton has 3653 states and 8616 transitions. Word has length 82 [2019-11-15 22:15:02,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:02,791 INFO L462 AbstractCegarLoop]: Abstraction has 3653 states and 8616 transitions. [2019-11-15 22:15:02,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:15:02,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3653 states and 8616 transitions. [2019-11-15 22:15:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-15 22:15:02,800 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:02,801 INFO L380 BasicCegarLoop]: trace histogram [8, 7, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:15:02,801 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:02,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:02,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1410185538, now seen corresponding path program 1 times [2019-11-15 22:15:02,802 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:02,802 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53310149] [2019-11-15 22:15:02,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:02,802 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:02,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:03,079 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-15 22:15:03,079 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53310149] [2019-11-15 22:15:03,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511203291] [2019-11-15 22:15:03,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/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 22:15:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:03,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:15:03,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:03,360 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-11-15 22:15:03,361 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:15:03,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-15 22:15:03,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442253426] [2019-11-15 22:15:03,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:15:03,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:03,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:15:03,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:15:03,362 INFO L87 Difference]: Start difference. First operand 3653 states and 8616 transitions. Second operand 3 states. [2019-11-15 22:15:03,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:03,505 INFO L93 Difference]: Finished difference Result 7381 states and 22847 transitions. [2019-11-15 22:15:03,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:15:03,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-11-15 22:15:03,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:03,534 INFO L225 Difference]: With dead ends: 7381 [2019-11-15 22:15:03,534 INFO L226 Difference]: Without dead ends: 3745 [2019-11-15 22:15:03,553 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 155 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:15:03,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2019-11-15 22:15:03,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3653. [2019-11-15 22:15:03,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3653 states. [2019-11-15 22:15:03,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3653 states to 3653 states and 8614 transitions. [2019-11-15 22:15:03,738 INFO L78 Accepts]: Start accepts. Automaton has 3653 states and 8614 transitions. Word has length 143 [2019-11-15 22:15:03,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:03,738 INFO L462 AbstractCegarLoop]: Abstraction has 3653 states and 8614 transitions. [2019-11-15 22:15:03,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:15:03,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3653 states and 8614 transitions. [2019-11-15 22:15:03,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-15 22:15:03,744 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:03,744 INFO L380 BasicCegarLoop]: trace histogram [8, 7, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:15:03,948 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:03,949 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:03,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:03,949 INFO L82 PathProgramCache]: Analyzing trace with hash 951809416, now seen corresponding path program 1 times [2019-11-15 22:15:03,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:03,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565806503] [2019-11-15 22:15:03,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:03,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:03,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:04,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 57 proven. 22 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-15 22:15:04,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565806503] [2019-11-15 22:15:04,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241778028] [2019-11-15 22:15:04,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:04,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:15:04,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-11-15 22:15:04,728 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 22:15:04,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2019-11-15 22:15:04,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330230727] [2019-11-15 22:15:04,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:15:04,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:04,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:15:04,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:15:04,730 INFO L87 Difference]: Start difference. First operand 3653 states and 8614 transitions. Second operand 8 states. [2019-11-15 22:15:04,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:04,917 INFO L93 Difference]: Finished difference Result 7340 states and 22297 transitions. [2019-11-15 22:15:04,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:15:04,918 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 144 [2019-11-15 22:15:04,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:04,954 INFO L225 Difference]: With dead ends: 7340 [2019-11-15 22:15:04,955 INFO L226 Difference]: Without dead ends: 3704 [2019-11-15 22:15:04,978 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 152 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:15:04,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3704 states. [2019-11-15 22:15:05,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3704 to 3663. [2019-11-15 22:15:05,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3663 states. [2019-11-15 22:15:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3663 states to 3663 states and 8630 transitions. [2019-11-15 22:15:05,156 INFO L78 Accepts]: Start accepts. Automaton has 3663 states and 8630 transitions. Word has length 144 [2019-11-15 22:15:05,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:05,157 INFO L462 AbstractCegarLoop]: Abstraction has 3663 states and 8630 transitions. [2019-11-15 22:15:05,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:15:05,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3663 states and 8630 transitions. [2019-11-15 22:15:05,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-15 22:15:05,164 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:05,164 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:15:05,368 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:05,368 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:05,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:05,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1986600125, now seen corresponding path program 1 times [2019-11-15 22:15:05,369 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:05,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686974417] [2019-11-15 22:15:05,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:05,369 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:05,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-11-15 22:15:05,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686974417] [2019-11-15 22:15:05,701 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:05,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 22:15:05,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971149676] [2019-11-15 22:15:05,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 22:15:05,702 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:05,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:15:05,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:15:05,702 INFO L87 Difference]: Start difference. First operand 3663 states and 8630 transitions. Second operand 14 states. [2019-11-15 22:15:07,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:07,227 INFO L93 Difference]: Finished difference Result 7584 states and 22901 transitions. [2019-11-15 22:15:07,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 22:15:07,227 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 145 [2019-11-15 22:15:07,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:07,271 INFO L225 Difference]: With dead ends: 7584 [2019-11-15 22:15:07,271 INFO L226 Difference]: Without dead ends: 3938 [2019-11-15 22:15:07,299 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-15 22:15:07,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2019-11-15 22:15:07,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 3881. [2019-11-15 22:15:07,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3881 states. [2019-11-15 22:15:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3881 states to 3881 states and 9273 transitions. [2019-11-15 22:15:07,760 INFO L78 Accepts]: Start accepts. Automaton has 3881 states and 9273 transitions. Word has length 145 [2019-11-15 22:15:07,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:07,762 INFO L462 AbstractCegarLoop]: Abstraction has 3881 states and 9273 transitions. [2019-11-15 22:15:07,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 22:15:07,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3881 states and 9273 transitions. [2019-11-15 22:15:07,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-15 22:15:07,771 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:07,771 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:15:07,771 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:07,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:07,771 INFO L82 PathProgramCache]: Analyzing trace with hash 2037817801, now seen corresponding path program 1 times [2019-11-15 22:15:07,772 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:07,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574116774] [2019-11-15 22:15:07,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:07,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:07,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:08,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-15 22:15:08,091 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574116774] [2019-11-15 22:15:08,091 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:08,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-15 22:15:08,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844199233] [2019-11-15 22:15:08,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 22:15:08,092 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:08,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:15:08,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:15:08,092 INFO L87 Difference]: Start difference. First operand 3881 states and 9273 transitions. Second operand 14 states. [2019-11-15 22:15:09,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:09,493 INFO L93 Difference]: Finished difference Result 7804 states and 23974 transitions. [2019-11-15 22:15:09,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 22:15:09,493 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 118 [2019-11-15 22:15:09,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:09,523 INFO L225 Difference]: With dead ends: 7804 [2019-11-15 22:15:09,523 INFO L226 Difference]: Without dead ends: 3940 [2019-11-15 22:15:09,546 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-15 22:15:09,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3940 states. [2019-11-15 22:15:09,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3940 to 3878. [2019-11-15 22:15:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3878 states. [2019-11-15 22:15:09,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3878 states to 3878 states and 9267 transitions. [2019-11-15 22:15:09,735 INFO L78 Accepts]: Start accepts. Automaton has 3878 states and 9267 transitions. Word has length 118 [2019-11-15 22:15:09,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:09,735 INFO L462 AbstractCegarLoop]: Abstraction has 3878 states and 9267 transitions. [2019-11-15 22:15:09,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 22:15:09,735 INFO L276 IsEmpty]: Start isEmpty. Operand 3878 states and 9267 transitions. [2019-11-15 22:15:09,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-15 22:15:09,739 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:09,740 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:15:09,740 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:09,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:09,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1129077862, now seen corresponding path program 1 times [2019-11-15 22:15:09,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:09,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361826174] [2019-11-15 22:15:09,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:09,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:09,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:10,003 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 69 proven. 40 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-15 22:15:10,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361826174] [2019-11-15 22:15:10,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871436894] [2019-11-15 22:15:10,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:10,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 22:15:10,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:10,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:15:10,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-15 22:15:10,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:15:10,316 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-15 22:15:10,316 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:15:10,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:15:10,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 22:15:10,320 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:11 [2019-11-15 22:15:10,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:15:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 138 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-15 22:15:10,339 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:15:10,339 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2019-11-15 22:15:10,339 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127826950] [2019-11-15 22:15:10,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:15:10,340 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:10,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:15:10,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:15:10,340 INFO L87 Difference]: Start difference. First operand 3878 states and 9267 transitions. Second operand 10 states. [2019-11-15 22:15:11,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:11,940 INFO L93 Difference]: Finished difference Result 8200 states and 26269 transitions. [2019-11-15 22:15:11,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:15:11,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 143 [2019-11-15 22:15:11,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:12,213 INFO L225 Difference]: With dead ends: 8200 [2019-11-15 22:15:12,213 INFO L226 Difference]: Without dead ends: 4339 [2019-11-15 22:15:12,231 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:15:12,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4339 states. [2019-11-15 22:15:12,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4339 to 4327. [2019-11-15 22:15:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4327 states. [2019-11-15 22:15:12,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4327 states to 4327 states and 11175 transitions. [2019-11-15 22:15:12,458 INFO L78 Accepts]: Start accepts. Automaton has 4327 states and 11175 transitions. Word has length 143 [2019-11-15 22:15:12,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:12,458 INFO L462 AbstractCegarLoop]: Abstraction has 4327 states and 11175 transitions. [2019-11-15 22:15:12,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:15:12,458 INFO L276 IsEmpty]: Start isEmpty. Operand 4327 states and 11175 transitions. [2019-11-15 22:15:12,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-15 22:15:12,462 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:12,462 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:15:12,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:12,663 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:12,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:12,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1821715986, now seen corresponding path program 1 times [2019-11-15 22:15:12,664 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:12,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114298132] [2019-11-15 22:15:12,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:12,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:12,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:12,922 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-15 22:15:12,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114298132] [2019-11-15 22:15:12,923 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:12,923 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:15:12,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368582676] [2019-11-15 22:15:12,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:15:12,924 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:12,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:15:12,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:15:12,924 INFO L87 Difference]: Start difference. First operand 4327 states and 11175 transitions. Second operand 9 states. [2019-11-15 22:15:14,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:14,282 INFO L93 Difference]: Finished difference Result 8667 states and 29306 transitions. [2019-11-15 22:15:14,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:15:14,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 141 [2019-11-15 22:15:14,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:14,319 INFO L225 Difference]: With dead ends: 8667 [2019-11-15 22:15:14,319 INFO L226 Difference]: Without dead ends: 4352 [2019-11-15 22:15:14,343 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-15 22:15:14,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4352 states. [2019-11-15 22:15:14,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4352 to 4322. [2019-11-15 22:15:14,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4322 states. [2019-11-15 22:15:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4322 states to 4322 states and 11169 transitions. [2019-11-15 22:15:14,597 INFO L78 Accepts]: Start accepts. Automaton has 4322 states and 11169 transitions. Word has length 141 [2019-11-15 22:15:14,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:14,598 INFO L462 AbstractCegarLoop]: Abstraction has 4322 states and 11169 transitions. [2019-11-15 22:15:14,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:15:14,598 INFO L276 IsEmpty]: Start isEmpty. Operand 4322 states and 11169 transitions. [2019-11-15 22:15:14,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-15 22:15:14,602 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:14,602 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:15:14,603 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:14,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:14,603 INFO L82 PathProgramCache]: Analyzing trace with hash -149270322, now seen corresponding path program 1 times [2019-11-15 22:15:14,603 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:14,603 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018656829] [2019-11-15 22:15:14,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:14,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:14,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-11-15 22:15:14,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018656829] [2019-11-15 22:15:14,953 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:14,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-15 22:15:14,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435847889] [2019-11-15 22:15:14,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 22:15:14,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:14,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 22:15:14,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:15:14,954 INFO L87 Difference]: Start difference. First operand 4322 states and 11169 transitions. Second operand 15 states. [2019-11-15 22:15:16,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:16,615 INFO L93 Difference]: Finished difference Result 8738 states and 29402 transitions. [2019-11-15 22:15:16,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 22:15:16,615 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 141 [2019-11-15 22:15:16,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:16,654 INFO L225 Difference]: With dead ends: 8738 [2019-11-15 22:15:16,655 INFO L226 Difference]: Without dead ends: 4433 [2019-11-15 22:15:16,679 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2019-11-15 22:15:16,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4433 states. [2019-11-15 22:15:16,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4433 to 4388. [2019-11-15 22:15:16,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4388 states. [2019-11-15 22:15:16,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4388 states to 4388 states and 11359 transitions. [2019-11-15 22:15:16,948 INFO L78 Accepts]: Start accepts. Automaton has 4388 states and 11359 transitions. Word has length 141 [2019-11-15 22:15:16,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:16,949 INFO L462 AbstractCegarLoop]: Abstraction has 4388 states and 11359 transitions. [2019-11-15 22:15:16,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 22:15:16,949 INFO L276 IsEmpty]: Start isEmpty. Operand 4388 states and 11359 transitions. [2019-11-15 22:15:16,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-15 22:15:16,953 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:16,953 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:15:16,953 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:16,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:16,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1636082726, now seen corresponding path program 1 times [2019-11-15 22:15:16,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:16,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631670314] [2019-11-15 22:15:16,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:16,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:16,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:17,185 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-15 22:15:17,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631670314] [2019-11-15 22:15:17,185 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:17,186 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:15:17,186 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495957759] [2019-11-15 22:15:17,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:15:17,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:17,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:15:17,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:15:17,187 INFO L87 Difference]: Start difference. First operand 4388 states and 11359 transitions. Second operand 9 states. [2019-11-15 22:15:18,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:18,478 INFO L93 Difference]: Finished difference Result 8785 states and 29791 transitions. [2019-11-15 22:15:18,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:15:18,479 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2019-11-15 22:15:18,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:18,524 INFO L225 Difference]: With dead ends: 8785 [2019-11-15 22:15:18,525 INFO L226 Difference]: Without dead ends: 4405 [2019-11-15 22:15:18,552 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:15:18,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4405 states. [2019-11-15 22:15:18,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4405 to 4379. [2019-11-15 22:15:18,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4379 states. [2019-11-15 22:15:18,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4379 states to 4379 states and 11347 transitions. [2019-11-15 22:15:18,796 INFO L78 Accepts]: Start accepts. Automaton has 4379 states and 11347 transitions. Word has length 114 [2019-11-15 22:15:18,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:18,796 INFO L462 AbstractCegarLoop]: Abstraction has 4379 states and 11347 transitions. [2019-11-15 22:15:18,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:15:18,796 INFO L276 IsEmpty]: Start isEmpty. Operand 4379 states and 11347 transitions. [2019-11-15 22:15:18,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 22:15:18,800 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:18,800 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:15:18,800 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:18,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:18,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1495999487, now seen corresponding path program 1 times [2019-11-15 22:15:18,801 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:18,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357237249] [2019-11-15 22:15:18,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:18,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:18,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:18,933 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-15 22:15:18,934 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357237249] [2019-11-15 22:15:18,934 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:18,934 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:15:18,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460054154] [2019-11-15 22:15:18,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:15:18,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:18,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:15:18,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:15:18,935 INFO L87 Difference]: Start difference. First operand 4379 states and 11347 transitions. Second operand 8 states. [2019-11-15 22:15:20,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:20,490 INFO L93 Difference]: Finished difference Result 8786 states and 29762 transitions. [2019-11-15 22:15:20,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:15:20,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2019-11-15 22:15:20,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:20,518 INFO L225 Difference]: With dead ends: 8786 [2019-11-15 22:15:20,518 INFO L226 Difference]: Without dead ends: 4419 [2019-11-15 22:15:20,539 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:15:20,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4419 states. [2019-11-15 22:15:20,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4419 to 4378. [2019-11-15 22:15:20,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4378 states. [2019-11-15 22:15:20,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4378 states to 4378 states and 11286 transitions. [2019-11-15 22:15:20,768 INFO L78 Accepts]: Start accepts. Automaton has 4378 states and 11286 transitions. Word has length 89 [2019-11-15 22:15:20,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:20,768 INFO L462 AbstractCegarLoop]: Abstraction has 4378 states and 11286 transitions. [2019-11-15 22:15:20,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:15:20,769 INFO L276 IsEmpty]: Start isEmpty. Operand 4378 states and 11286 transitions. [2019-11-15 22:15:20,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-15 22:15:20,776 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:20,777 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:15:20,777 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:20,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:20,777 INFO L82 PathProgramCache]: Analyzing trace with hash -949217830, now seen corresponding path program 1 times [2019-11-15 22:15:20,777 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:20,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446336556] [2019-11-15 22:15:20,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:20,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:20,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-15 22:15:21,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446336556] [2019-11-15 22:15:21,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:21,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-15 22:15:21,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188009101] [2019-11-15 22:15:21,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 22:15:21,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:21,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 22:15:21,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:15:21,086 INFO L87 Difference]: Start difference. First operand 4378 states and 11286 transitions. Second operand 15 states. [2019-11-15 22:15:22,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:22,780 INFO L93 Difference]: Finished difference Result 8851 states and 29645 transitions. [2019-11-15 22:15:22,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 22:15:22,781 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 110 [2019-11-15 22:15:22,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:22,818 INFO L225 Difference]: With dead ends: 8851 [2019-11-15 22:15:22,818 INFO L226 Difference]: Without dead ends: 4490 [2019-11-15 22:15:22,842 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2019-11-15 22:15:22,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2019-11-15 22:15:23,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 4434. [2019-11-15 22:15:23,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4434 states. [2019-11-15 22:15:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4434 states to 4434 states and 11390 transitions. [2019-11-15 22:15:23,079 INFO L78 Accepts]: Start accepts. Automaton has 4434 states and 11390 transitions. Word has length 110 [2019-11-15 22:15:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:23,079 INFO L462 AbstractCegarLoop]: Abstraction has 4434 states and 11390 transitions. [2019-11-15 22:15:23,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 22:15:23,079 INFO L276 IsEmpty]: Start isEmpty. Operand 4434 states and 11390 transitions. [2019-11-15 22:15:23,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-15 22:15:23,086 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:23,087 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:15:23,087 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:23,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:23,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1739291479, now seen corresponding path program 1 times [2019-11-15 22:15:23,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:23,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214512370] [2019-11-15 22:15:23,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:23,088 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:23,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:23,302 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 70 proven. 22 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-15 22:15:23,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214512370] [2019-11-15 22:15:23,302 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192507702] [2019-11-15 22:15:23,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:23,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:15:23,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-15 22:15:23,616 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:15:23,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-11-15 22:15:23,616 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372583295] [2019-11-15 22:15:23,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 22:15:23,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:23,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 22:15:23,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:15:23,617 INFO L87 Difference]: Start difference. First operand 4434 states and 11390 transitions. Second operand 11 states. [2019-11-15 22:15:25,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:25,263 INFO L93 Difference]: Finished difference Result 8893 states and 29853 transitions. [2019-11-15 22:15:25,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:15:25,263 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 150 [2019-11-15 22:15:25,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:25,299 INFO L225 Difference]: With dead ends: 8893 [2019-11-15 22:15:25,299 INFO L226 Difference]: Without dead ends: 4476 [2019-11-15 22:15:25,323 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 161 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:15:25,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4476 states. [2019-11-15 22:15:25,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4476 to 4443. [2019-11-15 22:15:25,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4443 states. [2019-11-15 22:15:25,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4443 states to 4443 states and 11281 transitions. [2019-11-15 22:15:25,580 INFO L78 Accepts]: Start accepts. Automaton has 4443 states and 11281 transitions. Word has length 150 [2019-11-15 22:15:25,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:25,580 INFO L462 AbstractCegarLoop]: Abstraction has 4443 states and 11281 transitions. [2019-11-15 22:15:25,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 22:15:25,580 INFO L276 IsEmpty]: Start isEmpty. Operand 4443 states and 11281 transitions. [2019-11-15 22:15:25,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-15 22:15:25,585 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:25,585 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 6, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:15:25,785 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:25,786 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:25,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:25,786 INFO L82 PathProgramCache]: Analyzing trace with hash 681514400, now seen corresponding path program 1 times [2019-11-15 22:15:25,786 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:25,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044445684] [2019-11-15 22:15:25,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:25,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:25,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:25,974 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 73 proven. 37 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:15:25,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044445684] [2019-11-15 22:15:25,975 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258460477] [2019-11-15 22:15:25,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:26,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:15:26,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:26,293 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 44 proven. 6 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-15 22:15:26,294 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:15:26,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-11-15 22:15:26,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558470998] [2019-11-15 22:15:26,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 22:15:26,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:26,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 22:15:26,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:15:26,295 INFO L87 Difference]: Start difference. First operand 4443 states and 11281 transitions. Second operand 12 states. [2019-11-15 22:15:28,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:28,009 INFO L93 Difference]: Finished difference Result 9269 states and 30374 transitions. [2019-11-15 22:15:28,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 22:15:28,009 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2019-11-15 22:15:28,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:28,050 INFO L225 Difference]: With dead ends: 9269 [2019-11-15 22:15:28,050 INFO L226 Difference]: Without dead ends: 4843 [2019-11-15 22:15:28,076 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2019-11-15 22:15:28,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4843 states. [2019-11-15 22:15:28,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4843 to 4828. [2019-11-15 22:15:28,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4828 states. [2019-11-15 22:15:28,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4828 states to 4828 states and 11694 transitions. [2019-11-15 22:15:28,320 INFO L78 Accepts]: Start accepts. Automaton has 4828 states and 11694 transitions. Word has length 140 [2019-11-15 22:15:28,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:28,321 INFO L462 AbstractCegarLoop]: Abstraction has 4828 states and 11694 transitions. [2019-11-15 22:15:28,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 22:15:28,321 INFO L276 IsEmpty]: Start isEmpty. Operand 4828 states and 11694 transitions. [2019-11-15 22:15:28,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-15 22:15:28,325 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:28,325 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:15:28,526 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:28,526 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:28,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:28,526 INFO L82 PathProgramCache]: Analyzing trace with hash 866146902, now seen corresponding path program 1 times [2019-11-15 22:15:28,526 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:28,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971844262] [2019-11-15 22:15:28,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:28,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:28,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:28,773 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 53 proven. 3 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-15 22:15:28,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971844262] [2019-11-15 22:15:28,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930215606] [2019-11-15 22:15:28,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:28,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 940 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 22:15:28,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:29,101 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 42 proven. 10 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-15 22:15:29,101 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:15:29,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 20 [2019-11-15 22:15:29,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938463601] [2019-11-15 22:15:29,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-15 22:15:29,103 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:29,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 22:15:29,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-11-15 22:15:29,103 INFO L87 Difference]: Start difference. First operand 4828 states and 11694 transitions. Second operand 20 states. [2019-11-15 22:15:30,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:30,883 INFO L93 Difference]: Finished difference Result 9699 states and 30491 transitions. [2019-11-15 22:15:30,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 22:15:30,883 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 143 [2019-11-15 22:15:30,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:30,919 INFO L225 Difference]: With dead ends: 9699 [2019-11-15 22:15:30,919 INFO L226 Difference]: Without dead ends: 4888 [2019-11-15 22:15:30,941 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2019-11-15 22:15:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4888 states. [2019-11-15 22:15:31,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4888 to 4824. [2019-11-15 22:15:31,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4824 states. [2019-11-15 22:15:31,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4824 states to 4824 states and 11684 transitions. [2019-11-15 22:15:31,211 INFO L78 Accepts]: Start accepts. Automaton has 4824 states and 11684 transitions. Word has length 143 [2019-11-15 22:15:31,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:31,212 INFO L462 AbstractCegarLoop]: Abstraction has 4824 states and 11684 transitions. [2019-11-15 22:15:31,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-15 22:15:31,212 INFO L276 IsEmpty]: Start isEmpty. Operand 4824 states and 11684 transitions. [2019-11-15 22:15:31,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-15 22:15:31,217 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:31,218 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:15:31,418 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:15:31,418 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:31,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:31,419 INFO L82 PathProgramCache]: Analyzing trace with hash 504276597, now seen corresponding path program 1 times [2019-11-15 22:15:31,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:31,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788914093] [2019-11-15 22:15:31,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:31,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:31,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:50,000 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (const Int) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1305) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1186) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.TermTransferrer.convertApplicationTerm(TermTransferrer.java:182) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:339) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:574) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 22:15:50,003 INFO L168 Benchmark]: Toolchain (without parser) took 102002.14 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.1 GB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -131.3 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-11-15 22:15:50,003 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:15:50,004 INFO L168 Benchmark]: CACSL2BoogieTranslator took 695.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:15:50,004 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.38 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:15:50,007 INFO L168 Benchmark]: Boogie Preprocessor took 56.09 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:15:50,007 INFO L168 Benchmark]: RCFGBuilder took 971.59 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: 70.7 MB). Peak memory consumption was 70.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:15:50,008 INFO L168 Benchmark]: TraceAbstraction took 100208.22 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -25.8 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-11-15 22:15:50,009 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 695.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -187.0 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.38 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.09 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 971.59 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: 70.7 MB). Peak memory consumption was 70.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 100208.22 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -25.8 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Undeclared function symbol (const Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Undeclared function symbol (const Int): de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 22:15:52,081 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:15:52,082 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:15:52,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:15:52,093 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:15:52,094 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:15:52,095 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:15:52,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:15:52,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:15:52,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:15:52,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:15:52,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:15:52,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:15:52,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:15:52,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:15:52,104 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:15:52,105 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:15:52,106 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:15:52,108 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:15:52,110 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:15:52,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:15:52,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:15:52,113 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:15:52,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:15:52,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:15:52,117 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:15:52,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:15:52,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:15:52,118 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:15:52,119 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:15:52,119 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:15:52,120 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:15:52,121 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:15:52,121 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:15:52,122 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:15:52,123 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:15:52,123 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:15:52,123 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:15:52,124 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:15:52,125 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:15:52,125 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:15:52,126 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 22:15:52,144 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:15:52,149 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:15:52,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:15:52,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:15:52,151 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:15:52,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:15:52,152 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:15:52,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:15:52,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:15:52,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:15:52,153 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:15:52,154 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:15:52,154 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 22:15:52,154 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 22:15:52,154 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:15:52,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:15:52,155 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:15:52,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:15:52,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:15:52,156 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:15:52,156 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:15:52,156 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:15:52,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:15:52,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:15:52,157 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:15:52,158 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:15:52,158 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 22:15:52,158 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 22:15:52,158 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:15:52,159 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 22:15:52,159 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_15442461-56c7-4246-bc5e-d695aa403c6b/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 -> 7c39ea866ecd4619e97b65a7639eefeeaf4c0097 [2019-11-15 22:15:52,206 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:15:52,217 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:15:52,219 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:15:52,220 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:15:52,220 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:15:52,221 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2019-11-15 22:15:52,276 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/data/ade102cdb/07ced072bb15469b8db3862ee6643ebd/FLAG84c3a0364 [2019-11-15 22:15:52,792 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:15:52,793 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2019-11-15 22:15:52,811 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/data/ade102cdb/07ced072bb15469b8db3862ee6643ebd/FLAG84c3a0364 [2019-11-15 22:15:53,288 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/data/ade102cdb/07ced072bb15469b8db3862ee6643ebd [2019-11-15 22:15:53,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:15:53,292 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:15:53,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:15:53,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:15:53,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:15:53,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:15:53" (1/1) ... [2019-11-15 22:15:53,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c3100ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:53, skipping insertion in model container [2019-11-15 22:15:53,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:15:53" (1/1) ... [2019-11-15 22:15:53,307 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:15:53,362 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:15:53,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:15:53,880 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:15:53,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:15:54,033 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:15:54,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:54 WrapperNode [2019-11-15 22:15:54,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:15:54,035 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:15:54,035 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:15:54,035 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:15:54,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:54" (1/1) ... [2019-11-15 22:15:54,078 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:54" (1/1) ... [2019-11-15 22:15:54,130 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:15:54,132 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:15:54,132 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:15:54,132 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:15:54,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:54" (1/1) ... [2019-11-15 22:15:54,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:54" (1/1) ... [2019-11-15 22:15:54,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:54" (1/1) ... [2019-11-15 22:15:54,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:54" (1/1) ... [2019-11-15 22:15:54,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:54" (1/1) ... [2019-11-15 22:15:54,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:54" (1/1) ... [2019-11-15 22:15:54,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:54" (1/1) ... [2019-11-15 22:15:54,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:15:54,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:15:54,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:15:54,212 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:15:54,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/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 22:15:54,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-15 22:15:54,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 22:15:54,279 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2019-11-15 22:15:54,279 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2019-11-15 22:15:54,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:15:54,280 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2019-11-15 22:15:54,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2019-11-15 22:15:54,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:15:54,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:15:54,282 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2019-11-15 22:15:54,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2019-11-15 22:15:54,283 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2019-11-15 22:15:54,283 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2019-11-15 22:15:54,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:15:54,283 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2019-11-15 22:15:54,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2019-11-15 22:15:54,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:15:54,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 22:15:54,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2019-11-15 22:15:54,284 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2019-11-15 22:15:54,285 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2019-11-15 22:15:54,285 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2019-11-15 22:15:54,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2019-11-15 22:15:54,285 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-15 22:15:54,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:15:54,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:16:05,764 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:16:05,764 INFO L284 CfgBuilder]: Removed 38 assume(true) statements. [2019-11-15 22:16:05,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:16:05 BoogieIcfgContainer [2019-11-15 22:16:05,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:16:05,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:16:05,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:16:05,768 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:16:05,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:15:53" (1/3) ... [2019-11-15 22:16:05,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320c51d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:16:05, skipping insertion in model container [2019-11-15 22:16:05,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:54" (2/3) ... [2019-11-15 22:16:05,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@320c51d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:16:05, skipping insertion in model container [2019-11-15 22:16:05,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:16:05" (3/3) ... [2019-11-15 22:16:05,771 INFO L109 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2019-11-15 22:16:05,777 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:16:05,782 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:16:05,789 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:16:05,811 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:16:05,812 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:16:05,812 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:16:05,812 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:16:05,812 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:16:05,813 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:16:05,813 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:16:05,813 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:16:05,830 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-11-15 22:16:05,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 22:16:05,836 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:16:05,837 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:16:05,839 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:16:05,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:16:05,844 INFO L82 PathProgramCache]: Analyzing trace with hash 191678913, now seen corresponding path program 1 times [2019-11-15 22:16:05,853 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:16:05,853 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [648407729] [2019-11-15 22:16:05,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:16:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:16:06,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 22:16:06,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:16:06,156 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:16:06,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:16:06,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:16:06,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:16:06,170 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-15 22:16:06,258 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 22:16:06,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:16:06,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:16:06,262 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:16:06,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 22:16:06,315 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 22:16:06,315 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:16:06,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:16:06,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:16:06,487 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 22:16:06,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [648407729] [2019-11-15 22:16:06,488 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:16:06,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-15 22:16:06,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162408089] [2019-11-15 22:16:06,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 22:16:06,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:16:06,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:16:06,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:16:06,508 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 13 states. [2019-11-15 22:16:44,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:16:44,682 INFO L93 Difference]: Finished difference Result 269 states and 399 transitions. [2019-11-15 22:16:44,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:16:44,685 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-11-15 22:16:44,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:16:44,710 INFO L225 Difference]: With dead ends: 269 [2019-11-15 22:16:44,717 INFO L226 Difference]: Without dead ends: 125 [2019-11-15 22:16:44,723 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-11-15 22:16:44,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-15 22:16:44,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-11-15 22:16:44,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-15 22:16:44,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 172 transitions. [2019-11-15 22:16:44,806 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 172 transitions. Word has length 15 [2019-11-15 22:16:44,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:16:44,807 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 172 transitions. [2019-11-15 22:16:44,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 22:16:44,807 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 172 transitions. [2019-11-15 22:16:44,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 22:16:44,818 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:16:44,819 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:16:45,033 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:16:45,033 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:16:45,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:16:45,034 INFO L82 PathProgramCache]: Analyzing trace with hash -835354618, now seen corresponding path program 1 times [2019-11-15 22:16:45,034 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:16:45,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [279835171] [2019-11-15 22:16:45,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:16:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:16:45,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 22:16:45,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:16:45,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:16:45,284 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:16:45,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:16:45,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [279835171] [2019-11-15 22:16:45,298 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:16:45,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:16:45,298 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828050556] [2019-11-15 22:16:45,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:16:45,300 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:16:45,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:16:45,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:16:45,300 INFO L87 Difference]: Start difference. First operand 124 states and 172 transitions. Second operand 4 states. [2019-11-15 22:16:45,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:16:45,332 INFO L93 Difference]: Finished difference Result 236 states and 346 transitions. [2019-11-15 22:16:45,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:16:45,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-15 22:16:45,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:16:45,335 INFO L225 Difference]: With dead ends: 236 [2019-11-15 22:16:45,335 INFO L226 Difference]: Without dead ends: 126 [2019-11-15 22:16:45,338 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:16:45,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-15 22:16:45,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-11-15 22:16:45,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-15 22:16:45,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 171 transitions. [2019-11-15 22:16:45,353 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 171 transitions. Word has length 27 [2019-11-15 22:16:45,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:16:45,354 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 171 transitions. [2019-11-15 22:16:45,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:16:45,354 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 171 transitions. [2019-11-15 22:16:45,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 22:16:45,356 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:16:45,357 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:16:45,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:16:45,562 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:16:45,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:16:45,562 INFO L82 PathProgramCache]: Analyzing trace with hash 313595982, now seen corresponding path program 1 times [2019-11-15 22:16:45,563 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:16:45,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1714630890] [2019-11-15 22:16:45,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:16:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:16:45,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 22:16:45,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:16:45,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 22:16:45,824 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:16:45,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:16:45,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:16:45,831 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-15 22:16:45,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 22:16:45,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:16:45,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:16:45,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:16:45,936 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-15 22:16:45,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:16:45,969 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:16:45,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:16:45,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:16:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:16:46,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1714630890] [2019-11-15 22:16:46,120 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:16:46,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 14 [2019-11-15 22:16:46,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176915576] [2019-11-15 22:16:46,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 22:16:46,120 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:16:46,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:16:46,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:16:46,121 INFO L87 Difference]: Start difference. First operand 124 states and 171 transitions. Second operand 14 states. [2019-11-15 22:17:22,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:17:22,851 INFO L93 Difference]: Finished difference Result 276 states and 409 transitions. [2019-11-15 22:17:22,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:17:22,852 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-11-15 22:17:22,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:17:22,855 INFO L225 Difference]: With dead ends: 276 [2019-11-15 22:17:22,855 INFO L226 Difference]: Without dead ends: 166 [2019-11-15 22:17:22,857 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-11-15 22:17:22,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-15 22:17:22,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2019-11-15 22:17:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-15 22:17:22,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 213 transitions. [2019-11-15 22:17:22,878 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 213 transitions. Word has length 28 [2019-11-15 22:17:22,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:17:22,878 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 213 transitions. [2019-11-15 22:17:22,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 22:17:22,881 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 213 transitions. [2019-11-15 22:17:22,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 22:17:22,885 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:17:22,885 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:17:23,087 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:17:23,087 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:17:23,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:17:23,087 INFO L82 PathProgramCache]: Analyzing trace with hash 571761420, now seen corresponding path program 1 times [2019-11-15 22:17:23,088 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:17:23,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1351351042] [2019-11-15 22:17:23,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_15442461-56c7-4246-bc5e-d695aa403c6b/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:17:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:17:23,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 59 conjunts are in the unsatisfiable core [2019-11-15 22:17:23,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:17:23,483 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-15 22:17:23,484 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 22:17:23,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:17:23,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:17:23,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:17:23,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:21 [2019-11-15 22:17:23,550 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_140|, |v_#memory_$Pointer$.offset_140|, |v_#memory_int_135|], 2=[|v_#memory_$Pointer$.offset_137|, |v_#memory_$Pointer$.offset_139|, |v_#memory_$Pointer$.base_139|, |v_#memory_$Pointer$.base_137|, |v_#memory_$Pointer$.base_136|, |v_#memory_$Pointer$.offset_136|], 6=[|v_#memory_$Pointer$.offset_138|, |v_#memory_$Pointer$.base_138|]} [2019-11-15 22:17:25,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:17:28,102 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= |ULTIMATE.start_user_initialize_#t~malloc80.base| (select (select |v_#memory_$Pointer$.base_138| ~user~0.base) (bvadd ~user~0.offset (_ bv16 32)))) [2019-11-15 22:17:28,103 INFO L235 Elim1Store]: Index analysis took 2978 ms [2019-11-15 22:17:32,974 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |v_#memory_$Pointer$.base_138| ~user~0.base))) (= (select .cse0 (bvadd ~user~0.offset (_ bv12 32))) (select .cse0 (bvadd ~user~0.offset (_ bv16 32))))) [2019-11-15 22:17:34,978 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |v_#memory_$Pointer$.base_138| ~user~0.base))) (= (select .cse0 (bvadd ~user~0.offset (_ bv12 32))) (select .cse0 (bvadd ~user~0.offset (_ bv16 32))))) [2019-11-15 22:17:34,980 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 24 treesize of output 9 [2019-11-15 22:17:34,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:18:23,338 WARN L191 SmtUtils]: Spent 48.36 s on a formula simplification that was a NOOP. DAG size: 108 [2019-11-15 22:18:23,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:18:27,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:18:29,627 INFO L235 Elim1Store]: Index analysis took 3944 ms [2019-11-15 22:18:33,756 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |v_#memory_$Pointer$.offset_138| ~user~0.base))) (= (select .cse0 (bvadd ~user~0.offset (_ bv16 32))) (select .cse0 (bvadd ~user~0.offset (_ bv12 32))))) [2019-11-15 22:18:35,759 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 24 treesize of output 9 [2019-11-15 22:18:35,760 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:13,908 WARN L191 SmtUtils]: Spent 38.15 s on a formula simplification that was a NOOP. DAG size: 102 [2019-11-15 22:19:13,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:14,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:14,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:14,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:15,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:15,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:15,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:15,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:15,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:16,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:16,028 INFO L235 Elim1Store]: Index analysis took 1477 ms [2019-11-15 22:19:16,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 56 [2019-11-15 22:19:16,031 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:19:29,218 WARN L191 SmtUtils]: Spent 13.19 s on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-11-15 22:19:29,218 INFO L567 ElimStorePlain]: treesize reduction 4, result has 98.7 percent of original size [2019-11-15 22:19:29,244 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 22:19:37,020 WARN L191 SmtUtils]: Spent 7.78 s on a formula simplification that was a NOOP. DAG size: 96 [2019-11-15 22:19:37,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:37,055 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:19:42,841 WARN L191 SmtUtils]: Spent 5.78 s on a formula simplification that was a NOOP. DAG size: 92 [2019-11-15 22:19:42,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:42,939 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:19:47,201 WARN L191 SmtUtils]: Spent 4.26 s on a formula simplification that was a NOOP. DAG size: 88 [2019-11-15 22:19:47,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:47,242 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 22:19:51,366 WARN L191 SmtUtils]: Spent 4.12 s on a formula simplification that was a NOOP. DAG size: 85 [2019-11-15 22:19:51,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:51,394 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:19:54,377 WARN L191 SmtUtils]: Spent 2.98 s on a formula simplification that was a NOOP. DAG size: 81 [2019-11-15 22:19:54,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:54,389 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:19:55,832 WARN L191 SmtUtils]: Spent 1.44 s on a formula simplification that was a NOOP. DAG size: 77 [2019-11-15 22:19:55,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:19:55,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:55,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:55,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:55,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:55,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:19:55,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:12,238 WARN L191 SmtUtils]: Spent 16.38 s on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-11-15 22:20:12,238 INFO L341 Elim1Store]: treesize reduction 71, result has 71.4 percent of original size [2019-11-15 22:20:12,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 197 treesize of output 287 [2019-11-15 22:20:12,240 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-15 22:20:12,643 WARN L191 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-11-15 22:20:12,644 INFO L567 ElimStorePlain]: treesize reduction 154, result has 53.5 percent of original size [2019-11-15 22:20:12,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:12,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:12,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:12,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:12,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:12,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:12,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:12,660 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:20:12,674 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:12,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 69 [2019-11-15 22:20:12,676 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-15 22:20:12,837 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-15 22:20:12,837 INFO L567 ElimStorePlain]: treesize reduction 16, result has 88.3 percent of original size [2019-11-15 22:20:12,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 11 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:20:12,838 INFO L221 ElimStorePlain]: Needed 12 recursive calls to eliminate 12 variables, input treesize:389, output treesize:80 [2019-11-15 22:20:12,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:13,019 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:13,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2019-11-15 22:20:13,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:20:13,164 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-15 22:20:13,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:13,165 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_141|, |v_#memory_$Pointer$.offset_141|], 30=[|v_#memory_int_136|]} [2019-11-15 22:20:13,173 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 39 treesize of output 21 [2019-11-15 22:20:13,173 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:20:13,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:13,253 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 22:20:13,254 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:20:13,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:13,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:13,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:13,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:13,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:13,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:13,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:13,323 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:20:13,341 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:13,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 86 [2019-11-15 22:20:13,343 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 22:20:13,408 INFO L567 ElimStorePlain]: treesize reduction 14, result has 85.4 percent of original size [2019-11-15 22:20:13,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:20:13,409 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:131, output treesize:82 [2019-11-15 22:20:13,894 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_142|, |v_#memory_$Pointer$.base_142|], 40=[|v_#memory_int_137|]} [2019-11-15 22:20:13,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:13,913 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 25 treesize of output 13 [2019-11-15 22:20:13,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:20:14,056 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-15 22:20:14,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:14,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:14,068 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 39 treesize of output 21 [2019-11-15 22:20:14,069 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:20:14,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:14,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:14,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:14,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:14,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:14,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:14,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 22:20:14,153 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:20:14,203 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:14,204 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 70 treesize of output 115 [2019-11-15 22:20:14,205 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:20:14,313 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-11-15 22:20:14,313 INFO L567 ElimStorePlain]: treesize reduction 44, result has 65.4 percent of original size [2019-11-15 22:20:14,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:20:14,314 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:122, output treesize:76 [2019-11-15 22:20:14,445 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 11=[|#memory_int|]} [2019-11-15 22:20:14,453 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2019-11-15 22:20:14,454 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 22:20:14,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:14,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-15 22:20:14,524 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:20:14,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:14,578 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:14,578 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 29 [2019-11-15 22:20:14,579 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 22:20:14,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:14,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 22:20:14,594 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:78, output treesize:3 [2019-11-15 22:20:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:20:14,654 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:20:14,718 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 22:20:14,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:14,736 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:20:14,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:14,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 22:20:14,746 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:35 [2019-11-15 22:20:15,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:20:15,240 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 22:20:15,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:15,310 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:20:15,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:15,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-15 22:20:15,352 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:106, output treesize:90 [2019-11-15 22:20:17,529 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 2=[|v_#memory_$Pointer$.offset_137|, |v_#memory_$Pointer$.offset_139|, |v_#memory_$Pointer$.base_139|, |v_#memory_$Pointer$.base_137|, |v_#memory_$Pointer$.base_136|, |v_#memory_$Pointer$.base_146|, |v_#memory_$Pointer$.offset_146|, |v_#memory_$Pointer$.offset_136|], 6=[|v_#memory_$Pointer$.offset_138|, |v_#memory_$Pointer$.base_138|], 15=[|v_#memory_int_135|]} [2019-11-15 22:20:18,366 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:20:18,577 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:18,578 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 25 treesize of output 10 [2019-11-15 22:20:18,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 22:20:22,921 WARN L191 SmtUtils]: Spent 4.34 s on a formula simplification that was a NOOP. DAG size: 143 [2019-11-15 22:20:22,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:23,178 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:20:23,360 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:23,360 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 25 treesize of output 10 [2019-11-15 22:20:23,360 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 22:20:32,428 WARN L191 SmtUtils]: Spent 9.07 s on a formula simplification that was a NOOP. DAG size: 137 [2019-11-15 22:20:32,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:32,478 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 22:20:38,049 WARN L191 SmtUtils]: Spent 5.57 s on a formula simplification that was a NOOP. DAG size: 133 [2019-11-15 22:20:38,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:38,704 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 22:20:45,671 WARN L191 SmtUtils]: Spent 6.97 s on a formula simplification that was a NOOP. DAG size: 128 [2019-11-15 22:20:45,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:45,745 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:20:50,227 WARN L191 SmtUtils]: Spent 4.48 s on a formula simplification that was a NOOP. DAG size: 123 [2019-11-15 22:20:50,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:50,278 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:20:54,804 WARN L191 SmtUtils]: Spent 4.53 s on a formula simplification that was a NOOP. DAG size: 119 [2019-11-15 22:20:54,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:20:54,876 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 22:20:59,903 WARN L191 SmtUtils]: Spent 5.03 s on a formula simplification that was a NOOP. DAG size: 114 [2019-11-15 22:20:59,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:00,045 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:21:01,080 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 110 [2019-11-15 22:21:01,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:01,107 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:21:02,170 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 106 [2019-11-15 22:21:02,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:02,190 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 22:21:02,883 WARN L191 SmtUtils]: Spent 693.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-15 22:21:02,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:02,897 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:21:02,901 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:21:02,902 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:21:02,906 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:21:02,907 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:21:02,908 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:21:43,869 WARN L191 SmtUtils]: Spent 40.94 s on a formula simplification. DAG size of input: 108 DAG size of output: 87 [2019-11-15 22:21:43,869 INFO L341 Elim1Store]: treesize reduction 228, result has 54.9 percent of original size [2019-11-15 22:21:43,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 1074 treesize of output 1098 [2019-11-15 22:21:43,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:43,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:43,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:43,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:43,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:43,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:43,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:43,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:43,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,114 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 22:21:44,114 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 892 treesize of output 892 [2019-11-15 22:21:44,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-15 22:21:44,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 22:21:44,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 22:21:44,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:21:44,927 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:21:44,929 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:21:44,933 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:21:44,933 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:21:44,934 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:21:44,934 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 22:21:44,936 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_34, v_arrayElimCell_33], 1=[v_arrayElimCell_32]} [2019-11-15 22:21:45,168 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:21:45,169 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 22:21:45,172 INFO L168 Benchmark]: Toolchain (without parser) took 351880.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.0 MB). Free memory was 945.6 MB in the beginning and 911.1 MB in the end (delta: 34.6 MB). Peak memory consumption was 342.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:21:45,173 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:21:45,173 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -133.3 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:21:45,173 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.04 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:21:45,174 INFO L168 Benchmark]: Boogie Preprocessor took 79.80 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 22:21:45,174 INFO L168 Benchmark]: RCFGBuilder took 11553.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.8 MB in the end (delta: 79.5 MB). Peak memory consumption was 79.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:21:45,174 INFO L168 Benchmark]: TraceAbstraction took 339405.40 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 91.2 MB). Free memory was 992.8 MB in the beginning and 911.1 MB in the end (delta: 81.7 MB). Peak memory consumption was 264.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:21:45,176 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 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 740.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -133.3 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 97.04 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 79.80 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 11553.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.8 MB in the end (delta: 79.5 MB). Peak memory consumption was 79.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 339405.40 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 91.2 MB). Free memory was 992.8 MB in the beginning and 911.1 MB in the end (delta: 81.7 MB). Peak memory consumption was 264.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...