./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/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 62062b34b4a23d127db54f6c179288673b97bcab ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/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 62062b34b4a23d127db54f6c179288673b97bcab ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 02:40:39,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 02:40:39,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 02:40:39,782 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 02:40:39,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 02:40:39,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 02:40:39,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 02:40:39,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 02:40:39,798 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 02:40:39,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 02:40:39,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 02:40:39,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 02:40:39,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 02:40:39,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 02:40:39,807 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 02:40:39,808 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 02:40:39,809 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 02:40:39,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 02:40:39,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 02:40:39,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 02:40:39,819 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 02:40:39,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 02:40:39,823 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 02:40:39,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 02:40:39,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 02:40:39,827 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 02:40:39,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 02:40:39,828 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 02:40:39,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 02:40:39,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 02:40:39,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 02:40:39,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 02:40:39,831 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 02:40:39,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 02:40:39,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 02:40:39,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 02:40:39,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 02:40:39,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 02:40:39,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 02:40:39,834 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 02:40:39,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 02:40:39,836 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 02:40:39,859 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 02:40:39,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 02:40:39,870 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 02:40:39,870 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 02:40:39,870 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 02:40:39,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 02:40:39,871 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 02:40:39,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 02:40:39,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 02:40:39,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 02:40:39,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 02:40:39,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 02:40:39,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 02:40:39,872 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 02:40:39,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 02:40:39,873 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 02:40:39,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 02:40:39,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 02:40:39,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 02:40:39,874 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 02:40:39,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 02:40:39,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:40:39,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 02:40:39,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 02:40:39,875 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 02:40:39,875 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 02:40:39,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 02:40:39,876 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 02:40:39,876 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_602bad8f-be23-45b6-95aa-520e49b0e166/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 -> 62062b34b4a23d127db54f6c179288673b97bcab [2019-11-20 02:40:40,031 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 02:40:40,045 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 02:40:40,048 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 02:40:40,049 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 02:40:40,049 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 02:40:40,051 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-2.c [2019-11-20 02:40:40,114 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/data/bdaad63f6/cca16affea214aad85c0cc73b7d58412/FLAGbf24502fb [2019-11-20 02:40:40,648 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 02:40:40,649 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-2.c [2019-11-20 02:40:40,681 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/data/bdaad63f6/cca16affea214aad85c0cc73b7d58412/FLAGbf24502fb [2019-11-20 02:40:41,120 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/data/bdaad63f6/cca16affea214aad85c0cc73b7d58412 [2019-11-20 02:40:41,122 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 02:40:41,123 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 02:40:41,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 02:40:41,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 02:40:41,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 02:40:41,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:40:41" (1/1) ... [2019-11-20 02:40:41,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ed0a0f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:41, skipping insertion in model container [2019-11-20 02:40:41,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:40:41" (1/1) ... [2019-11-20 02:40:41,137 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 02:40:41,192 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 02:40:41,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:40:41,640 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 02:40:41,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:40:41,828 INFO L192 MainTranslator]: Completed translation [2019-11-20 02:40:41,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:41 WrapperNode [2019-11-20 02:40:41,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 02:40:41,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 02:40:41,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 02:40:41,830 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 02:40:41,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:41" (1/1) ... [2019-11-20 02:40:41,858 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:41" (1/1) ... [2019-11-20 02:40:41,904 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 02:40:41,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 02:40:41,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 02:40:41,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 02:40:41,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:41" (1/1) ... [2019-11-20 02:40:41,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:41" (1/1) ... [2019-11-20 02:40:41,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:41" (1/1) ... [2019-11-20 02:40:41,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:41" (1/1) ... [2019-11-20 02:40:41,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:41" (1/1) ... [2019-11-20 02:40:41,984 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:41" (1/1) ... [2019-11-20 02:40:41,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:41" (1/1) ... [2019-11-20 02:40:41,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 02:40:42,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 02:40:42,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 02:40:42,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 02:40:42,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/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-20 02:40:42,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 02:40:42,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 02:40:42,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 02:40:42,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 02:40:42,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 02:40:42,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 02:40:42,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 02:40:42,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 02:40:42,374 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:40:43,300 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 02:40:43,300 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 02:40:43,302 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 02:40:43,304 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 02:40:43,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:40:43 BoogieIcfgContainer [2019-11-20 02:40:43,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 02:40:43,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 02:40:43,308 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 02:40:43,311 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 02:40:43,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:40:41" (1/3) ... [2019-11-20 02:40:43,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b34520c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:40:43, skipping insertion in model container [2019-11-20 02:40:43,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:41" (2/3) ... [2019-11-20 02:40:43,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b34520c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:40:43, skipping insertion in model container [2019-11-20 02:40:43,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:40:43" (3/3) ... [2019-11-20 02:40:43,314 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-2.c [2019-11-20 02:40:43,325 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 02:40:43,332 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 02:40:43,342 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 02:40:43,365 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 02:40:43,365 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 02:40:43,365 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 02:40:43,365 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 02:40:43,365 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 02:40:43,366 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 02:40:43,366 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 02:40:43,366 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 02:40:43,388 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-20 02:40:43,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 02:40:43,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:43,401 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:40:43,401 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:43,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:43,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756973, now seen corresponding path program 1 times [2019-11-20 02:40:43,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:43,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076870992] [2019-11-20 02:40:43,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:43,699 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-20 02:40:43,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076870992] [2019-11-20 02:40:43,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:43,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:43,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400623303] [2019-11-20 02:40:43,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:43,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:43,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:43,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:43,720 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-20 02:40:44,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:44,259 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2019-11-20 02:40:44,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:44,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-20 02:40:44,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:44,284 INFO L225 Difference]: With dead ends: 323 [2019-11-20 02:40:44,285 INFO L226 Difference]: Without dead ends: 163 [2019-11-20 02:40:44,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:44,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-20 02:40:44,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-20 02:40:44,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 02:40:44,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2019-11-20 02:40:44,361 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2019-11-20 02:40:44,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:44,362 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2019-11-20 02:40:44,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:44,362 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2019-11-20 02:40:44,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-20 02:40:44,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:44,367 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 02:40:44,367 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:44,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:44,367 INFO L82 PathProgramCache]: Analyzing trace with hash 972749596, now seen corresponding path program 1 times [2019-11-20 02:40:44,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:44,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471749988] [2019-11-20 02:40:44,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:44,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:40:44,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471749988] [2019-11-20 02:40:44,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:44,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:44,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404469996] [2019-11-20 02:40:44,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:44,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:44,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:44,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:44,517 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2019-11-20 02:40:44,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:44,923 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2019-11-20 02:40:44,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:44,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-20 02:40:44,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:44,926 INFO L225 Difference]: With dead ends: 290 [2019-11-20 02:40:44,926 INFO L226 Difference]: Without dead ends: 163 [2019-11-20 02:40:44,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:44,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-20 02:40:44,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-20 02:40:44,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 02:40:44,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2019-11-20 02:40:44,948 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2019-11-20 02:40:44,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:44,949 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2019-11-20 02:40:44,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:44,949 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2019-11-20 02:40:44,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 02:40:44,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:44,957 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:40:44,958 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:44,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:44,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1295428526, now seen corresponding path program 1 times [2019-11-20 02:40:44,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:44,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141652231] [2019-11-20 02:40:44,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:45,081 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-20 02:40:45,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141652231] [2019-11-20 02:40:45,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:45,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:45,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116523398] [2019-11-20 02:40:45,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:45,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:45,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:45,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:45,089 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2019-11-20 02:40:45,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:45,413 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2019-11-20 02:40:45,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:45,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-20 02:40:45,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:45,416 INFO L225 Difference]: With dead ends: 289 [2019-11-20 02:40:45,416 INFO L226 Difference]: Without dead ends: 162 [2019-11-20 02:40:45,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:45,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-20 02:40:45,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2019-11-20 02:40:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 02:40:45,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2019-11-20 02:40:45,429 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2019-11-20 02:40:45,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:45,430 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2019-11-20 02:40:45,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:45,430 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2019-11-20 02:40:45,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 02:40:45,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:45,432 INFO L410 BasicCegarLoop]: trace histogram [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-20 02:40:45,432 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:45,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:45,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1231677145, now seen corresponding path program 1 times [2019-11-20 02:40:45,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:45,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133207712] [2019-11-20 02:40:45,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:45,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:40:45,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133207712] [2019-11-20 02:40:45,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:45,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:45,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453998064] [2019-11-20 02:40:45,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:45,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:45,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:45,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:45,536 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2019-11-20 02:40:45,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:45,869 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2019-11-20 02:40:45,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:45,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-20 02:40:45,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:45,871 INFO L225 Difference]: With dead ends: 287 [2019-11-20 02:40:45,871 INFO L226 Difference]: Without dead ends: 160 [2019-11-20 02:40:45,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:45,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-20 02:40:45,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2019-11-20 02:40:45,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 02:40:45,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2019-11-20 02:40:45,880 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2019-11-20 02:40:45,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:45,881 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2019-11-20 02:40:45,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:45,881 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2019-11-20 02:40:45,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 02:40:45,882 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:45,882 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 02:40:45,882 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:45,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:45,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1771822617, now seen corresponding path program 1 times [2019-11-20 02:40:45,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:45,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357114985] [2019-11-20 02:40:45,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:40:45,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357114985] [2019-11-20 02:40:45,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:45,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:45,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672291535] [2019-11-20 02:40:45,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:45,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:45,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:45,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:45,961 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2019-11-20 02:40:46,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:46,259 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2019-11-20 02:40:46,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:46,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-20 02:40:46,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:46,261 INFO L225 Difference]: With dead ends: 286 [2019-11-20 02:40:46,261 INFO L226 Difference]: Without dead ends: 159 [2019-11-20 02:40:46,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:46,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-20 02:40:46,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-20 02:40:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 02:40:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2019-11-20 02:40:46,268 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2019-11-20 02:40:46,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:46,268 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2019-11-20 02:40:46,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:46,269 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2019-11-20 02:40:46,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 02:40:46,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:46,274 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:40:46,274 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:46,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:46,275 INFO L82 PathProgramCache]: Analyzing trace with hash -2133959614, now seen corresponding path program 1 times [2019-11-20 02:40:46,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:46,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780773425] [2019-11-20 02:40:46,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:46,360 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-20 02:40:46,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780773425] [2019-11-20 02:40:46,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:46,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:46,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105226063] [2019-11-20 02:40:46,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:46,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:46,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:46,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:46,364 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2019-11-20 02:40:46,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:46,658 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-11-20 02:40:46,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:46,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-20 02:40:46,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:46,660 INFO L225 Difference]: With dead ends: 286 [2019-11-20 02:40:46,660 INFO L226 Difference]: Without dead ends: 159 [2019-11-20 02:40:46,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:46,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-20 02:40:46,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-20 02:40:46,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 02:40:46,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2019-11-20 02:40:46,674 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2019-11-20 02:40:46,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:46,677 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2019-11-20 02:40:46,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:46,677 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2019-11-20 02:40:46,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-20 02:40:46,678 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:46,678 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:40:46,679 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:46,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:46,679 INFO L82 PathProgramCache]: Analyzing trace with hash -824123675, now seen corresponding path program 1 times [2019-11-20 02:40:46,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:46,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663901125] [2019-11-20 02:40:46,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:46,744 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-20 02:40:46,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663901125] [2019-11-20 02:40:46,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:46,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:46,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445942771] [2019-11-20 02:40:46,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:46,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:46,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:46,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:46,750 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2019-11-20 02:40:47,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:47,035 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2019-11-20 02:40:47,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:47,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-20 02:40:47,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:47,037 INFO L225 Difference]: With dead ends: 286 [2019-11-20 02:40:47,037 INFO L226 Difference]: Without dead ends: 159 [2019-11-20 02:40:47,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-20 02:40:47,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-20 02:40:47,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 02:40:47,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2019-11-20 02:40:47,043 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2019-11-20 02:40:47,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:47,043 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2019-11-20 02:40:47,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:47,043 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2019-11-20 02:40:47,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-20 02:40:47,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:47,044 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:40:47,044 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:47,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:47,044 INFO L82 PathProgramCache]: Analyzing trace with hash 807634151, now seen corresponding path program 1 times [2019-11-20 02:40:47,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:47,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545326061] [2019-11-20 02:40:47,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:47,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:40:47,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545326061] [2019-11-20 02:40:47,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:47,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:47,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135704360] [2019-11-20 02:40:47,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:47,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:47,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:47,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:47,121 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2019-11-20 02:40:47,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:47,404 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2019-11-20 02:40:47,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:47,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-20 02:40:47,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:47,406 INFO L225 Difference]: With dead ends: 286 [2019-11-20 02:40:47,406 INFO L226 Difference]: Without dead ends: 159 [2019-11-20 02:40:47,407 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:47,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-20 02:40:47,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-20 02:40:47,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 02:40:47,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2019-11-20 02:40:47,411 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2019-11-20 02:40:47,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:47,412 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2019-11-20 02:40:47,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:47,412 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2019-11-20 02:40:47,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-20 02:40:47,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:47,413 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:40:47,414 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:47,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:47,414 INFO L82 PathProgramCache]: Analyzing trace with hash -465931414, now seen corresponding path program 1 times [2019-11-20 02:40:47,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:47,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940783062] [2019-11-20 02:40:47,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:47,460 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:40:47,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940783062] [2019-11-20 02:40:47,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:47,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:47,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601293870] [2019-11-20 02:40:47,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:47,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:47,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:47,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:47,462 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2019-11-20 02:40:47,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:47,710 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2019-11-20 02:40:47,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:47,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-20 02:40:47,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:47,712 INFO L225 Difference]: With dead ends: 276 [2019-11-20 02:40:47,712 INFO L226 Difference]: Without dead ends: 149 [2019-11-20 02:40:47,713 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:47,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-20 02:40:47,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-11-20 02:40:47,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 02:40:47,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2019-11-20 02:40:47,717 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2019-11-20 02:40:47,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:47,717 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2019-11-20 02:40:47,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:47,717 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2019-11-20 02:40:47,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-20 02:40:47,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:47,718 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 02:40:47,718 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:47,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:47,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1405490990, now seen corresponding path program 1 times [2019-11-20 02:40:47,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:47,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597708759] [2019-11-20 02:40:47,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:47,768 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:40:47,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597708759] [2019-11-20 02:40:47,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:47,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:47,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137315530] [2019-11-20 02:40:47,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:47,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:47,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:47,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:47,772 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2019-11-20 02:40:48,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:48,094 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2019-11-20 02:40:48,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:48,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-20 02:40:48,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:48,097 INFO L225 Difference]: With dead ends: 316 [2019-11-20 02:40:48,097 INFO L226 Difference]: Without dead ends: 189 [2019-11-20 02:40:48,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:48,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-20 02:40:48,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-20 02:40:48,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 02:40:48,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2019-11-20 02:40:48,107 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2019-11-20 02:40:48,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:48,109 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2019-11-20 02:40:48,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:48,109 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2019-11-20 02:40:48,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-20 02:40:48,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:48,111 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-11-20 02:40:48,111 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:48,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:48,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1761497597, now seen corresponding path program 1 times [2019-11-20 02:40:48,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:48,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442683881] [2019-11-20 02:40:48,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:48,182 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:40:48,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442683881] [2019-11-20 02:40:48,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:48,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:48,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606053794] [2019-11-20 02:40:48,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:48,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:48,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:48,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:48,184 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2019-11-20 02:40:48,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:48,545 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2019-11-20 02:40:48,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:48,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-20 02:40:48,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:48,547 INFO L225 Difference]: With dead ends: 338 [2019-11-20 02:40:48,547 INFO L226 Difference]: Without dead ends: 189 [2019-11-20 02:40:48,548 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:48,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-20 02:40:48,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-20 02:40:48,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 02:40:48,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2019-11-20 02:40:48,554 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2019-11-20 02:40:48,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:48,554 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2019-11-20 02:40:48,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:48,555 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2019-11-20 02:40:48,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 02:40:48,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:48,556 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 02:40:48,556 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:48,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:48,556 INFO L82 PathProgramCache]: Analyzing trace with hash -23187219, now seen corresponding path program 1 times [2019-11-20 02:40:48,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:48,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959979329] [2019-11-20 02:40:48,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:48,622 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:40:48,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959979329] [2019-11-20 02:40:48,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:48,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:48,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968672505] [2019-11-20 02:40:48,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:48,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:48,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:48,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:48,624 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2019-11-20 02:40:48,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:48,930 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2019-11-20 02:40:48,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:48,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-20 02:40:48,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:48,932 INFO L225 Difference]: With dead ends: 337 [2019-11-20 02:40:48,932 INFO L226 Difference]: Without dead ends: 188 [2019-11-20 02:40:48,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:48,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-20 02:40:48,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2019-11-20 02:40:48,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 02:40:48,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2019-11-20 02:40:48,938 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2019-11-20 02:40:48,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:48,938 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2019-11-20 02:40:48,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:48,938 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2019-11-20 02:40:48,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 02:40:48,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:48,939 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:40:48,939 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:48,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:48,939 INFO L82 PathProgramCache]: Analyzing trace with hash -86938600, now seen corresponding path program 1 times [2019-11-20 02:40:48,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:48,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52790873] [2019-11-20 02:40:48,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:40:48,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52790873] [2019-11-20 02:40:48,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:48,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:48,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215147819] [2019-11-20 02:40:48,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:48,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:48,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:48,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:48,983 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2019-11-20 02:40:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:49,347 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2019-11-20 02:40:49,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:49,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-20 02:40:49,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:49,349 INFO L225 Difference]: With dead ends: 335 [2019-11-20 02:40:49,349 INFO L226 Difference]: Without dead ends: 186 [2019-11-20 02:40:49,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:49,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-20 02:40:49,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2019-11-20 02:40:49,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 02:40:49,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2019-11-20 02:40:49,355 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2019-11-20 02:40:49,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:49,355 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2019-11-20 02:40:49,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:49,355 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2019-11-20 02:40:49,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 02:40:49,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:49,356 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:40:49,356 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:49,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:49,357 INFO L82 PathProgramCache]: Analyzing trace with hash 453206872, now seen corresponding path program 1 times [2019-11-20 02:40:49,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:49,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557459015] [2019-11-20 02:40:49,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:49,398 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:40:49,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557459015] [2019-11-20 02:40:49,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:49,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:49,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419509741] [2019-11-20 02:40:49,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:49,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:49,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:49,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:49,400 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2019-11-20 02:40:49,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:49,749 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2019-11-20 02:40:49,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:49,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-20 02:40:49,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:49,751 INFO L225 Difference]: With dead ends: 334 [2019-11-20 02:40:49,751 INFO L226 Difference]: Without dead ends: 185 [2019-11-20 02:40:49,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:49,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-20 02:40:49,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-20 02:40:49,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 02:40:49,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2019-11-20 02:40:49,756 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2019-11-20 02:40:49,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:49,757 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2019-11-20 02:40:49,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:49,757 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2019-11-20 02:40:49,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 02:40:49,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:49,758 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 02:40:49,758 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:49,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:49,758 INFO L82 PathProgramCache]: Analyzing trace with hash 842391937, now seen corresponding path program 1 times [2019-11-20 02:40:49,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:49,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888776370] [2019-11-20 02:40:49,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:49,811 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:40:49,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888776370] [2019-11-20 02:40:49,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:49,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:49,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853497487] [2019-11-20 02:40:49,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:49,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:49,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:49,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:49,813 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2019-11-20 02:40:50,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:50,135 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2019-11-20 02:40:50,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:50,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-20 02:40:50,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:50,137 INFO L225 Difference]: With dead ends: 334 [2019-11-20 02:40:50,137 INFO L226 Difference]: Without dead ends: 185 [2019-11-20 02:40:50,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:50,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-20 02:40:50,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-20 02:40:50,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 02:40:50,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2019-11-20 02:40:50,142 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2019-11-20 02:40:50,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:50,143 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-11-20 02:40:50,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:50,143 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2019-11-20 02:40:50,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-20 02:40:50,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:50,143 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-20 02:40:50,144 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:50,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:50,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1248461190, now seen corresponding path program 1 times [2019-11-20 02:40:50,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:50,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761755955] [2019-11-20 02:40:50,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:50,190 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:40:50,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761755955] [2019-11-20 02:40:50,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:50,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:50,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272732505] [2019-11-20 02:40:50,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:50,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:50,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:50,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:50,194 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2019-11-20 02:40:50,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:50,489 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2019-11-20 02:40:50,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:50,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-20 02:40:50,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:50,491 INFO L225 Difference]: With dead ends: 334 [2019-11-20 02:40:50,491 INFO L226 Difference]: Without dead ends: 185 [2019-11-20 02:40:50,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:50,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-20 02:40:50,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-20 02:40:50,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 02:40:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-11-20 02:40:50,496 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2019-11-20 02:40:50,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:50,496 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-11-20 02:40:50,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:50,501 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2019-11-20 02:40:50,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-20 02:40:50,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:50,502 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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-20 02:40:50,502 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:50,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:50,503 INFO L82 PathProgramCache]: Analyzing trace with hash 633255526, now seen corresponding path program 1 times [2019-11-20 02:40:50,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:50,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321173508] [2019-11-20 02:40:50,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:40:50,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321173508] [2019-11-20 02:40:50,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:50,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:50,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933154890] [2019-11-20 02:40:50,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:50,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:50,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:50,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:50,555 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2019-11-20 02:40:50,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:50,910 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2019-11-20 02:40:50,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:50,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-20 02:40:50,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:50,912 INFO L225 Difference]: With dead ends: 334 [2019-11-20 02:40:50,912 INFO L226 Difference]: Without dead ends: 185 [2019-11-20 02:40:50,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:50,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-20 02:40:50,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-20 02:40:50,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 02:40:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2019-11-20 02:40:50,919 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2019-11-20 02:40:50,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:50,920 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2019-11-20 02:40:50,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:50,920 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2019-11-20 02:40:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-20 02:40:50,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:50,921 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-20 02:40:50,921 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:50,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:50,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1576701493, now seen corresponding path program 1 times [2019-11-20 02:40:50,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:50,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854608155] [2019-11-20 02:40:50,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:50,965 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:40:50,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854608155] [2019-11-20 02:40:50,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:50,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:50,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350113492] [2019-11-20 02:40:50,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:50,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:50,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:50,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:50,967 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2019-11-20 02:40:51,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:51,285 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2019-11-20 02:40:51,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:51,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-20 02:40:51,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:51,287 INFO L225 Difference]: With dead ends: 324 [2019-11-20 02:40:51,287 INFO L226 Difference]: Without dead ends: 175 [2019-11-20 02:40:51,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:51,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-20 02:40:51,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2019-11-20 02:40:51,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 02:40:51,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2019-11-20 02:40:51,294 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2019-11-20 02:40:51,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:51,294 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2019-11-20 02:40:51,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:51,294 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2019-11-20 02:40:51,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 02:40:51,295 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:51,295 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:40:51,296 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:51,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:51,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1274616071, now seen corresponding path program 1 times [2019-11-20 02:40:51,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:51,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830897712] [2019-11-20 02:40:51,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 02:40:51,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830897712] [2019-11-20 02:40:51,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:51,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:51,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050797011] [2019-11-20 02:40:51,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:51,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:51,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:51,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:51,377 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2019-11-20 02:40:51,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:51,822 INFO L93 Difference]: Finished difference Result 424 states and 639 transitions. [2019-11-20 02:40:51,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:51,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-20 02:40:51,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:51,824 INFO L225 Difference]: With dead ends: 424 [2019-11-20 02:40:51,824 INFO L226 Difference]: Without dead ends: 275 [2019-11-20 02:40:51,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:51,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-20 02:40:51,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 198. [2019-11-20 02:40:51,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-20 02:40:51,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2019-11-20 02:40:51,832 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2019-11-20 02:40:51,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:51,833 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2019-11-20 02:40:51,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2019-11-20 02:40:51,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 02:40:51,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:51,834 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:40:51,834 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:51,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:51,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1202229513, now seen corresponding path program 1 times [2019-11-20 02:40:51,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:51,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781283183] [2019-11-20 02:40:51,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:51,904 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 02:40:51,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781283183] [2019-11-20 02:40:51,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:51,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:51,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046958450] [2019-11-20 02:40:51,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:51,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:51,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:51,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:51,907 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2019-11-20 02:40:52,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:52,335 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2019-11-20 02:40:52,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:52,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-20 02:40:52,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:52,338 INFO L225 Difference]: With dead ends: 427 [2019-11-20 02:40:52,338 INFO L226 Difference]: Without dead ends: 248 [2019-11-20 02:40:52,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:52,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-20 02:40:52,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2019-11-20 02:40:52,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-20 02:40:52,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2019-11-20 02:40:52,344 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2019-11-20 02:40:52,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:52,344 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2019-11-20 02:40:52,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:52,345 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2019-11-20 02:40:52,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 02:40:52,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:52,346 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:40:52,346 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:52,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:52,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1047936766, now seen corresponding path program 1 times [2019-11-20 02:40:52,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:52,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312540380] [2019-11-20 02:40:52,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:52,398 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 02:40:52,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312540380] [2019-11-20 02:40:52,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:52,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:52,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033072274] [2019-11-20 02:40:52,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:52,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:52,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:52,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:52,401 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2019-11-20 02:40:52,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:52,760 INFO L93 Difference]: Finished difference Result 494 states and 761 transitions. [2019-11-20 02:40:52,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:52,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-20 02:40:52,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:52,763 INFO L225 Difference]: With dead ends: 494 [2019-11-20 02:40:52,763 INFO L226 Difference]: Without dead ends: 291 [2019-11-20 02:40:52,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:52,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-20 02:40:52,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 223. [2019-11-20 02:40:52,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-20 02:40:52,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2019-11-20 02:40:52,770 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2019-11-20 02:40:52,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:52,770 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2019-11-20 02:40:52,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:52,770 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2019-11-20 02:40:52,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 02:40:52,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:52,771 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:40:52,771 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:52,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:52,772 INFO L82 PathProgramCache]: Analyzing trace with hash -2006174842, now seen corresponding path program 1 times [2019-11-20 02:40:52,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:52,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555167872] [2019-11-20 02:40:52,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 02:40:52,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555167872] [2019-11-20 02:40:52,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:52,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:52,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657423422] [2019-11-20 02:40:52,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:52,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:52,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:52,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:52,853 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2019-11-20 02:40:53,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:53,206 INFO L93 Difference]: Finished difference Result 495 states and 761 transitions. [2019-11-20 02:40:53,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:53,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-20 02:40:53,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:53,209 INFO L225 Difference]: With dead ends: 495 [2019-11-20 02:40:53,209 INFO L226 Difference]: Without dead ends: 291 [2019-11-20 02:40:53,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:53,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-20 02:40:53,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 233. [2019-11-20 02:40:53,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-20 02:40:53,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2019-11-20 02:40:53,216 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 80 [2019-11-20 02:40:53,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:53,216 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2019-11-20 02:40:53,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:53,216 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2019-11-20 02:40:53,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 02:40:53,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:53,217 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:40:53,218 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:53,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:53,218 INFO L82 PathProgramCache]: Analyzing trace with hash -2068915140, now seen corresponding path program 1 times [2019-11-20 02:40:53,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:53,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430324858] [2019-11-20 02:40:53,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:53,287 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 02:40:53,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430324858] [2019-11-20 02:40:53,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:53,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:53,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876300098] [2019-11-20 02:40:53,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:53,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:53,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:53,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:53,289 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2019-11-20 02:40:53,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:53,699 INFO L93 Difference]: Finished difference Result 499 states and 772 transitions. [2019-11-20 02:40:53,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:53,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-20 02:40:53,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:53,702 INFO L225 Difference]: With dead ends: 499 [2019-11-20 02:40:53,702 INFO L226 Difference]: Without dead ends: 285 [2019-11-20 02:40:53,702 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:53,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-20 02:40:53,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2019-11-20 02:40:53,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 02:40:53,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2019-11-20 02:40:53,708 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 81 [2019-11-20 02:40:53,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:53,708 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2019-11-20 02:40:53,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:53,708 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2019-11-20 02:40:53,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 02:40:53,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:53,710 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-20 02:40:53,710 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:53,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:53,711 INFO L82 PathProgramCache]: Analyzing trace with hash -262676504, now seen corresponding path program 1 times [2019-11-20 02:40:53,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:53,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258976818] [2019-11-20 02:40:53,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:53,760 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 02:40:53,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258976818] [2019-11-20 02:40:53,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:53,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:53,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799479853] [2019-11-20 02:40:53,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:53,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:53,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:53,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:53,762 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2019-11-20 02:40:54,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:54,219 INFO L93 Difference]: Finished difference Result 500 states and 772 transitions. [2019-11-20 02:40:54,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:54,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 02:40:54,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:54,221 INFO L225 Difference]: With dead ends: 500 [2019-11-20 02:40:54,221 INFO L226 Difference]: Without dead ends: 285 [2019-11-20 02:40:54,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:54,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-20 02:40:54,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2019-11-20 02:40:54,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 02:40:54,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2019-11-20 02:40:54,228 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2019-11-20 02:40:54,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:54,228 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2019-11-20 02:40:54,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:54,229 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2019-11-20 02:40:54,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 02:40:54,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:54,231 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-20 02:40:54,232 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:54,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:54,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1665596198, now seen corresponding path program 1 times [2019-11-20 02:40:54,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:54,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493196330] [2019-11-20 02:40:54,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 02:40:54,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493196330] [2019-11-20 02:40:54,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:54,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:54,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363083765] [2019-11-20 02:40:54,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:54,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:54,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:54,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:54,292 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2019-11-20 02:40:54,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:54,579 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2019-11-20 02:40:54,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:54,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 02:40:54,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:54,581 INFO L225 Difference]: With dead ends: 475 [2019-11-20 02:40:54,581 INFO L226 Difference]: Without dead ends: 260 [2019-11-20 02:40:54,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:54,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-20 02:40:54,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2019-11-20 02:40:54,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 02:40:54,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2019-11-20 02:40:54,588 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2019-11-20 02:40:54,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:54,589 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2019-11-20 02:40:54,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:54,589 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2019-11-20 02:40:54,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 02:40:54,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:54,590 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:40:54,590 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:54,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:54,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1651925090, now seen corresponding path program 1 times [2019-11-20 02:40:54,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:54,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232007098] [2019-11-20 02:40:54,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 02:40:54,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232007098] [2019-11-20 02:40:54,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:54,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:54,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570958840] [2019-11-20 02:40:54,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:54,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:54,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:54,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:54,645 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2019-11-20 02:40:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:55,045 INFO L93 Difference]: Finished difference Result 499 states and 767 transitions. [2019-11-20 02:40:55,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:55,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 02:40:55,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:55,047 INFO L225 Difference]: With dead ends: 499 [2019-11-20 02:40:55,048 INFO L226 Difference]: Without dead ends: 284 [2019-11-20 02:40:55,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:55,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-11-20 02:40:55,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 234. [2019-11-20 02:40:55,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 02:40:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2019-11-20 02:40:55,054 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2019-11-20 02:40:55,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:55,054 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2019-11-20 02:40:55,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:55,054 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2019-11-20 02:40:55,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 02:40:55,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:55,055 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-20 02:40:55,056 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:55,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:55,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1588173709, now seen corresponding path program 1 times [2019-11-20 02:40:55,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:55,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870995999] [2019-11-20 02:40:55,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 02:40:55,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870995999] [2019-11-20 02:40:55,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:55,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:55,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060250343] [2019-11-20 02:40:55,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:55,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:55,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:55,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:55,147 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2019-11-20 02:40:55,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:55,614 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2019-11-20 02:40:55,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:55,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 02:40:55,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:55,616 INFO L225 Difference]: With dead ends: 497 [2019-11-20 02:40:55,616 INFO L226 Difference]: Without dead ends: 282 [2019-11-20 02:40:55,617 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:55,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-20 02:40:55,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2019-11-20 02:40:55,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 02:40:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2019-11-20 02:40:55,623 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2019-11-20 02:40:55,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:55,623 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2019-11-20 02:40:55,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:55,623 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2019-11-20 02:40:55,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 02:40:55,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:55,624 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-20 02:40:55,624 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:55,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:55,625 INFO L82 PathProgramCache]: Analyzing trace with hash 2128319181, now seen corresponding path program 1 times [2019-11-20 02:40:55,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:55,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603484620] [2019-11-20 02:40:55,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 02:40:55,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603484620] [2019-11-20 02:40:55,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:55,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:55,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178365816] [2019-11-20 02:40:55,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:55,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:55,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:55,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:55,685 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2019-11-20 02:40:56,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:56,049 INFO L93 Difference]: Finished difference Result 496 states and 760 transitions. [2019-11-20 02:40:56,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:56,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 02:40:56,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:56,051 INFO L225 Difference]: With dead ends: 496 [2019-11-20 02:40:56,051 INFO L226 Difference]: Without dead ends: 281 [2019-11-20 02:40:56,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:56,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-20 02:40:56,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 234. [2019-11-20 02:40:56,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 02:40:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2019-11-20 02:40:56,058 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2019-11-20 02:40:56,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:56,058 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2019-11-20 02:40:56,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:56,059 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2019-11-20 02:40:56,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 02:40:56,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:56,060 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:40:56,060 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:56,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:56,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1777463050, now seen corresponding path program 1 times [2019-11-20 02:40:56,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:56,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625481787] [2019-11-20 02:40:56,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 02:40:56,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625481787] [2019-11-20 02:40:56,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:56,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:40:56,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65477890] [2019-11-20 02:40:56,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:40:56,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:56,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:40:56,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:56,132 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2019-11-20 02:40:56,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:56,641 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2019-11-20 02:40:56,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:40:56,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-11-20 02:40:56,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:56,643 INFO L225 Difference]: With dead ends: 470 [2019-11-20 02:40:56,643 INFO L226 Difference]: Without dead ends: 255 [2019-11-20 02:40:56,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:40:56,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-20 02:40:56,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-11-20 02:40:56,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 02:40:56,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2019-11-20 02:40:56,650 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2019-11-20 02:40:56,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:56,650 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2019-11-20 02:40:56,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:40:56,650 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2019-11-20 02:40:56,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 02:40:56,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:56,651 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-20 02:40:56,651 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:56,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:56,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1235085327, now seen corresponding path program 1 times [2019-11-20 02:40:56,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:56,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356804789] [2019-11-20 02:40:56,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:56,700 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 02:40:56,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356804789] [2019-11-20 02:40:56,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:56,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:56,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449603371] [2019-11-20 02:40:56,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:56,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:56,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:56,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:56,702 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2019-11-20 02:40:56,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:56,991 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2019-11-20 02:40:56,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:56,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 02:40:56,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:56,993 INFO L225 Difference]: With dead ends: 512 [2019-11-20 02:40:56,993 INFO L226 Difference]: Without dead ends: 277 [2019-11-20 02:40:56,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:56,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-20 02:40:56,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2019-11-20 02:40:57,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 02:40:57,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2019-11-20 02:40:57,000 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2019-11-20 02:40:57,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:57,001 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2019-11-20 02:40:57,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:57,001 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2019-11-20 02:40:57,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 02:40:57,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:57,002 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-20 02:40:57,002 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:57,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:57,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1775230799, now seen corresponding path program 1 times [2019-11-20 02:40:57,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:57,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527589826] [2019-11-20 02:40:57,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:57,049 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 02:40:57,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527589826] [2019-11-20 02:40:57,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:57,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:57,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492664606] [2019-11-20 02:40:57,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:57,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:57,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:57,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:57,051 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2019-11-20 02:40:57,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:57,391 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2019-11-20 02:40:57,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:57,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 02:40:57,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:57,393 INFO L225 Difference]: With dead ends: 511 [2019-11-20 02:40:57,393 INFO L226 Difference]: Without dead ends: 276 [2019-11-20 02:40:57,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:57,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-20 02:40:57,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-20 02:40:57,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 02:40:57,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2019-11-20 02:40:57,399 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2019-11-20 02:40:57,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:57,400 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2019-11-20 02:40:57,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:57,400 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2019-11-20 02:40:57,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 02:40:57,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:57,401 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:40:57,401 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:57,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:57,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1768485220, now seen corresponding path program 1 times [2019-11-20 02:40:57,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:57,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765026296] [2019-11-20 02:40:57,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:57,451 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 02:40:57,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765026296] [2019-11-20 02:40:57,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:57,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:57,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885651865] [2019-11-20 02:40:57,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:57,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:57,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:57,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:57,453 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2019-11-20 02:40:57,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:57,891 INFO L93 Difference]: Finished difference Result 536 states and 805 transitions. [2019-11-20 02:40:57,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:57,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-20 02:40:57,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:57,894 INFO L225 Difference]: With dead ends: 536 [2019-11-20 02:40:57,894 INFO L226 Difference]: Without dead ends: 301 [2019-11-20 02:40:57,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:57,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-20 02:40:57,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-11-20 02:40:57,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 02:40:57,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2019-11-20 02:40:57,901 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2019-11-20 02:40:57,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:57,901 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2019-11-20 02:40:57,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:57,902 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2019-11-20 02:40:57,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 02:40:57,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:57,903 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:40:57,903 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:57,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:57,903 INFO L82 PathProgramCache]: Analyzing trace with hash -587320030, now seen corresponding path program 1 times [2019-11-20 02:40:57,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:57,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437543694] [2019-11-20 02:40:57,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:57,948 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 02:40:57,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437543694] [2019-11-20 02:40:57,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:57,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:57,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820322414] [2019-11-20 02:40:57,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:57,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:57,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:57,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:57,950 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2019-11-20 02:40:58,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:58,274 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2019-11-20 02:40:58,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:58,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-20 02:40:58,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:58,276 INFO L225 Difference]: With dead ends: 511 [2019-11-20 02:40:58,276 INFO L226 Difference]: Without dead ends: 276 [2019-11-20 02:40:58,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:58,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-20 02:40:58,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-20 02:40:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 02:40:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2019-11-20 02:40:58,284 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2019-11-20 02:40:58,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:58,285 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2019-11-20 02:40:58,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2019-11-20 02:40:58,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 02:40:58,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:58,286 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:40:58,287 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:58,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:58,287 INFO L82 PathProgramCache]: Analyzing trace with hash 253049097, now seen corresponding path program 1 times [2019-11-20 02:40:58,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:58,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198713476] [2019-11-20 02:40:58,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 02:40:58,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198713476] [2019-11-20 02:40:58,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:58,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:58,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976369393] [2019-11-20 02:40:58,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:58,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:58,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:58,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:58,345 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2019-11-20 02:40:58,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:58,679 INFO L93 Difference]: Finished difference Result 536 states and 801 transitions. [2019-11-20 02:40:58,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:58,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-20 02:40:58,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:58,681 INFO L225 Difference]: With dead ends: 536 [2019-11-20 02:40:58,681 INFO L226 Difference]: Without dead ends: 301 [2019-11-20 02:40:58,682 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:58,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-20 02:40:58,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-11-20 02:40:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 02:40:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2019-11-20 02:40:58,688 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2019-11-20 02:40:58,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:58,688 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2019-11-20 02:40:58,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:58,688 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2019-11-20 02:40:58,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 02:40:58,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:58,689 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:40:58,690 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:58,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:58,690 INFO L82 PathProgramCache]: Analyzing trace with hash 237530379, now seen corresponding path program 1 times [2019-11-20 02:40:58,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:58,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214878186] [2019-11-20 02:40:58,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:58,775 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 02:40:58,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214878186] [2019-11-20 02:40:58,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:58,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:58,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910783955] [2019-11-20 02:40:58,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:58,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:58,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:58,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:58,777 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2019-11-20 02:40:59,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:59,121 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2019-11-20 02:40:59,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:59,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-20 02:40:59,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:59,123 INFO L225 Difference]: With dead ends: 511 [2019-11-20 02:40:59,123 INFO L226 Difference]: Without dead ends: 276 [2019-11-20 02:40:59,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:59,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-20 02:40:59,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-20 02:40:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 02:40:59,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2019-11-20 02:40:59,130 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2019-11-20 02:40:59,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:59,131 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2019-11-20 02:40:59,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:59,131 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2019-11-20 02:40:59,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 02:40:59,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:59,132 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:40:59,132 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:59,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:59,132 INFO L82 PathProgramCache]: Analyzing trace with hash -762865057, now seen corresponding path program 1 times [2019-11-20 02:40:59,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:59,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495935427] [2019-11-20 02:40:59,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:59,187 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 02:40:59,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495935427] [2019-11-20 02:40:59,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:59,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:59,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024144419] [2019-11-20 02:40:59,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:59,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:59,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:59,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:59,189 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2019-11-20 02:40:59,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:59,554 INFO L93 Difference]: Finished difference Result 536 states and 797 transitions. [2019-11-20 02:40:59,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:59,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-20 02:40:59,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:59,556 INFO L225 Difference]: With dead ends: 536 [2019-11-20 02:40:59,556 INFO L226 Difference]: Without dead ends: 301 [2019-11-20 02:40:59,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:59,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-20 02:40:59,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-11-20 02:40:59,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 02:40:59,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2019-11-20 02:40:59,563 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2019-11-20 02:40:59,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:59,563 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2019-11-20 02:40:59,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:59,564 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2019-11-20 02:40:59,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 02:40:59,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:59,565 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:40:59,565 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:59,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:59,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1243945315, now seen corresponding path program 1 times [2019-11-20 02:40:59,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:59,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555570193] [2019-11-20 02:40:59,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:40:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:40:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 02:40:59,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555570193] [2019-11-20 02:40:59,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:40:59,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:40:59,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139778878] [2019-11-20 02:40:59,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:40:59,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:40:59,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:40:59,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:40:59,622 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2019-11-20 02:40:59,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:40:59,977 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2019-11-20 02:40:59,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:40:59,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-20 02:40:59,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:40:59,983 INFO L225 Difference]: With dead ends: 511 [2019-11-20 02:40:59,983 INFO L226 Difference]: Without dead ends: 276 [2019-11-20 02:40:59,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:40:59,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-20 02:40:59,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-20 02:40:59,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 02:40:59,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2019-11-20 02:40:59,990 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2019-11-20 02:40:59,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:40:59,991 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2019-11-20 02:40:59,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:40:59,991 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2019-11-20 02:40:59,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-20 02:40:59,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:40:59,992 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:40:59,992 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:40:59,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:40:59,993 INFO L82 PathProgramCache]: Analyzing trace with hash 821499940, now seen corresponding path program 1 times [2019-11-20 02:40:59,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:40:59,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256619900] [2019-11-20 02:40:59,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:00,041 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 02:41:00,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256619900] [2019-11-20 02:41:00,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:00,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:41:00,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851188960] [2019-11-20 02:41:00,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:41:00,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:00,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:41:00,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:00,043 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2019-11-20 02:41:00,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:00,415 INFO L93 Difference]: Finished difference Result 526 states and 781 transitions. [2019-11-20 02:41:00,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:41:00,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-20 02:41:00,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:00,417 INFO L225 Difference]: With dead ends: 526 [2019-11-20 02:41:00,418 INFO L226 Difference]: Without dead ends: 291 [2019-11-20 02:41:00,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:41:00,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-20 02:41:00,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2019-11-20 02:41:00,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 02:41:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-11-20 02:41:00,425 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2019-11-20 02:41:00,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:00,425 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-11-20 02:41:00,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:41:00,426 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-11-20 02:41:00,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-20 02:41:00,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:00,427 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:41:00,427 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:00,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:00,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1207086170, now seen corresponding path program 1 times [2019-11-20 02:41:00,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:00,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172328017] [2019-11-20 02:41:00,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:00,483 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 02:41:00,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172328017] [2019-11-20 02:41:00,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:00,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:41:00,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857845511] [2019-11-20 02:41:00,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:41:00,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:00,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:41:00,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:00,485 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2019-11-20 02:41:00,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:00,761 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2019-11-20 02:41:00,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:41:00,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-20 02:41:00,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:00,763 INFO L225 Difference]: With dead ends: 501 [2019-11-20 02:41:00,763 INFO L226 Difference]: Without dead ends: 266 [2019-11-20 02:41:00,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:41:00,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-20 02:41:00,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2019-11-20 02:41:00,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 02:41:00,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2019-11-20 02:41:00,769 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2019-11-20 02:41:00,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:00,770 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2019-11-20 02:41:00,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:41:00,770 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2019-11-20 02:41:00,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 02:41:00,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:00,771 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:41:00,771 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:00,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:00,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1797179946, now seen corresponding path program 1 times [2019-11-20 02:41:00,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:00,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538322632] [2019-11-20 02:41:00,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:00,828 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 02:41:00,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538322632] [2019-11-20 02:41:00,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:00,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:41:00,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369848679] [2019-11-20 02:41:00,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:41:00,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:00,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:41:00,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:00,830 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2019-11-20 02:41:01,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:01,156 INFO L93 Difference]: Finished difference Result 526 states and 777 transitions. [2019-11-20 02:41:01,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:41:01,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-20 02:41:01,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:01,163 INFO L225 Difference]: With dead ends: 526 [2019-11-20 02:41:01,163 INFO L226 Difference]: Without dead ends: 291 [2019-11-20 02:41:01,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:41:01,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-20 02:41:01,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2019-11-20 02:41:01,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 02:41:01,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2019-11-20 02:41:01,172 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2019-11-20 02:41:01,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:01,172 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2019-11-20 02:41:01,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:41:01,173 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2019-11-20 02:41:01,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 02:41:01,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:01,174 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:41:01,174 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:01,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:01,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1111001940, now seen corresponding path program 1 times [2019-11-20 02:41:01,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:01,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666159092] [2019-11-20 02:41:01,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:01,230 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-20 02:41:01,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666159092] [2019-11-20 02:41:01,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:01,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:41:01,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465568388] [2019-11-20 02:41:01,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:41:01,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:01,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:41:01,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:41:01,232 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2019-11-20 02:41:01,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:01,284 INFO L93 Difference]: Finished difference Result 722 states and 1074 transitions. [2019-11-20 02:41:01,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:41:01,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-20 02:41:01,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:01,287 INFO L225 Difference]: With dead ends: 722 [2019-11-20 02:41:01,287 INFO L226 Difference]: Without dead ends: 487 [2019-11-20 02:41:01,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:41:01,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-11-20 02:41:01,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2019-11-20 02:41:01,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-20 02:41:01,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 717 transitions. [2019-11-20 02:41:01,304 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 717 transitions. Word has length 96 [2019-11-20 02:41:01,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:01,305 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 717 transitions. [2019-11-20 02:41:01,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:41:01,305 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 717 transitions. [2019-11-20 02:41:01,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 02:41:01,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:01,306 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:41:01,307 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:01,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:01,307 INFO L82 PathProgramCache]: Analyzing trace with hash 870924278, now seen corresponding path program 1 times [2019-11-20 02:41:01,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:01,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113087283] [2019-11-20 02:41:01,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 02:41:01,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113087283] [2019-11-20 02:41:01,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:01,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:41:01,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384844422] [2019-11-20 02:41:01,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:41:01,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:01,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:41:01,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:41:01,362 INFO L87 Difference]: Start difference. First operand 487 states and 717 transitions. Second operand 3 states. [2019-11-20 02:41:01,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:01,417 INFO L93 Difference]: Finished difference Result 1190 states and 1763 transitions. [2019-11-20 02:41:01,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:41:01,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-20 02:41:01,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:01,421 INFO L225 Difference]: With dead ends: 1190 [2019-11-20 02:41:01,422 INFO L226 Difference]: Without dead ends: 722 [2019-11-20 02:41:01,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:41:01,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-11-20 02:41:01,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 720. [2019-11-20 02:41:01,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-20 02:41:01,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1065 transitions. [2019-11-20 02:41:01,440 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1065 transitions. Word has length 98 [2019-11-20 02:41:01,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:01,441 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1065 transitions. [2019-11-20 02:41:01,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:41:01,441 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1065 transitions. [2019-11-20 02:41:01,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 02:41:01,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:01,442 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-20 02:41:01,443 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:01,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:01,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1276717877, now seen corresponding path program 1 times [2019-11-20 02:41:01,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:01,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974811149] [2019-11-20 02:41:01,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:01,494 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 02:41:01,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974811149] [2019-11-20 02:41:01,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:01,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:41:01,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037971850] [2019-11-20 02:41:01,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:41:01,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:01,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:41:01,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:41:01,497 INFO L87 Difference]: Start difference. First operand 720 states and 1065 transitions. Second operand 3 states. [2019-11-20 02:41:01,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:01,583 INFO L93 Difference]: Finished difference Result 1656 states and 2457 transitions. [2019-11-20 02:41:01,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:41:01,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-20 02:41:01,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:01,588 INFO L225 Difference]: With dead ends: 1656 [2019-11-20 02:41:01,588 INFO L226 Difference]: Without dead ends: 955 [2019-11-20 02:41:01,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:41:01,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-11-20 02:41:01,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 953. [2019-11-20 02:41:01,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-11-20 02:41:01,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1399 transitions. [2019-11-20 02:41:01,616 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1399 transitions. Word has length 104 [2019-11-20 02:41:01,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:01,617 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1399 transitions. [2019-11-20 02:41:01,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:41:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1399 transitions. [2019-11-20 02:41:01,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 02:41:01,619 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:01,620 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-20 02:41:01,620 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:01,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:01,620 INFO L82 PathProgramCache]: Analyzing trace with hash -796142130, now seen corresponding path program 1 times [2019-11-20 02:41:01,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:01,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146912409] [2019-11-20 02:41:01,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 02:41:01,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146912409] [2019-11-20 02:41:01,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:01,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:41:01,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849643457] [2019-11-20 02:41:01,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:41:01,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:01,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:41:01,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:41:01,707 INFO L87 Difference]: Start difference. First operand 953 states and 1399 transitions. Second operand 3 states. [2019-11-20 02:41:01,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:01,778 INFO L93 Difference]: Finished difference Result 2120 states and 3124 transitions. [2019-11-20 02:41:01,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:41:01,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-20 02:41:01,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:01,784 INFO L225 Difference]: With dead ends: 2120 [2019-11-20 02:41:01,784 INFO L226 Difference]: Without dead ends: 1186 [2019-11-20 02:41:01,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:41:01,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-11-20 02:41:01,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2019-11-20 02:41:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-11-20 02:41:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1744 transitions. [2019-11-20 02:41:01,816 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1744 transitions. Word has length 121 [2019-11-20 02:41:01,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:01,816 INFO L462 AbstractCegarLoop]: Abstraction has 1186 states and 1744 transitions. [2019-11-20 02:41:01,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:41:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1744 transitions. [2019-11-20 02:41:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 02:41:01,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:01,819 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-11-20 02:41:01,819 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:01,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:01,820 INFO L82 PathProgramCache]: Analyzing trace with hash 893597874, now seen corresponding path program 1 times [2019-11-20 02:41:01,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:01,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921464965] [2019-11-20 02:41:01,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:01,873 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 02:41:01,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921464965] [2019-11-20 02:41:01,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:01,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 02:41:01,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332297018] [2019-11-20 02:41:01,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 02:41:01,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:01,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 02:41:01,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:41:01,875 INFO L87 Difference]: Start difference. First operand 1186 states and 1744 transitions. Second operand 3 states. [2019-11-20 02:41:01,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:01,938 INFO L93 Difference]: Finished difference Result 1423 states and 2089 transitions. [2019-11-20 02:41:01,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 02:41:01,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-20 02:41:01,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:01,945 INFO L225 Difference]: With dead ends: 1423 [2019-11-20 02:41:01,945 INFO L226 Difference]: Without dead ends: 1421 [2019-11-20 02:41:01,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 02:41:01,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2019-11-20 02:41:01,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1419. [2019-11-20 02:41:01,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-11-20 02:41:01,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2086 transitions. [2019-11-20 02:41:01,982 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2086 transitions. Word has length 127 [2019-11-20 02:41:01,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:01,982 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 2086 transitions. [2019-11-20 02:41:01,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 02:41:01,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2086 transitions. [2019-11-20 02:41:01,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-20 02:41:01,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:01,986 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 02:41:01,987 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:01,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:01,987 INFO L82 PathProgramCache]: Analyzing trace with hash -618148538, now seen corresponding path program 1 times [2019-11-20 02:41:01,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:01,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016404304] [2019-11-20 02:41:01,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:02,358 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 02:41:02,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016404304] [2019-11-20 02:41:02,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569578578] [2019-11-20 02:41:02,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/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-20 02:41:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:02,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-20 02:41:02,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:41:02,716 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:02,716 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-20 02:41:02,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:41:02,753 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:02,756 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_162|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-11-20 02:41:02,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:02,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:02,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:02,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:02,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:02,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:02,790 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 02:41:02,791 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:41:02,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:02,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:02,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:02,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:02,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:02,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:02,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:02,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 02:41:02,832 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:41:02,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:02,916 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 02:41:02,916 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 02:41:02,917 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 02:41:02,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:02,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:41:02,933 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-20 02:41:02,992 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 02:41:02,992 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 02:41:02,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:41:03,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:03,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:41:03,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 02:41:03,072 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 02:41:03,072 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 02:41:03,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:41:03,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:03,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:41:03,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 02:41:03,091 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_165|]} [2019-11-20 02:41:03,100 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-20 02:41:03,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:03,179 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-20 02:41:03,179 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-11-20 02:41:03,180 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:41:03,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:03,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:41:03,192 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-20 02:41:03,243 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 02:41:03,244 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 02:41:03,244 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:41:03,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:03,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:41:03,258 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 02:41:03,297 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 02:41:03,297 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 02:41:03,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:41:03,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:03,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:41:03,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 02:41:03,318 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_158|], 20=[|v_#memory_$Pointer$.base_168|]} [2019-11-20 02:41:03,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:03,323 INFO L377 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 49 treesize of output 37 [2019-11-20 02:41:03,324 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:41:03,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:03,559 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-11-20 02:41:03,559 INFO L343 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2019-11-20 02:41:03,560 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2019-11-20 02:41:03,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:03,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:03,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:04,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:04,241 INFO L496 ElimStorePlain]: Start of recursive call 3: 24 dim-0 vars, End of recursive call: 24 dim-0 vars, and 3 xjuncts. [2019-11-20 02:41:05,544 WARN L191 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 481 DAG size of output: 288 [2019-11-20 02:41:05,544 INFO L567 ElimStorePlain]: treesize reduction 3372, result has 33.0 percent of original size [2019-11-20 02:41:05,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:05,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 02:41:05,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:05,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:05,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 44 dim-0 vars, and 3 xjuncts. [2019-11-20 02:41:05,559 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:2111 [2019-11-20 02:41:05,872 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 347 DAG size of output: 35 [2019-11-20 02:41:05,915 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 30=[|v_#memory_$Pointer$.base_169|]} [2019-11-20 02:41:05,918 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-20 02:41:05,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:06,095 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 61 [2019-11-20 02:41:06,095 INFO L343 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2019-11-20 02:41:06,096 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 104 treesize of output 142 [2019-11-20 02:41:06,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:06,097 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:41:06,155 INFO L567 ElimStorePlain]: treesize reduction 69, result has 56.3 percent of original size [2019-11-20 02:41:06,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:41:06,156 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2019-11-20 02:41:06,991 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 30=[|v_#memory_$Pointer$.base_170|]} [2019-11-20 02:41:06,996 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 02:41:06,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:41:07,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:07,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:07,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:07,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:07,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:07,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:07,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:07,238 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-11-20 02:41:07,238 INFO L343 Elim1Store]: treesize reduction 56, result has 73.5 percent of original size [2019-11-20 02:41:07,239 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 207 [2019-11-20 02:41:07,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:07,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:07,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,246 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:41:07,434 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 40 [2019-11-20 02:41:07,434 INFO L567 ElimStorePlain]: treesize reduction 7053, result has 1.2 percent of original size [2019-11-20 02:41:07,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:41:07,435 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:89 [2019-11-20 02:41:07,478 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|], 2=[|v_#memory_int_179|], 20=[|v_#memory_$Pointer$.base_171|]} [2019-11-20 02:41:07,482 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-11-20 02:41:07,482 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-20 02:41:07,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:07,505 INFO L377 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 35 treesize of output 28 [2019-11-20 02:41:07,505 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:41:07,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:07,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:07,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:07,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:07,671 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 02:41:07,671 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:07,671 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 147 [2019-11-20 02:41:07,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:07,797 INFO L496 ElimStorePlain]: Start of recursive call 4: 150 dim-0 vars, End of recursive call: 151 dim-0 vars, and 14 xjuncts. [2019-11-20 02:41:13,105 WARN L191 SmtUtils]: Spent 5.31 s on a formula simplification. DAG size of input: 1094 DAG size of output: 1034 [2019-11-20 02:41:13,106 INFO L567 ElimStorePlain]: treesize reduction 320, result has 89.6 percent of original size [2019-11-20 02:41:13,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 02:41:13,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 02:41:13,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:13,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 13 terms [2019-11-20 02:41:13,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:13,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 02:41:13,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:13,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-11-20 02:41:13,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 02:41:13,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:13,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:13,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:13,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-11-20 02:41:13,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 02:41:13,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:13,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-11-20 02:41:13,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:13,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 02:41:13,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:13,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:13,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 02:41:13,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:13,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 02:41:13,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:13,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:13,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:13,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-11-20 02:41:13,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:13,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 02:41:13,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:13,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 02:41:13,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:13,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 02:41:13,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:13,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 262 dim-0 vars, and 1 xjuncts. [2019-11-20 02:41:13,175 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:120, output treesize:1845 [2019-11-20 02:41:14,704 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 1323 DAG size of output: 22 [2019-11-20 02:41:14,718 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-20 02:41:14,719 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-11-20 02:41:14,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:41:14,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:14,728 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-20 02:41:14,728 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2019-11-20 02:41:14,776 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 02:41:14,777 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2019-11-20 02:41:14,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:41:14,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:14,786 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-20 02:41:14,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-11-20 02:41:15,099 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 64 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 02:41:15,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:41:15,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-11-20 02:41:15,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216960188] [2019-11-20 02:41:15,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 02:41:15,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:15,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 02:41:15,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-20 02:41:15,102 INFO L87 Difference]: Start difference. First operand 1419 states and 2086 transitions. Second operand 13 states. [2019-11-20 02:41:19,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:19,504 INFO L93 Difference]: Finished difference Result 6893 states and 10241 transitions. [2019-11-20 02:41:19,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 02:41:19,505 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 164 [2019-11-20 02:41:19,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:19,531 INFO L225 Difference]: With dead ends: 6893 [2019-11-20 02:41:19,531 INFO L226 Difference]: Without dead ends: 5493 [2019-11-20 02:41:19,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 120 SyntacticMatches, 46 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2019-11-20 02:41:19,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5493 states. [2019-11-20 02:41:19,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5493 to 3081. [2019-11-20 02:41:19,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3081 states. [2019-11-20 02:41:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4683 transitions. [2019-11-20 02:41:19,650 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4683 transitions. Word has length 164 [2019-11-20 02:41:19,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:19,650 INFO L462 AbstractCegarLoop]: Abstraction has 3081 states and 4683 transitions. [2019-11-20 02:41:19,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 02:41:19,650 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4683 transitions. [2019-11-20 02:41:19,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-20 02:41:19,656 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:19,656 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1] [2019-11-20 02:41:19,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:41:19,861 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:19,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:19,862 INFO L82 PathProgramCache]: Analyzing trace with hash 383929993, now seen corresponding path program 1 times [2019-11-20 02:41:19,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:19,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692682891] [2019-11-20 02:41:19,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 02:41:19,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692682891] [2019-11-20 02:41:19,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:19,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:41:19,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140146263] [2019-11-20 02:41:19,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:41:19,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:19,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:41:19,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:19,954 INFO L87 Difference]: Start difference. First operand 3081 states and 4683 transitions. Second operand 4 states. [2019-11-20 02:41:20,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:20,395 INFO L93 Difference]: Finished difference Result 6839 states and 10430 transitions. [2019-11-20 02:41:20,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:41:20,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-11-20 02:41:20,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:20,414 INFO L225 Difference]: With dead ends: 6839 [2019-11-20 02:41:20,414 INFO L226 Difference]: Without dead ends: 3777 [2019-11-20 02:41:20,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:41:20,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3777 states. [2019-11-20 02:41:20,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3777 to 3417. [2019-11-20 02:41:20,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3417 states. [2019-11-20 02:41:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3417 states to 3417 states and 5271 transitions. [2019-11-20 02:41:20,521 INFO L78 Accepts]: Start accepts. Automaton has 3417 states and 5271 transitions. Word has length 172 [2019-11-20 02:41:20,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:20,521 INFO L462 AbstractCegarLoop]: Abstraction has 3417 states and 5271 transitions. [2019-11-20 02:41:20,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:41:20,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 5271 transitions. [2019-11-20 02:41:20,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 02:41:20,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:20,528 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 02:41:20,528 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:20,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:20,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1013795468, now seen corresponding path program 1 times [2019-11-20 02:41:20,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:20,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739610077] [2019-11-20 02:41:20,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:20,625 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-20 02:41:20,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739610077] [2019-11-20 02:41:20,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:20,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:41:20,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069944110] [2019-11-20 02:41:20,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:41:20,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:20,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:41:20,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:20,627 INFO L87 Difference]: Start difference. First operand 3417 states and 5271 transitions. Second operand 4 states. [2019-11-20 02:41:21,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:21,223 INFO L93 Difference]: Finished difference Result 7981 states and 12303 transitions. [2019-11-20 02:41:21,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:41:21,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-20 02:41:21,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:21,245 INFO L225 Difference]: With dead ends: 7981 [2019-11-20 02:41:21,245 INFO L226 Difference]: Without dead ends: 4583 [2019-11-20 02:41:21,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:41:21,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2019-11-20 02:41:21,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 3885. [2019-11-20 02:41:21,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3885 states. [2019-11-20 02:41:21,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3885 states to 3885 states and 6123 transitions. [2019-11-20 02:41:21,357 INFO L78 Accepts]: Start accepts. Automaton has 3885 states and 6123 transitions. Word has length 178 [2019-11-20 02:41:21,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:21,358 INFO L462 AbstractCegarLoop]: Abstraction has 3885 states and 6123 transitions. [2019-11-20 02:41:21,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:41:21,358 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 6123 transitions. [2019-11-20 02:41:21,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 02:41:21,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:21,364 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:41:21,365 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:21,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:21,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1355851254, now seen corresponding path program 1 times [2019-11-20 02:41:21,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:21,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043631448] [2019-11-20 02:41:21,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-20 02:41:21,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043631448] [2019-11-20 02:41:21,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:21,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:41:21,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546058971] [2019-11-20 02:41:21,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:41:21,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:21,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:41:21,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:21,460 INFO L87 Difference]: Start difference. First operand 3885 states and 6123 transitions. Second operand 4 states. [2019-11-20 02:41:22,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:22,049 INFO L93 Difference]: Finished difference Result 8399 states and 13080 transitions. [2019-11-20 02:41:22,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:41:22,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-11-20 02:41:22,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:22,059 INFO L225 Difference]: With dead ends: 8399 [2019-11-20 02:41:22,059 INFO L226 Difference]: Without dead ends: 4533 [2019-11-20 02:41:22,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:41:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4533 states. [2019-11-20 02:41:22,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4533 to 3765. [2019-11-20 02:41:22,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3765 states. [2019-11-20 02:41:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 3765 states and 5895 transitions. [2019-11-20 02:41:22,160 INFO L78 Accepts]: Start accepts. Automaton has 3765 states and 5895 transitions. Word has length 179 [2019-11-20 02:41:22,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:22,161 INFO L462 AbstractCegarLoop]: Abstraction has 3765 states and 5895 transitions. [2019-11-20 02:41:22,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:41:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 5895 transitions. [2019-11-20 02:41:22,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 02:41:22,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:22,167 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 02:41:22,167 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:22,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:22,167 INFO L82 PathProgramCache]: Analyzing trace with hash -350011293, now seen corresponding path program 1 times [2019-11-20 02:41:22,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:22,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804840606] [2019-11-20 02:41:22,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-20 02:41:22,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804840606] [2019-11-20 02:41:22,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:22,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:41:22,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428858940] [2019-11-20 02:41:22,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:41:22,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:22,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:41:22,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:41:22,293 INFO L87 Difference]: Start difference. First operand 3765 states and 5895 transitions. Second operand 5 states. [2019-11-20 02:41:22,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:22,767 INFO L93 Difference]: Finished difference Result 9049 states and 14167 transitions. [2019-11-20 02:41:22,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:41:22,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2019-11-20 02:41:22,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:22,776 INFO L225 Difference]: With dead ends: 9049 [2019-11-20 02:41:22,776 INFO L226 Difference]: Without dead ends: 5303 [2019-11-20 02:41:22,781 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:41:22,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5303 states. [2019-11-20 02:41:22,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5303 to 4239. [2019-11-20 02:41:22,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4239 states. [2019-11-20 02:41:22,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4239 states to 4239 states and 6753 transitions. [2019-11-20 02:41:22,885 INFO L78 Accepts]: Start accepts. Automaton has 4239 states and 6753 transitions. Word has length 179 [2019-11-20 02:41:22,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:22,885 INFO L462 AbstractCegarLoop]: Abstraction has 4239 states and 6753 transitions. [2019-11-20 02:41:22,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:41:22,885 INFO L276 IsEmpty]: Start isEmpty. Operand 4239 states and 6753 transitions. [2019-11-20 02:41:22,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 02:41:22,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:22,892 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 02:41:22,892 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:22,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:22,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1053443609, now seen corresponding path program 2 times [2019-11-20 02:41:22,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:22,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331070890] [2019-11-20 02:41:22,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:22,972 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 02:41:22,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331070890] [2019-11-20 02:41:22,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:22,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:41:22,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716394548] [2019-11-20 02:41:22,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:41:22,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:22,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:41:22,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:22,974 INFO L87 Difference]: Start difference. First operand 4239 states and 6753 transitions. Second operand 4 states. [2019-11-20 02:41:23,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:23,410 INFO L93 Difference]: Finished difference Result 7579 states and 11968 transitions. [2019-11-20 02:41:23,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:41:23,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-11-20 02:41:23,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:23,426 INFO L225 Difference]: With dead ends: 7579 [2019-11-20 02:41:23,427 INFO L226 Difference]: Without dead ends: 5405 [2019-11-20 02:41:23,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:41:23,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5405 states. [2019-11-20 02:41:23,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5405 to 4383. [2019-11-20 02:41:23,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4383 states. [2019-11-20 02:41:23,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4383 states to 4383 states and 6957 transitions. [2019-11-20 02:41:23,551 INFO L78 Accepts]: Start accepts. Automaton has 4383 states and 6957 transitions. Word has length 179 [2019-11-20 02:41:23,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:23,552 INFO L462 AbstractCegarLoop]: Abstraction has 4383 states and 6957 transitions. [2019-11-20 02:41:23,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:41:23,552 INFO L276 IsEmpty]: Start isEmpty. Operand 4383 states and 6957 transitions. [2019-11-20 02:41:23,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-20 02:41:23,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:23,560 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 02:41:23,560 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:23,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:23,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1144686980, now seen corresponding path program 1 times [2019-11-20 02:41:23,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:23,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644788116] [2019-11-20 02:41:23,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:23,692 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 02:41:23,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644788116] [2019-11-20 02:41:23,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:23,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:41:23,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443250054] [2019-11-20 02:41:23,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:41:23,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:23,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:41:23,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:23,695 INFO L87 Difference]: Start difference. First operand 4383 states and 6957 transitions. Second operand 4 states. [2019-11-20 02:41:24,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:24,128 INFO L93 Difference]: Finished difference Result 7651 states and 12058 transitions. [2019-11-20 02:41:24,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:41:24,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-11-20 02:41:24,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:24,137 INFO L225 Difference]: With dead ends: 7651 [2019-11-20 02:41:24,137 INFO L226 Difference]: Without dead ends: 5405 [2019-11-20 02:41:24,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:41:24,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5405 states. [2019-11-20 02:41:24,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5405 to 4395. [2019-11-20 02:41:24,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4395 states. [2019-11-20 02:41:24,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4395 states to 4395 states and 6969 transitions. [2019-11-20 02:41:24,246 INFO L78 Accepts]: Start accepts. Automaton has 4395 states and 6969 transitions. Word has length 180 [2019-11-20 02:41:24,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:24,247 INFO L462 AbstractCegarLoop]: Abstraction has 4395 states and 6969 transitions. [2019-11-20 02:41:24,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:41:24,247 INFO L276 IsEmpty]: Start isEmpty. Operand 4395 states and 6969 transitions. [2019-11-20 02:41:24,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-20 02:41:24,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:24,253 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:41:24,253 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:24,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:24,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2027514623, now seen corresponding path program 1 times [2019-11-20 02:41:24,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:24,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558208576] [2019-11-20 02:41:24,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-20 02:41:24,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558208576] [2019-11-20 02:41:24,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:24,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:41:24,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307694351] [2019-11-20 02:41:24,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 02:41:24,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:24,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 02:41:24,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:41:24,375 INFO L87 Difference]: Start difference. First operand 4395 states and 6969 transitions. Second operand 5 states. [2019-11-20 02:41:24,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:24,868 INFO L93 Difference]: Finished difference Result 9973 states and 15769 transitions. [2019-11-20 02:41:24,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:41:24,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-11-20 02:41:24,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:24,873 INFO L225 Difference]: With dead ends: 9973 [2019-11-20 02:41:24,873 INFO L226 Difference]: Without dead ends: 5597 [2019-11-20 02:41:24,876 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:41:24,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2019-11-20 02:41:24,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 4263. [2019-11-20 02:41:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4263 states. [2019-11-20 02:41:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 6789 transitions. [2019-11-20 02:41:24,985 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 6789 transitions. Word has length 180 [2019-11-20 02:41:24,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:24,985 INFO L462 AbstractCegarLoop]: Abstraction has 4263 states and 6789 transitions. [2019-11-20 02:41:24,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 02:41:24,985 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 6789 transitions. [2019-11-20 02:41:24,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-20 02:41:24,991 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:24,992 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 02:41:24,992 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:24,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:24,992 INFO L82 PathProgramCache]: Analyzing trace with hash 2046397566, now seen corresponding path program 1 times [2019-11-20 02:41:24,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:24,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225445949] [2019-11-20 02:41:24,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:25,065 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 02:41:25,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225445949] [2019-11-20 02:41:25,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:25,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:41:25,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938398795] [2019-11-20 02:41:25,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:41:25,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:25,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:41:25,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:25,067 INFO L87 Difference]: Start difference. First operand 4263 states and 6789 transitions. Second operand 4 states. [2019-11-20 02:41:25,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:25,556 INFO L93 Difference]: Finished difference Result 7409 states and 11707 transitions. [2019-11-20 02:41:25,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:41:25,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-11-20 02:41:25,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:25,560 INFO L225 Difference]: With dead ends: 7409 [2019-11-20 02:41:25,560 INFO L226 Difference]: Without dead ends: 5223 [2019-11-20 02:41:25,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:41:25,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5223 states. [2019-11-20 02:41:25,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5223 to 4275. [2019-11-20 02:41:25,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4275 states. [2019-11-20 02:41:25,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 6801 transitions. [2019-11-20 02:41:25,671 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 6801 transitions. Word has length 181 [2019-11-20 02:41:25,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:25,671 INFO L462 AbstractCegarLoop]: Abstraction has 4275 states and 6801 transitions. [2019-11-20 02:41:25,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:41:25,672 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 6801 transitions. [2019-11-20 02:41:25,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-20 02:41:25,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:25,678 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 02:41:25,678 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:25,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:25,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1992179255, now seen corresponding path program 1 times [2019-11-20 02:41:25,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:25,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905378459] [2019-11-20 02:41:25,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 02:41:25,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905378459] [2019-11-20 02:41:25,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:25,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:41:25,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051321874] [2019-11-20 02:41:25,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:41:25,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:25,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:41:25,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:25,758 INFO L87 Difference]: Start difference. First operand 4275 states and 6801 transitions. Second operand 4 states. [2019-11-20 02:41:26,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:26,370 INFO L93 Difference]: Finished difference Result 7355 states and 11629 transitions. [2019-11-20 02:41:26,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:41:26,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-11-20 02:41:26,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:26,373 INFO L225 Difference]: With dead ends: 7355 [2019-11-20 02:41:26,373 INFO L226 Difference]: Without dead ends: 5163 [2019-11-20 02:41:26,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:41:26,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5163 states. [2019-11-20 02:41:26,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5163 to 4287. [2019-11-20 02:41:26,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-20 02:41:26,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6813 transitions. [2019-11-20 02:41:26,448 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6813 transitions. Word has length 182 [2019-11-20 02:41:26,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:26,448 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6813 transitions. [2019-11-20 02:41:26,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:41:26,448 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6813 transitions. [2019-11-20 02:41:26,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-20 02:41:26,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:26,452 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2019-11-20 02:41:26,452 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:26,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:26,453 INFO L82 PathProgramCache]: Analyzing trace with hash -699433533, now seen corresponding path program 1 times [2019-11-20 02:41:26,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:26,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385963248] [2019-11-20 02:41:26,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:26,522 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 02:41:26,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385963248] [2019-11-20 02:41:26,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:26,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:41:26,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072853043] [2019-11-20 02:41:26,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:41:26,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:26,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:41:26,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:26,524 INFO L87 Difference]: Start difference. First operand 4287 states and 6813 transitions. Second operand 4 states. [2019-11-20 02:41:26,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:26,885 INFO L93 Difference]: Finished difference Result 8903 states and 14078 transitions. [2019-11-20 02:41:26,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:41:26,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-11-20 02:41:26,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:26,889 INFO L225 Difference]: With dead ends: 8903 [2019-11-20 02:41:26,889 INFO L226 Difference]: Without dead ends: 4635 [2019-11-20 02:41:26,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:41:26,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-11-20 02:41:26,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4287. [2019-11-20 02:41:26,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-20 02:41:26,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6801 transitions. [2019-11-20 02:41:26,964 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6801 transitions. Word has length 186 [2019-11-20 02:41:26,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:26,965 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6801 transitions. [2019-11-20 02:41:26,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:41:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6801 transitions. [2019-11-20 02:41:26,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-20 02:41:26,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:26,971 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:41:26,971 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:26,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:26,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1460921410, now seen corresponding path program 1 times [2019-11-20 02:41:26,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:26,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135761078] [2019-11-20 02:41:26,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:27,040 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 02:41:27,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135761078] [2019-11-20 02:41:27,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:27,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:41:27,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903113834] [2019-11-20 02:41:27,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:41:27,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:27,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:41:27,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:27,042 INFO L87 Difference]: Start difference. First operand 4287 states and 6801 transitions. Second operand 4 states. [2019-11-20 02:41:27,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:27,402 INFO L93 Difference]: Finished difference Result 6833 states and 10743 transitions. [2019-11-20 02:41:27,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:41:27,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-11-20 02:41:27,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:27,406 INFO L225 Difference]: With dead ends: 6833 [2019-11-20 02:41:27,406 INFO L226 Difference]: Without dead ends: 4635 [2019-11-20 02:41:27,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:41:27,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-11-20 02:41:27,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4287. [2019-11-20 02:41:27,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-20 02:41:27,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6789 transitions. [2019-11-20 02:41:27,487 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6789 transitions. Word has length 187 [2019-11-20 02:41:27,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:27,487 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6789 transitions. [2019-11-20 02:41:27,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:41:27,487 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6789 transitions. [2019-11-20 02:41:27,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-20 02:41:27,493 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:27,494 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:41:27,494 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:27,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:27,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1574944825, now seen corresponding path program 1 times [2019-11-20 02:41:27,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:27,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826927616] [2019-11-20 02:41:27,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:27,567 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 02:41:27,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826927616] [2019-11-20 02:41:27,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:27,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:41:27,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123108544] [2019-11-20 02:41:27,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:41:27,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:27,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:41:27,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:27,569 INFO L87 Difference]: Start difference. First operand 4287 states and 6789 transitions. Second operand 4 states. [2019-11-20 02:41:27,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:27,963 INFO L93 Difference]: Finished difference Result 6833 states and 10725 transitions. [2019-11-20 02:41:27,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:41:27,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-11-20 02:41:27,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:27,966 INFO L225 Difference]: With dead ends: 6833 [2019-11-20 02:41:27,966 INFO L226 Difference]: Without dead ends: 4635 [2019-11-20 02:41:27,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:41:27,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-11-20 02:41:28,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4287. [2019-11-20 02:41:28,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-20 02:41:28,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6777 transitions. [2019-11-20 02:41:28,045 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6777 transitions. Word has length 188 [2019-11-20 02:41:28,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:28,045 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6777 transitions. [2019-11-20 02:41:28,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:41:28,045 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6777 transitions. [2019-11-20 02:41:28,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-20 02:41:28,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:28,049 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:41:28,050 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:28,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:28,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1346205799, now seen corresponding path program 1 times [2019-11-20 02:41:28,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:28,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106861386] [2019-11-20 02:41:28,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:28,124 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 02:41:28,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106861386] [2019-11-20 02:41:28,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:28,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:41:28,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931558011] [2019-11-20 02:41:28,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:41:28,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:28,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:41:28,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:28,126 INFO L87 Difference]: Start difference. First operand 4287 states and 6777 transitions. Second operand 4 states. [2019-11-20 02:41:28,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:28,525 INFO L93 Difference]: Finished difference Result 6833 states and 10707 transitions. [2019-11-20 02:41:28,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:41:28,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-11-20 02:41:28,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:28,530 INFO L225 Difference]: With dead ends: 6833 [2019-11-20 02:41:28,530 INFO L226 Difference]: Without dead ends: 4635 [2019-11-20 02:41:28,532 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:41:28,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-11-20 02:41:28,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4287. [2019-11-20 02:41:28,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-20 02:41:28,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6765 transitions. [2019-11-20 02:41:28,672 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6765 transitions. Word has length 189 [2019-11-20 02:41:28,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:28,672 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6765 transitions. [2019-11-20 02:41:28,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:41:28,672 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6765 transitions. [2019-11-20 02:41:28,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-20 02:41:28,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:28,677 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:41:28,677 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:28,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:28,677 INFO L82 PathProgramCache]: Analyzing trace with hash -43681972, now seen corresponding path program 1 times [2019-11-20 02:41:28,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:28,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455513365] [2019-11-20 02:41:28,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:28,752 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 02:41:28,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455513365] [2019-11-20 02:41:28,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:28,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:41:28,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492307023] [2019-11-20 02:41:28,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:41:28,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:28,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:41:28,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:28,754 INFO L87 Difference]: Start difference. First operand 4287 states and 6765 transitions. Second operand 4 states. [2019-11-20 02:41:29,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:29,146 INFO L93 Difference]: Finished difference Result 6773 states and 10617 transitions. [2019-11-20 02:41:29,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:41:29,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-11-20 02:41:29,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:29,150 INFO L225 Difference]: With dead ends: 6773 [2019-11-20 02:41:29,150 INFO L226 Difference]: Without dead ends: 4575 [2019-11-20 02:41:29,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:41:29,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2019-11-20 02:41:29,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4287. [2019-11-20 02:41:29,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-20 02:41:29,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6753 transitions. [2019-11-20 02:41:29,234 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6753 transitions. Word has length 190 [2019-11-20 02:41:29,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:29,234 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6753 transitions. [2019-11-20 02:41:29,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:41:29,234 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6753 transitions. [2019-11-20 02:41:29,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-20 02:41:29,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:29,238 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 02:41:29,238 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:29,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:29,238 INFO L82 PathProgramCache]: Analyzing trace with hash 396872042, now seen corresponding path program 1 times [2019-11-20 02:41:29,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:29,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390083279] [2019-11-20 02:41:29,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:29,314 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-20 02:41:29,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390083279] [2019-11-20 02:41:29,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:29,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:41:29,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279996708] [2019-11-20 02:41:29,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:41:29,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:29,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:41:29,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:29,316 INFO L87 Difference]: Start difference. First operand 4287 states and 6753 transitions. Second operand 4 states. [2019-11-20 02:41:29,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:29,722 INFO L93 Difference]: Finished difference Result 9431 states and 14820 transitions. [2019-11-20 02:41:29,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:41:29,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-20 02:41:29,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:29,726 INFO L225 Difference]: With dead ends: 9431 [2019-11-20 02:41:29,726 INFO L226 Difference]: Without dead ends: 5163 [2019-11-20 02:41:29,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:41:29,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5163 states. [2019-11-20 02:41:29,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5163 to 4299. [2019-11-20 02:41:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4299 states. [2019-11-20 02:41:29,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4299 states to 4299 states and 6765 transitions. [2019-11-20 02:41:29,809 INFO L78 Accepts]: Start accepts. Automaton has 4299 states and 6765 transitions. Word has length 192 [2019-11-20 02:41:29,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:29,809 INFO L462 AbstractCegarLoop]: Abstraction has 4299 states and 6765 transitions. [2019-11-20 02:41:29,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:41:29,809 INFO L276 IsEmpty]: Start isEmpty. Operand 4299 states and 6765 transitions. [2019-11-20 02:41:29,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-20 02:41:29,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:29,812 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 02:41:29,812 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:29,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:29,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1321764193, now seen corresponding path program 1 times [2019-11-20 02:41:29,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:29,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606646081] [2019-11-20 02:41:29,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:29,886 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-11-20 02:41:29,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606646081] [2019-11-20 02:41:29,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:29,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:41:29,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674409777] [2019-11-20 02:41:29,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:41:29,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:29,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:41:29,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:29,888 INFO L87 Difference]: Start difference. First operand 4299 states and 6765 transitions. Second operand 4 states. [2019-11-20 02:41:30,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:30,326 INFO L93 Difference]: Finished difference Result 9419 states and 14796 transitions. [2019-11-20 02:41:30,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:41:30,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-20 02:41:30,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:30,330 INFO L225 Difference]: With dead ends: 9419 [2019-11-20 02:41:30,330 INFO L226 Difference]: Without dead ends: 5139 [2019-11-20 02:41:30,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:41:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5139 states. [2019-11-20 02:41:30,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5139 to 4311. [2019-11-20 02:41:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4311 states. [2019-11-20 02:41:30,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4311 states to 4311 states and 6777 transitions. [2019-11-20 02:41:30,429 INFO L78 Accepts]: Start accepts. Automaton has 4311 states and 6777 transitions. Word has length 193 [2019-11-20 02:41:30,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:30,429 INFO L462 AbstractCegarLoop]: Abstraction has 4311 states and 6777 transitions. [2019-11-20 02:41:30,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:41:30,429 INFO L276 IsEmpty]: Start isEmpty. Operand 4311 states and 6777 transitions. [2019-11-20 02:41:30,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-20 02:41:30,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:30,432 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 02:41:30,432 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:30,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:30,432 INFO L82 PathProgramCache]: Analyzing trace with hash -166759969, now seen corresponding path program 1 times [2019-11-20 02:41:30,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:30,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004899255] [2019-11-20 02:41:30,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:30,496 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 02:41:30,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004899255] [2019-11-20 02:41:30,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:30,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:41:30,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978967566] [2019-11-20 02:41:30,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:41:30,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:41:30,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:41:30,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:30,498 INFO L87 Difference]: Start difference. First operand 4311 states and 6777 transitions. Second operand 4 states. [2019-11-20 02:41:30,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:30,950 INFO L93 Difference]: Finished difference Result 7637 states and 11929 transitions. [2019-11-20 02:41:30,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:41:30,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-20 02:41:30,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:30,955 INFO L225 Difference]: With dead ends: 7637 [2019-11-20 02:41:30,955 INFO L226 Difference]: Without dead ends: 5427 [2019-11-20 02:41:30,958 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 02:41:30,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5427 states. [2019-11-20 02:41:31,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5427 to 4455. [2019-11-20 02:41:31,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4455 states. [2019-11-20 02:41:31,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4455 states to 4455 states and 6981 transitions. [2019-11-20 02:41:31,121 INFO L78 Accepts]: Start accepts. Automaton has 4455 states and 6981 transitions. Word has length 193 [2019-11-20 02:41:31,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:31,121 INFO L462 AbstractCegarLoop]: Abstraction has 4455 states and 6981 transitions. [2019-11-20 02:41:31,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:41:31,121 INFO L276 IsEmpty]: Start isEmpty. Operand 4455 states and 6981 transitions. [2019-11-20 02:41:31,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-20 02:41:31,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:31,124 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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-20 02:41:31,124 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:31,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:31,125 INFO L82 PathProgramCache]: Analyzing trace with hash -512641310, now seen corresponding path program 1 times [2019-11-20 02:41:31,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:41:31,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313969057] [2019-11-20 02:41:31,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:41:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:41:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:41:31,370 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:41:31,371 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 02:41:31,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:41:31 BoogieIcfgContainer [2019-11-20 02:41:31,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 02:41:31,504 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 02:41:31,505 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 02:41:31,517 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 02:41:31,517 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:40:43" (3/4) ... [2019-11-20 02:41:31,520 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 02:41:31,521 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 02:41:31,522 INFO L168 Benchmark]: Toolchain (without parser) took 50398.44 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 946.1 MB in the beginning and 1.9 GB in the end (delta: -942.8 MB). Peak memory consumption was 113.2 MB. Max. memory is 11.5 GB. [2019-11-20 02:41:31,522 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-20 02:41:31,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 704.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -201.4 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-20 02:41:31,523 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.72 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-20 02:41:31,523 INFO L168 Benchmark]: Boogie Preprocessor took 98.80 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-20 02:41:31,523 INFO L168 Benchmark]: RCFGBuilder took 1301.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.5 MB). Peak memory consumption was 97.5 MB. Max. memory is 11.5 GB. [2019-11-20 02:41:31,524 INFO L168 Benchmark]: TraceAbstraction took 48196.07 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 879.2 MB). Free memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: -851.7 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2019-11-20 02:41:31,524 INFO L168 Benchmark]: Witness Printer took 16.15 ms. Allocated memory is still 2.1 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:41:31,526 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 704.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 176.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -201.4 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.72 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 98.80 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1301.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.5 MB). Peak memory consumption was 97.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 48196.07 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 879.2 MB). Free memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: -851.7 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Witness Printer took 16.15 ms. Allocated memory is still 2.1 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1726]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={8:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={8:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={8:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={8:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={8:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={8:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={8:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={8:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={8:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={8:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={8:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={8:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={8:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1229] COND TRUE s->state == 8656 [L1570] EXPR s->session [L1570] EXPR s->s3 [L1570] EXPR (s->s3)->tmp.new_cipher [L1570] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1571] COND FALSE !(! tmp___9) [L1577] ret = __VERIFIER_nondet_int() [L1578] COND TRUE blastFlag == 2 [L1579] blastFlag = 3 VAL [init=1, SSLv3_server_data={8:0}] [L1583] COND FALSE !(ret <= 0) [L1588] s->state = 8672 [L1589] s->init_num = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1590] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={8:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={8:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={8:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1235] COND TRUE s->state == 8672 [L1599] ret = __VERIFIER_nondet_int() [L1600] COND TRUE blastFlag == 3 [L1601] blastFlag = 4 VAL [init=1, SSLv3_server_data={8:0}] [L1613] COND FALSE !(ret <= 0) [L1618] s->state = 8448 [L1619] s->hit VAL [init=1, SSLv3_server_data={8:0}] [L1619] COND TRUE s->hit [L1620] EXPR s->s3 [L1620] (s->s3)->tmp.next_state = 8640 [L1624] s->init_num = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={8:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={8:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={8:0}] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={8:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={8:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1223] COND TRUE s->state == 8640 [L1550] ret = __VERIFIER_nondet_int() [L1551] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={8:0}] [L1726] __VERIFIER_error() VAL [init=1, SSLv3_server_data={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 48.1s, OverallIterations: 64, TraceHistogramMax: 7, AutomataDifference: 27.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 13572 SDtfs, 5151 SDslu, 21508 SDs, 0 SdLazy, 14551 SolverSat, 771 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 521 GetRequests, 246 SyntacticMatches, 78 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4455occurred in iteration=63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 63 MinimizatonAttempts, 15957 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 7118 NumberOfCodeBlocks, 7118 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 6861 ConstructedInterpolants, 80 QuantifiedInterpolants, 3645564 SizeOfPredicates, 12 NumberOfNonLiveVariables, 604 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 64 InterpolantComputations, 62 PerfectInterpolantSequences, 6828/7070 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 02:41:33,379 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 02:41:33,381 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 02:41:33,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 02:41:33,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 02:41:33,398 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 02:41:33,399 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 02:41:33,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 02:41:33,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 02:41:33,404 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 02:41:33,405 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 02:41:33,406 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 02:41:33,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 02:41:33,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 02:41:33,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 02:41:33,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 02:41:33,411 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 02:41:33,412 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 02:41:33,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 02:41:33,417 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 02:41:33,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 02:41:33,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 02:41:33,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 02:41:33,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 02:41:33,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 02:41:33,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 02:41:33,425 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 02:41:33,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 02:41:33,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 02:41:33,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 02:41:33,428 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 02:41:33,428 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 02:41:33,429 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 02:41:33,430 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 02:41:33,431 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 02:41:33,431 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 02:41:33,432 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 02:41:33,432 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 02:41:33,433 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 02:41:33,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 02:41:33,434 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 02:41:33,435 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 02:41:33,449 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 02:41:33,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 02:41:33,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 02:41:33,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 02:41:33,451 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 02:41:33,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 02:41:33,452 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 02:41:33,452 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 02:41:33,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 02:41:33,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 02:41:33,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 02:41:33,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 02:41:33,454 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 02:41:33,454 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 02:41:33,454 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 02:41:33,454 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 02:41:33,455 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 02:41:33,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 02:41:33,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 02:41:33,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 02:41:33,456 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 02:41:33,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 02:41:33,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:41:33,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 02:41:33,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 02:41:33,457 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 02:41:33,457 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 02:41:33,457 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 02:41:33,458 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 02:41:33,458 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 02:41:33,458 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_602bad8f-be23-45b6-95aa-520e49b0e166/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 -> 62062b34b4a23d127db54f6c179288673b97bcab [2019-11-20 02:41:33,726 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 02:41:33,739 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 02:41:33,742 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 02:41:33,744 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 02:41:33,744 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 02:41:33,745 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-2.c [2019-11-20 02:41:33,803 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/data/8f28d1f91/0177a6facc2949b6b6ed98614d7b861a/FLAG7fc175d3d [2019-11-20 02:41:34,297 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 02:41:34,298 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-2.c [2019-11-20 02:41:34,316 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/data/8f28d1f91/0177a6facc2949b6b6ed98614d7b861a/FLAG7fc175d3d [2019-11-20 02:41:34,550 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/data/8f28d1f91/0177a6facc2949b6b6ed98614d7b861a [2019-11-20 02:41:34,552 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 02:41:34,553 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 02:41:34,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 02:41:34,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 02:41:34,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 02:41:34,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:41:34" (1/1) ... [2019-11-20 02:41:34,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2574741d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:34, skipping insertion in model container [2019-11-20 02:41:34,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:41:34" (1/1) ... [2019-11-20 02:41:34,566 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 02:41:34,638 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 02:41:35,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:41:35,146 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 02:41:35,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:41:35,345 INFO L192 MainTranslator]: Completed translation [2019-11-20 02:41:35,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:35 WrapperNode [2019-11-20 02:41:35,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 02:41:35,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 02:41:35,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 02:41:35,347 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 02:41:35,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:35" (1/1) ... [2019-11-20 02:41:35,403 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:35" (1/1) ... [2019-11-20 02:41:35,463 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 02:41:35,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 02:41:35,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 02:41:35,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 02:41:35,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:35" (1/1) ... [2019-11-20 02:41:35,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:35" (1/1) ... [2019-11-20 02:41:35,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:35" (1/1) ... [2019-11-20 02:41:35,490 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:35" (1/1) ... [2019-11-20 02:41:35,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:35" (1/1) ... [2019-11-20 02:41:35,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:35" (1/1) ... [2019-11-20 02:41:35,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:35" (1/1) ... [2019-11-20 02:41:35,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 02:41:35,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 02:41:35,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 02:41:35,586 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 02:41:35,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/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-20 02:41:35,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 02:41:35,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 02:41:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 02:41:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 02:41:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 02:41:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 02:41:35,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 02:41:35,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 02:41:35,937 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 02:41:39,109 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 02:41:39,109 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 02:41:39,111 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 02:41:39,112 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 02:41:39,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:41:39 BoogieIcfgContainer [2019-11-20 02:41:39,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 02:41:39,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 02:41:39,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 02:41:39,117 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 02:41:39,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:41:34" (1/3) ... [2019-11-20 02:41:39,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e263e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:41:39, skipping insertion in model container [2019-11-20 02:41:39,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:35" (2/3) ... [2019-11-20 02:41:39,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e263e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:41:39, skipping insertion in model container [2019-11-20 02:41:39,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:41:39" (3/3) ... [2019-11-20 02:41:39,122 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-2.c [2019-11-20 02:41:39,130 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 02:41:39,138 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 02:41:39,148 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 02:41:39,181 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 02:41:39,181 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 02:41:39,182 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 02:41:39,182 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 02:41:39,182 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 02:41:39,182 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 02:41:39,183 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 02:41:39,183 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 02:41:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-20 02:41:39,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 02:41:39,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:39,214 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:41:39,215 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:39,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:39,219 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756973, now seen corresponding path program 1 times [2019-11-20 02:41:39,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:41:39,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1830955846] [2019-11-20 02:41:39,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/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-20 02:41:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:39,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:41:39,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:41:39,507 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-20 02:41:39,508 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:41:39,531 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-20 02:41:39,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1830955846] [2019-11-20 02:41:39,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:39,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 02:41:39,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896242089] [2019-11-20 02:41:39,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:41:39,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:41:39,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:41:39,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:39,556 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-20 02:41:39,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:39,769 INFO L93 Difference]: Finished difference Result 564 states and 962 transitions. [2019-11-20 02:41:39,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:41:39,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-20 02:41:39,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:39,788 INFO L225 Difference]: With dead ends: 564 [2019-11-20 02:41:39,789 INFO L226 Difference]: Without dead ends: 385 [2019-11-20 02:41:39,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:39,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-11-20 02:41:39,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2019-11-20 02:41:39,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-20 02:41:39,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 584 transitions. [2019-11-20 02:41:39,895 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 584 transitions. Word has length 35 [2019-11-20 02:41:39,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:39,895 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 584 transitions. [2019-11-20 02:41:39,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:41:39,896 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 584 transitions. [2019-11-20 02:41:39,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 02:41:39,903 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:39,903 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 02:41:40,106 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:41:40,106 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:40,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:40,106 INFO L82 PathProgramCache]: Analyzing trace with hash -718881007, now seen corresponding path program 1 times [2019-11-20 02:41:40,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:41:40,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [674454517] [2019-11-20 02:41:40,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/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-20 02:41:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:40,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:41:40,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:41:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:41:40,336 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:41:40,360 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:41:40,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [674454517] [2019-11-20 02:41:40,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:40,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 02:41:40,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938169148] [2019-11-20 02:41:40,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:41:40,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:41:40,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:41:40,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:40,364 INFO L87 Difference]: Start difference. First operand 383 states and 584 transitions. Second operand 4 states. [2019-11-20 02:41:41,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:41,159 INFO L93 Difference]: Finished difference Result 879 states and 1352 transitions. [2019-11-20 02:41:41,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:41:41,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-20 02:41:41,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:41,164 INFO L225 Difference]: With dead ends: 879 [2019-11-20 02:41:41,165 INFO L226 Difference]: Without dead ends: 628 [2019-11-20 02:41:41,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:41,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-11-20 02:41:41,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 626. [2019-11-20 02:41:41,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-11-20 02:41:41,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 949 transitions. [2019-11-20 02:41:41,201 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 949 transitions. Word has length 58 [2019-11-20 02:41:41,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:41,202 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 949 transitions. [2019-11-20 02:41:41,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:41:41,206 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 949 transitions. [2019-11-20 02:41:41,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 02:41:41,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:41,214 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1] [2019-11-20 02:41:41,416 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:41:41,416 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:41,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:41,417 INFO L82 PathProgramCache]: Analyzing trace with hash 317355092, now seen corresponding path program 1 times [2019-11-20 02:41:41,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:41:41,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [108479960] [2019-11-20 02:41:41,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/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-20 02:41:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:41,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:41:41,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:41:41,773 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 02:41:41,774 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:41:41,823 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 02:41:41,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [108479960] [2019-11-20 02:41:41,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:41,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 02:41:41,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084861472] [2019-11-20 02:41:41,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:41:41,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:41:41,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:41:41,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:41,837 INFO L87 Difference]: Start difference. First operand 626 states and 949 transitions. Second operand 4 states. [2019-11-20 02:41:43,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:43,111 INFO L93 Difference]: Finished difference Result 1364 states and 2080 transitions. [2019-11-20 02:41:43,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:41:43,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-11-20 02:41:43,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:43,117 INFO L225 Difference]: With dead ends: 1364 [2019-11-20 02:41:43,117 INFO L226 Difference]: Without dead ends: 870 [2019-11-20 02:41:43,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:43,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2019-11-20 02:41:43,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2019-11-20 02:41:43,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2019-11-20 02:41:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1317 transitions. [2019-11-20 02:41:43,151 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1317 transitions. Word has length 119 [2019-11-20 02:41:43,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:43,151 INFO L462 AbstractCegarLoop]: Abstraction has 870 states and 1317 transitions. [2019-11-20 02:41:43,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:41:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1317 transitions. [2019-11-20 02:41:43,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-20 02:41:43,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:43,154 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-11-20 02:41:43,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:41:43,365 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:43,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:43,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1698938047, now seen corresponding path program 1 times [2019-11-20 02:41:43,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:41:43,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2054454464] [2019-11-20 02:41:43,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/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-20 02:41:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:43,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:41:43,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:41:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 02:41:43,674 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:41:43,718 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 02:41:43,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2054454464] [2019-11-20 02:41:43,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:41:43,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 02:41:43,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647726747] [2019-11-20 02:41:43,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:41:43,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:41:43,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:41:43,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:43,722 INFO L87 Difference]: Start difference. First operand 870 states and 1317 transitions. Second operand 4 states. [2019-11-20 02:41:44,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:41:44,551 INFO L93 Difference]: Finished difference Result 1852 states and 2814 transitions. [2019-11-20 02:41:44,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:41:44,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-20 02:41:44,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:41:44,558 INFO L225 Difference]: With dead ends: 1852 [2019-11-20 02:41:44,558 INFO L226 Difference]: Without dead ends: 1114 [2019-11-20 02:41:44,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:41:44,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2019-11-20 02:41:44,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1114. [2019-11-20 02:41:44,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1114 states. [2019-11-20 02:41:44,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1682 transitions. [2019-11-20 02:41:44,606 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1682 transitions. Word has length 147 [2019-11-20 02:41:44,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:41:44,607 INFO L462 AbstractCegarLoop]: Abstraction has 1114 states and 1682 transitions. [2019-11-20 02:41:44,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:41:44,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1682 transitions. [2019-11-20 02:41:44,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-20 02:41:44,610 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:41:44,611 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 02:41:44,812 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:41:44,813 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:41:44,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:41:44,813 INFO L82 PathProgramCache]: Analyzing trace with hash -618148538, now seen corresponding path program 1 times [2019-11-20 02:41:44,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:41:44,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [148092999] [2019-11-20 02:41:44,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:41:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:41:45,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 02:41:45,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:41:46,144 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:46,145 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-20 02:41:46,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:41:46,541 WARN L191 SmtUtils]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 02:41:46,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:46,544 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_176|], 2=[|v_#memory_$Pointer$.base_173|, |v_#memory_$Pointer$.base_172|]} [2019-11-20 02:41:46,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:46,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:46,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:46,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:46,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:46,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:46,676 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 02:41:46,676 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:41:46,891 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 02:41:46,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:46,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:46,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:46,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:46,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:46,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:46,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:46,945 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 02:41:46,946 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:41:47,057 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-20 02:41:47,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:47,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,083 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 02:41:47,084 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 02:41:47,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:47,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:41:47,143 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:98, output treesize:56 [2019-11-20 02:41:47,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,200 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:47,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 02:41:47,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:41:47,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:47,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:41:47,228 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 02:41:47,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,254 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:47,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 02:41:47,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:41:47,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:47,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:41:47,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 02:41:47,290 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_174|], 12=[|v_#memory_$Pointer$.base_179|]} [2019-11-20 02:41:47,299 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-20 02:41:47,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:47,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,402 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,409 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:47,409 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 53 [2019-11-20 02:41:47,410 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:41:47,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:47,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:41:47,442 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2019-11-20 02:41:47,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,475 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:47,475 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 02:41:47,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:41:47,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:47,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:41:47,502 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 02:41:47,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,526 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:47,526 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 02:41:47,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:41:47,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:47,559 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:41:47,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 02:41:47,572 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_172|], 20=[|v_#memory_$Pointer$.base_182|]} [2019-11-20 02:41:47,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,581 INFO L377 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 49 treesize of output 37 [2019-11-20 02:41:47,581 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:41:47,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:47,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:47,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:48,156 WARN L191 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-11-20 02:41:48,156 INFO L343 Elim1Store]: treesize reduction 34, result has 84.6 percent of original size [2019-11-20 02:41:48,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2019-11-20 02:41:48,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:48,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:48,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:48,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:48,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:48,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:48,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:48,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:48,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:48,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:48,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:48,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:48,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:48,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:48,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:48,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:48,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:48,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:48,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:48,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:48,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:48,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:48,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:48,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:48,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:48,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:48,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:48,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:48,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:48,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:41:48,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:48,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:41:48,208 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-11-20 02:41:48,599 WARN L191 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 37 [2019-11-20 02:41:48,599 INFO L567 ElimStorePlain]: treesize reduction 4218, result has 2.0 percent of original size [2019-11-20 02:41:48,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:41:48,600 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:83 [2019-11-20 02:41:48,682 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_175|], 30=[|v_#memory_$Pointer$.base_183|]} [2019-11-20 02:41:48,689 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-20 02:41:48,863 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 02:41:48,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:41:48,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:48,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:48,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:48,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:48,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:48,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:48,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:48,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:48,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:41:48,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:42:21,925 WARN L191 SmtUtils]: Spent 33.04 s on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2019-11-20 02:42:21,927 INFO L343 Elim1Store]: treesize reduction 22, result has 92.6 percent of original size [2019-11-20 02:42:21,928 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 104 treesize of output 338 [2019-11-20 02:42:21,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:42:21,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:42:21,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:42:21,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:42:21,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:42:21,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:42:21,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:42:21,938 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:45:49,581 WARN L191 SmtUtils]: Spent 3.46 m on a formula simplification. DAG size of input: 128 DAG size of output: 40 [2019-11-20 02:45:49,581 INFO L567 ElimStorePlain]: treesize reduction 11799, result has 0.8 percent of original size [2019-11-20 02:45:49,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:45:49,582 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:121, output treesize:83 [2019-11-20 02:45:49,633 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_192|], 30=[|v_#memory_$Pointer$.base_184|]} [2019-11-20 02:45:49,658 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 02:45:49,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:45:49,762 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-20 02:45:49,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:45:49,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:45:49,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:45:49,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:45:49,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:45:49,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:45:49,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:46:06,148 WARN L191 SmtUtils]: Spent 16.37 s on a formula simplification that was a NOOP. DAG size: 79 [2019-11-20 02:46:06,148 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:46:06,148 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 263 [2019-11-20 02:46:06,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:46:06,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:46:06,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,157 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:46:06,538 WARN L191 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 42 [2019-11-20 02:46:06,549 INFO L567 ElimStorePlain]: treesize reduction 4148, result has 2.2 percent of original size [2019-11-20 02:46:06,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:46:06,550 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:115, output treesize:92 [2019-11-20 02:46:06,609 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_173|], 2=[|v_#memory_int_193|], 20=[|v_#memory_$Pointer$.base_185|]} [2019-11-20 02:46:06,621 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-11-20 02:46:06,621 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-20 02:46:06,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:46:06,674 INFO L377 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 35 treesize of output 28 [2019-11-20 02:46:06,674 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:46:06,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:46:06,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:46:06,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:46:06,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:46:06,831 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 02:46:06,832 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:46:06,832 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 147 [2019-11-20 02:46:06,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:06,868 INFO L496 ElimStorePlain]: Start of recursive call 4: 80 dim-0 vars, End of recursive call: 80 dim-0 vars, and 9 xjuncts. [2019-11-20 02:46:14,189 WARN L191 SmtUtils]: Spent 7.32 s on a formula simplification that was a NOOP. DAG size: 671 [2019-11-20 02:46:14,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:46:14,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 02:46:14,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 02:46:14,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:46:14,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:14,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:46:14,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:14,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:46:14,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:46:14,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:46:14,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 02:46:14,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:14,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:46:14,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:46:14,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:14,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-11-20 02:46:14,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:14,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 02:46:14,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:14,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:46:14,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:46:14,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 02:46:14,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 02:46:14,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:46:14,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:14,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:46:14,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:46:14,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:46:14,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:46:14,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:46:14,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 160 dim-0 vars, and 1 xjuncts. [2019-11-20 02:46:14,285 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:123, output treesize:1134 [2019-11-20 02:46:15,138 WARN L191 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 815 DAG size of output: 24 [2019-11-20 02:46:15,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:46:15,151 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-11-20 02:46:15,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:46:15,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:46:15,181 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-20 02:46:15,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2019-11-20 02:46:15,269 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-11-20 02:46:15,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:46:15,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:46:15,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:46:15,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-11-20 02:46:15,593 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 64 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 02:46:15,593 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:46:15,669 INFO L377 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 38 treesize of output 32 [2019-11-20 02:46:15,669 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-20 02:46:15,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:46:15,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:46:15,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2019-11-20 02:46:15,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:46:15,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:46:15,764 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-20 02:46:15,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:46:15,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:46:15,776 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:15 [2019-11-20 02:46:15,831 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_189|], 2=[|v_#memory_$Pointer$.base_175|]} [2019-11-20 02:46:15,834 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-20 02:46:15,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:46:15,847 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-20 02:46:15,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:46:15,850 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-20 02:46:15,851 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:25 [2019-11-20 02:46:15,880 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 02:46:15,881 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 49 [2019-11-20 02:46:15,881 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:46:15,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:46:15,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 02:46:15,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:49 [2019-11-20 02:46:16,017 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-20 02:46:16,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:46:16,033 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 02:46:16,033 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-11-20 02:46:16,641 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-20 02:46:16,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:46:16,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 02:46:16,649 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-11-20 02:46:16,825 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_174|], 20=[|v_#memory_$Pointer$.base_193|]} [2019-11-20 02:46:16,834 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-20 02:46:16,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:46:16,900 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-20 02:46:16,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:46:16,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-20 02:46:16,915 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:90, output treesize:124 [2019-11-20 02:46:17,189 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-20 02:46:17,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:46:17,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 02:46:17,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-11-20 02:46:17,339 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-20 02:46:17,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:46:17,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 02:46:17,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-11-20 02:46:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 02:46:19,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [148092999] [2019-11-20 02:46:19,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 02:46:19,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-20 02:46:19,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540262787] [2019-11-20 02:46:19,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 02:46:19,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:46:19,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 02:46:19,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-20 02:46:19,655 INFO L87 Difference]: Start difference. First operand 1114 states and 1682 transitions. Second operand 13 states. [2019-11-20 02:48:13,351 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-20 02:48:17,062 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-20 02:50:27,635 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-20 02:50:47,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:50:47,177 INFO L93 Difference]: Finished difference Result 8057 states and 12222 transitions. [2019-11-20 02:50:47,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 02:50:47,180 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 164 [2019-11-20 02:50:47,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:50:47,218 INFO L225 Difference]: With dead ends: 8057 [2019-11-20 02:50:47,219 INFO L226 Difference]: Without dead ends: 6951 [2019-11-20 02:50:47,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 308 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2019-11-20 02:50:47,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6951 states. [2019-11-20 02:50:47,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6951 to 2828. [2019-11-20 02:50:47,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2019-11-20 02:50:47,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 4529 transitions. [2019-11-20 02:50:47,400 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 4529 transitions. Word has length 164 [2019-11-20 02:50:47,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:50:47,401 INFO L462 AbstractCegarLoop]: Abstraction has 2828 states and 4529 transitions. [2019-11-20 02:50:47,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 02:50:47,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 4529 transitions. [2019-11-20 02:50:47,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-20 02:50:47,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:50:47,407 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:50:47,614 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:50:47,614 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:50:47,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:50:47,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1989772676, now seen corresponding path program 1 times [2019-11-20 02:50:47,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:50:47,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2088026953] [2019-11-20 02:50:47,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:50:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:50:48,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-20 02:50:48,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:50:48,949 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:50:48,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-20 02:50:48,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:50:49,252 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 02:50:49,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:50:49,254 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_201|], 2=[|v_#memory_$Pointer$.base_198|, |v_#memory_$Pointer$.base_197|]} [2019-11-20 02:50:49,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 02:50:49,363 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:50:49,499 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 02:50:49,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:50:49,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 02:50:49,526 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:50:49,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:50:49,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,594 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-11-20 02:50:49,594 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 02:50:49,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:50:49,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:50:49,618 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:98, output treesize:56 [2019-11-20 02:50:49,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,649 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:50:49,649 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 02:50:49,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:50:49,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:50:49,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:50:49,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 02:50:49,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,684 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:50:49,684 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 02:50:49,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:50:49,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:50:49,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:50:49,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 02:50:49,703 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_199|], 12=[|v_#memory_$Pointer$.base_204|]} [2019-11-20 02:50:49,710 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-20 02:50:49,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:50:49,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,831 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:50:49,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 53 [2019-11-20 02:50:49,832 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:50:49,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:50:49,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:50:49,875 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2019-11-20 02:50:49,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,890 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:50:49,890 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 02:50:49,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:50:49,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:50:49,923 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:50:49,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 02:50:49,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:49,936 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:50:49,936 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 44 [2019-11-20 02:50:49,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:50:49,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:50:49,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:50:49,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 02:50:49,986 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_185|], 20=[|v_#memory_$Pointer$.base_207|]} [2019-11-20 02:50:50,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:50,003 INFO L377 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 49 treesize of output 37 [2019-11-20 02:50:50,004 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:50:50,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:50:50,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:50,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:50,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:50,737 WARN L191 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-11-20 02:50:50,737 INFO L343 Elim1Store]: treesize reduction 34, result has 84.6 percent of original size [2019-11-20 02:50:50,737 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2019-11-20 02:50:50,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:50:50,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:50:50,851 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 5 xjuncts. [2019-11-20 02:50:51,390 WARN L191 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 37 [2019-11-20 02:50:51,391 INFO L567 ElimStorePlain]: treesize reduction 9921, result has 0.8 percent of original size [2019-11-20 02:50:51,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:50:51,391 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:83 [2019-11-20 02:50:51,434 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_200|], 30=[|v_#memory_$Pointer$.base_208|]} [2019-11-20 02:50:51,442 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-20 02:50:51,551 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 02:50:51,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:50:51,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:51,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:51,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:51,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:51,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:51,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:51,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:51,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:51,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:50:51,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:51:24,612 WARN L191 SmtUtils]: Spent 33.04 s on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2019-11-20 02:51:24,613 INFO L343 Elim1Store]: treesize reduction 22, result has 92.6 percent of original size [2019-11-20 02:51:24,613 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 104 treesize of output 338 [2019-11-20 02:51:24,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:24,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:24,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:24,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:24,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:24,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:24,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:24,621 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:51:25,052 WARN L191 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 40 [2019-11-20 02:51:25,053 INFO L567 ElimStorePlain]: treesize reduction 13259, result has 0.7 percent of original size [2019-11-20 02:51:25,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:51:25,053 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:121, output treesize:83 [2019-11-20 02:51:25,085 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_206|], 30=[|v_#memory_$Pointer$.base_209|]} [2019-11-20 02:51:25,106 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-20 02:51:25,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:51:25,224 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-20 02:51:25,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:51:25,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:51:25,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:51:25,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:51:25,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:51:25,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:51:25,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:51:41,751 WARN L191 SmtUtils]: Spent 16.51 s on a formula simplification that was a NOOP. DAG size: 79 [2019-11-20 02:51:41,751 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:51:41,751 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 263 [2019-11-20 02:51:41,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:51:41,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:41,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:41,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:41,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:41,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:41,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:51:41,756 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:51:42,006 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 42 [2019-11-20 02:51:42,006 INFO L567 ElimStorePlain]: treesize reduction 5772, result has 1.6 percent of original size [2019-11-20 02:51:42,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:51:42,006 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:115, output treesize:92 [2019-11-20 02:51:42,084 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_186|], 2=[|v_#memory_int_207|], 20=[|v_#memory_$Pointer$.base_210|]} [2019-11-20 02:51:42,091 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-11-20 02:51:42,091 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-20 02:51:42,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:51:42,150 INFO L377 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 35 treesize of output 28 [2019-11-20 02:51:42,150 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:51:42,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:51:42,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:51:42,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:51:42,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:51:42,327 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 02:51:42,327 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:51:42,327 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 147 [2019-11-20 02:51:42,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:42,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:42,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:42,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:42,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:42,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:42,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:42,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:42,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:42,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:42,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:42,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:42,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:42,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:42,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:42,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:42,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:42,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:42,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:42,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:42,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:42,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:51:42,362 INFO L496 ElimStorePlain]: Start of recursive call 4: 142 dim-0 vars, End of recursive call: 142 dim-0 vars, and 17 xjuncts. [2019-11-20 02:52:05,321 WARN L191 SmtUtils]: Spent 22.96 s on a formula simplification that was a NOOP. DAG size: 1143 [2019-11-20 02:52:05,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:05,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 02:52:05,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 02:52:05,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:52:05,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:52:05,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 02:52:05,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:52:05,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:52:05,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:52:05,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:52:05,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-11-20 02:52:05,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:52:05,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 02:52:05,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:52:05,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:52:05,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:52:05,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 02:52:05,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:52:05,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:52:05,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:52:05,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 02:52:05,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:52:05,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:52:05,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:52:05,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 14 terms [2019-11-20 02:52:05,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:52:05,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 02:52:05,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:52:05,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:52:05,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 02:52:05,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:52:05,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:52:05,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:52:05,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:52:05,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:52:05,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:52:05,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-11-20 02:52:05,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:52:05,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:52:05,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 02:52:05,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 02:52:05,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:52:05,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:52:05,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:52:05,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 02:52:05,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:52:05,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 284 dim-0 vars, and 1 xjuncts. [2019-11-20 02:52:05,398 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:123, output treesize:2002 [2019-11-20 02:52:06,934 WARN L191 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 1550 DAG size of output: 25 [2019-11-20 02:52:06,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:52:06,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-11-20 02:52:06,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:52:06,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:06,955 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-20 02:52:06,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:35 [2019-11-20 02:52:07,007 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-11-20 02:52:07,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:52:07,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:07,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:52:07,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-11-20 02:52:07,360 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 64 proven. 98 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-20 02:52:07,360 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:52:07,435 INFO L377 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 38 treesize of output 32 [2019-11-20 02:52:07,436 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-20 02:52:07,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:07,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:52:07,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2019-11-20 02:52:07,523 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-20 02:52:07,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2088026953] [2019-11-20 02:52:07,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 02:52:07,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-11-20 02:52:07,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377291070] [2019-11-20 02:52:07,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:52:07,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:52:07,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:52:07,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-20 02:52:07,525 INFO L87 Difference]: Start difference. First operand 2828 states and 4529 transitions. Second operand 4 states. [2019-11-20 02:52:10,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:52:10,634 INFO L93 Difference]: Finished difference Result 7631 states and 12110 transitions. [2019-11-20 02:52:10,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:52:10,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-11-20 02:52:10,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:52:10,660 INFO L225 Difference]: With dead ends: 7631 [2019-11-20 02:52:10,661 INFO L226 Difference]: Without dead ends: 4811 [2019-11-20 02:52:10,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 318 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-20 02:52:10,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4811 states. [2019-11-20 02:52:10,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4811 to 3548. [2019-11-20 02:52:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3548 states. [2019-11-20 02:52:10,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3548 states to 3548 states and 5861 transitions. [2019-11-20 02:52:10,841 INFO L78 Accepts]: Start accepts. Automaton has 3548 states and 5861 transitions. Word has length 165 [2019-11-20 02:52:10,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:52:10,841 INFO L462 AbstractCegarLoop]: Abstraction has 3548 states and 5861 transitions. [2019-11-20 02:52:10,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:52:10,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3548 states and 5861 transitions. [2019-11-20 02:52:10,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-20 02:52:10,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:52:10,849 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1] [2019-11-20 02:52:11,095 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:52:11,096 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:52:11,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:52:11,096 INFO L82 PathProgramCache]: Analyzing trace with hash 928802567, now seen corresponding path program 1 times [2019-11-20 02:52:11,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:52:11,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1264221219] [2019-11-20 02:52:11,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:52:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:52:12,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 02:52:12,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:52:12,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:52:12,684 INFO L377 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 18 treesize of output 19 [2019-11-20 02:52:12,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:52:12,691 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:12,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:52:12,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 02:52:12,717 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:12,717 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 02:52:12,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:52:12,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:12,719 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-20 02:52:12,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 02:52:12,767 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 02:52:12,768 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:52:12,800 INFO L377 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 20 treesize of output 18 [2019-11-20 02:52:12,802 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:52:12,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:12,803 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:52:12,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:12,804 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-20 02:52:12,804 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-20 02:52:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 02:52:12,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1264221219] [2019-11-20 02:52:12,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:52:12,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-20 02:52:12,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002063190] [2019-11-20 02:52:12,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 02:52:12,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:52:12,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 02:52:12,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:52:12,837 INFO L87 Difference]: Start difference. First operand 3548 states and 5861 transitions. Second operand 7 states. [2019-11-20 02:52:21,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:52:21,326 INFO L93 Difference]: Finished difference Result 10656 states and 17146 transitions. [2019-11-20 02:52:21,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 02:52:21,328 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 172 [2019-11-20 02:52:21,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:52:21,364 INFO L225 Difference]: With dead ends: 10656 [2019-11-20 02:52:21,364 INFO L226 Difference]: Without dead ends: 7116 [2019-11-20 02:52:21,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-20 02:52:21,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7116 states. [2019-11-20 02:52:21,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7116 to 4242. [2019-11-20 02:52:21,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4242 states. [2019-11-20 02:52:21,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4242 states to 4242 states and 7119 transitions. [2019-11-20 02:52:21,570 INFO L78 Accepts]: Start accepts. Automaton has 4242 states and 7119 transitions. Word has length 172 [2019-11-20 02:52:21,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:52:21,571 INFO L462 AbstractCegarLoop]: Abstraction has 4242 states and 7119 transitions. [2019-11-20 02:52:21,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 02:52:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 4242 states and 7119 transitions. [2019-11-20 02:52:21,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-20 02:52:21,580 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:52:21,580 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1] [2019-11-20 02:52:21,788 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:52:21,789 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:52:21,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:52:21,789 INFO L82 PathProgramCache]: Analyzing trace with hash 876992459, now seen corresponding path program 1 times [2019-11-20 02:52:21,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:52:21,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [44838799] [2019-11-20 02:52:21,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:52:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:52:23,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 02:52:23,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:52:23,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:52:23,074 INFO L377 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 18 treesize of output 19 [2019-11-20 02:52:23,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:52:23,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:23,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:52:23,082 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 02:52:23,097 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:23,097 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 02:52:23,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:52:23,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:23,099 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-20 02:52:23,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 02:52:23,143 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 02:52:23,143 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:52:23,161 INFO L377 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 20 treesize of output 18 [2019-11-20 02:52:23,163 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:52:23,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:23,164 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:52:23,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:23,164 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-20 02:52:23,164 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-20 02:52:23,189 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 02:52:23,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [44838799] [2019-11-20 02:52:23,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:52:23,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-20 02:52:23,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694235836] [2019-11-20 02:52:23,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 02:52:23,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:52:23,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 02:52:23,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:52:23,192 INFO L87 Difference]: Start difference. First operand 4242 states and 7119 transitions. Second operand 7 states. [2019-11-20 02:52:29,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:52:29,809 INFO L93 Difference]: Finished difference Result 11308 states and 18368 transitions. [2019-11-20 02:52:29,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 02:52:29,810 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 173 [2019-11-20 02:52:29,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:52:29,845 INFO L225 Difference]: With dead ends: 11308 [2019-11-20 02:52:29,845 INFO L226 Difference]: Without dead ends: 7002 [2019-11-20 02:52:29,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-20 02:52:29,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7002 states. [2019-11-20 02:52:30,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7002 to 4272. [2019-11-20 02:52:30,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4272 states. [2019-11-20 02:52:30,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4272 states to 4272 states and 7163 transitions. [2019-11-20 02:52:30,069 INFO L78 Accepts]: Start accepts. Automaton has 4272 states and 7163 transitions. Word has length 173 [2019-11-20 02:52:30,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:52:30,070 INFO L462 AbstractCegarLoop]: Abstraction has 4272 states and 7163 transitions. [2019-11-20 02:52:30,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 02:52:30,070 INFO L276 IsEmpty]: Start isEmpty. Operand 4272 states and 7163 transitions. [2019-11-20 02:52:30,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 02:52:30,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:52:30,079 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 02:52:30,287 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:52:30,287 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:52:30,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:52:30,287 INFO L82 PathProgramCache]: Analyzing trace with hash 18609739, now seen corresponding path program 1 times [2019-11-20 02:52:30,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:52:30,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [393975083] [2019-11-20 02:52:30,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:52:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:52:30,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 02:52:30,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:52:30,668 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_224|, |v_#memory_$Pointer$.offset_200|], 4=[|v_#memory_int_224|]} [2019-11-20 02:52:30,669 INFO L377 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 109 treesize of output 73 [2019-11-20 02:52:30,670 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-20 02:52:30,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:30,684 INFO L377 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 73 treesize of output 49 [2019-11-20 02:52:30,684 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-20 02:52:30,702 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:30,751 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:30,752 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 55 [2019-11-20 02:52:30,752 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:52:38,862 WARN L191 SmtUtils]: Spent 8.11 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 02:52:38,862 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:38,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:52:38,862 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-20 02:52:38,869 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-20 02:52:38,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:52:38,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:38,871 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-20 02:52:38,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-20 02:52:38,939 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-20 02:52:38,940 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:52:38,975 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-20 02:52:38,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [393975083] [2019-11-20 02:52:38,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:52:38,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 02:52:38,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156736362] [2019-11-20 02:52:38,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:52:38,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:52:38,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:52:38,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:52:38,976 INFO L87 Difference]: Start difference. First operand 4272 states and 7163 transitions. Second operand 6 states. [2019-11-20 02:52:48,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:52:48,490 INFO L93 Difference]: Finished difference Result 10471 states and 17095 transitions. [2019-11-20 02:52:48,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:52:48,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2019-11-20 02:52:48,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:52:48,513 INFO L225 Difference]: With dead ends: 10471 [2019-11-20 02:52:48,514 INFO L226 Difference]: Without dead ends: 6689 [2019-11-20 02:52:48,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:52:48,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6689 states. [2019-11-20 02:52:48,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6689 to 4454. [2019-11-20 02:52:48,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-11-20 02:52:48,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 7428 transitions. [2019-11-20 02:52:48,758 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 7428 transitions. Word has length 178 [2019-11-20 02:52:48,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:52:48,758 INFO L462 AbstractCegarLoop]: Abstraction has 4454 states and 7428 transitions. [2019-11-20 02:52:48,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:52:48,759 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 7428 transitions. [2019-11-20 02:52:48,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 02:52:48,769 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:52:48,769 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 02:52:48,973 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:52:48,974 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:52:48,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:52:48,974 INFO L82 PathProgramCache]: Analyzing trace with hash 811662177, now seen corresponding path program 2 times [2019-11-20 02:52:48,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:52:48,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [294231094] [2019-11-20 02:52:48,974 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:52:49,586 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 02:52:49,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 02:52:49,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 02:52:49,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:52:49,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:52:49,620 INFO L377 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 18 treesize of output 19 [2019-11-20 02:52:49,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:52:49,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:49,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:52:49,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 02:52:49,647 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:49,647 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 02:52:49,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:52:49,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:49,649 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-20 02:52:49,649 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 02:52:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 70 proven. 1 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-20 02:52:49,670 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:52:49,716 INFO L377 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 22 treesize of output 20 [2019-11-20 02:52:49,718 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:52:49,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:49,719 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:52:49,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:49,720 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-20 02:52:49,721 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 02:52:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-20 02:52:49,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [294231094] [2019-11-20 02:52:49,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 02:52:49,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 02:52:49,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581871402] [2019-11-20 02:52:49,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:52:49,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:52:49,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:52:49,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:52:49,741 INFO L87 Difference]: Start difference. First operand 4454 states and 7428 transitions. Second operand 4 states. [2019-11-20 02:52:52,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:52:52,305 INFO L93 Difference]: Finished difference Result 7983 states and 12910 transitions. [2019-11-20 02:52:52,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:52:52,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-20 02:52:52,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:52:52,317 INFO L225 Difference]: With dead ends: 7983 [2019-11-20 02:52:52,317 INFO L226 Difference]: Without dead ends: 5626 [2019-11-20 02:52:52,320 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:52:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5626 states. [2019-11-20 02:52:52,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5626 to 4454. [2019-11-20 02:52:52,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4454 states. [2019-11-20 02:52:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 7366 transitions. [2019-11-20 02:52:52,503 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 7366 transitions. Word has length 178 [2019-11-20 02:52:52,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:52:52,504 INFO L462 AbstractCegarLoop]: Abstraction has 4454 states and 7366 transitions. [2019-11-20 02:52:52,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:52:52,504 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 7366 transitions. [2019-11-20 02:52:52,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 02:52:52,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:52:52,512 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:52:52,717 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:52:52,718 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:52:52,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:52:52,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1608757365, now seen corresponding path program 1 times [2019-11-20 02:52:52,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:52:52,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [437469357] [2019-11-20 02:52:52,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:52:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:52:53,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 02:52:53,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:52:53,172 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_248|, |v_#memory_$Pointer$.offset_224|], 4=[|v_#memory_int_249|]} [2019-11-20 02:52:53,173 INFO L377 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 109 treesize of output 73 [2019-11-20 02:52:53,173 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-20 02:52:53,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:53,183 INFO L377 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 73 treesize of output 49 [2019-11-20 02:52:53,184 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-20 02:52:53,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:53,220 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:52:53,220 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 55 [2019-11-20 02:52:53,220 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:53:01,348 WARN L191 SmtUtils]: Spent 8.13 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 02:53:01,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:01,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:53:01,349 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-20 02:53:01,356 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-20 02:53:01,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:53:01,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:01,357 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-20 02:53:01,357 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-20 02:53:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-20 02:53:01,383 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:53:01,423 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-20 02:53:01,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [437469357] [2019-11-20 02:53:01,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:53:01,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 02:53:01,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615599378] [2019-11-20 02:53:01,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:53:01,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:53:01,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:53:01,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:53:01,425 INFO L87 Difference]: Start difference. First operand 4454 states and 7366 transitions. Second operand 6 states. [2019-11-20 02:53:08,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:53:08,687 INFO L93 Difference]: Finished difference Result 11664 states and 18868 transitions. [2019-11-20 02:53:08,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:53:08,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2019-11-20 02:53:08,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:53:08,702 INFO L225 Difference]: With dead ends: 11664 [2019-11-20 02:53:08,702 INFO L226 Difference]: Without dead ends: 7229 [2019-11-20 02:53:08,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:53:08,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7229 states. [2019-11-20 02:53:08,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7229 to 5224. [2019-11-20 02:53:08,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5224 states. [2019-11-20 02:53:08,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5224 states to 5224 states and 8678 transitions. [2019-11-20 02:53:08,962 INFO L78 Accepts]: Start accepts. Automaton has 5224 states and 8678 transitions. Word has length 178 [2019-11-20 02:53:08,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:53:08,963 INFO L462 AbstractCegarLoop]: Abstraction has 5224 states and 8678 transitions. [2019-11-20 02:53:08,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:53:08,963 INFO L276 IsEmpty]: Start isEmpty. Operand 5224 states and 8678 transitions. [2019-11-20 02:53:08,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 02:53:08,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:53:08,978 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:53:09,182 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:53:09,182 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:53:09,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:53:09,182 INFO L82 PathProgramCache]: Analyzing trace with hash 5706741, now seen corresponding path program 2 times [2019-11-20 02:53:09,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:53:09,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [265782315] [2019-11-20 02:53:09,183 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:53:09,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 02:53:09,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 02:53:09,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 02:53:09,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:53:09,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:53:09,804 INFO L377 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 18 treesize of output 19 [2019-11-20 02:53:09,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:53:09,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:09,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:53:09,822 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 02:53:09,851 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:09,852 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-20 02:53:09,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:53:09,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:09,854 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-20 02:53:09,854 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 02:53:09,885 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 75 proven. 1 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-20 02:53:09,885 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:53:09,919 INFO L377 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 22 treesize of output 20 [2019-11-20 02:53:09,921 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:53:09,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:09,922 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:53:09,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:09,924 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-20 02:53:09,925 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 02:53:09,944 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-20 02:53:09,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [265782315] [2019-11-20 02:53:09,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 02:53:09,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 02:53:09,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770837737] [2019-11-20 02:53:09,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 02:53:09,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:53:09,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:53:09,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:53:09,946 INFO L87 Difference]: Start difference. First operand 5224 states and 8678 transitions. Second operand 4 states. [2019-11-20 02:53:13,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:53:13,188 INFO L93 Difference]: Finished difference Result 9138 states and 14781 transitions. [2019-11-20 02:53:13,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:53:13,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-20 02:53:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:53:13,197 INFO L225 Difference]: With dead ends: 9138 [2019-11-20 02:53:13,198 INFO L226 Difference]: Without dead ends: 6396 [2019-11-20 02:53:13,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:53:13,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6396 states. [2019-11-20 02:53:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6396 to 5224. [2019-11-20 02:53:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5224 states. [2019-11-20 02:53:13,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5224 states to 5224 states and 8598 transitions. [2019-11-20 02:53:13,405 INFO L78 Accepts]: Start accepts. Automaton has 5224 states and 8598 transitions. Word has length 178 [2019-11-20 02:53:13,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:53:13,405 INFO L462 AbstractCegarLoop]: Abstraction has 5224 states and 8598 transitions. [2019-11-20 02:53:13,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 02:53:13,405 INFO L276 IsEmpty]: Start isEmpty. Operand 5224 states and 8598 transitions. [2019-11-20 02:53:13,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 02:53:13,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:53:13,413 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:53:13,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:53:13,626 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:53:13,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:53:13,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1680379386, now seen corresponding path program 1 times [2019-11-20 02:53:13,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:53:13,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1374678147] [2019-11-20 02:53:13,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:53:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:53:14,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 02:53:14,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:53:14,009 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_267|, |v_#memory_$Pointer$.offset_243|], 4=[|v_#memory_int_269|]} [2019-11-20 02:53:14,010 INFO L377 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 109 treesize of output 73 [2019-11-20 02:53:14,010 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-20 02:53:14,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:14,019 INFO L377 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 73 treesize of output 49 [2019-11-20 02:53:14,020 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-20 02:53:14,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:14,093 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:14,093 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 55 [2019-11-20 02:53:14,094 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:53:22,250 WARN L191 SmtUtils]: Spent 8.16 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 02:53:22,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:22,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:53:22,251 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-20 02:53:22,258 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-20 02:53:22,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:53:22,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:22,259 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-20 02:53:22,260 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-20 02:53:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 02:53:22,281 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:53:22,316 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 02:53:22,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1374678147] [2019-11-20 02:53:22,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:53:22,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 02:53:22,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598341656] [2019-11-20 02:53:22,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:53:22,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:53:22,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:53:22,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:53:22,319 INFO L87 Difference]: Start difference. First operand 5224 states and 8598 transitions. Second operand 6 states. [2019-11-20 02:53:29,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:53:29,183 INFO L93 Difference]: Finished difference Result 13088 states and 21103 transitions. [2019-11-20 02:53:29,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:53:29,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2019-11-20 02:53:29,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:53:29,192 INFO L225 Difference]: With dead ends: 13088 [2019-11-20 02:53:29,192 INFO L226 Difference]: Without dead ends: 7883 [2019-11-20 02:53:29,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:53:29,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7883 states. [2019-11-20 02:53:29,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7883 to 5576. [2019-11-20 02:53:29,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5576 states. [2019-11-20 02:53:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5576 states to 5576 states and 9104 transitions. [2019-11-20 02:53:29,486 INFO L78 Accepts]: Start accepts. Automaton has 5576 states and 9104 transitions. Word has length 179 [2019-11-20 02:53:29,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:53:29,487 INFO L462 AbstractCegarLoop]: Abstraction has 5576 states and 9104 transitions. [2019-11-20 02:53:29,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:53:29,487 INFO L276 IsEmpty]: Start isEmpty. Operand 5576 states and 9104 transitions. [2019-11-20 02:53:29,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-20 02:53:29,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:53:29,494 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 02:53:29,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:53:29,701 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:53:29,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:53:29,701 INFO L82 PathProgramCache]: Analyzing trace with hash -12371526, now seen corresponding path program 1 times [2019-11-20 02:53:29,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:53:29,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2141245971] [2019-11-20 02:53:29,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:53:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:53:30,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 02:53:30,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:53:30,084 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_252|, |v_#memory_$Pointer$.base_276|], 4=[|v_#memory_int_278|]} [2019-11-20 02:53:30,085 INFO L377 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 109 treesize of output 85 [2019-11-20 02:53:30,085 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-20 02:53:30,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:30,094 INFO L377 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 85 treesize of output 49 [2019-11-20 02:53:30,095 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-20 02:53:30,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:30,132 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:30,133 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 55 [2019-11-20 02:53:30,133 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:53:38,277 WARN L191 SmtUtils]: Spent 8.14 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 02:53:38,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:38,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:53:38,277 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-20 02:53:38,291 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-20 02:53:38,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:53:38,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:38,294 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-20 02:53:38,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-20 02:53:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-20 02:53:38,324 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:53:38,376 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-20 02:53:38,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2141245971] [2019-11-20 02:53:38,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:53:38,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 02:53:38,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094733450] [2019-11-20 02:53:38,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:53:38,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:53:38,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:53:38,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:53:38,378 INFO L87 Difference]: Start difference. First operand 5576 states and 9104 transitions. Second operand 6 states. [2019-11-20 02:53:46,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:53:46,227 INFO L93 Difference]: Finished difference Result 12740 states and 20369 transitions. [2019-11-20 02:53:46,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:53:46,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-11-20 02:53:46,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:53:46,234 INFO L225 Difference]: With dead ends: 12740 [2019-11-20 02:53:46,234 INFO L226 Difference]: Without dead ends: 7770 [2019-11-20 02:53:46,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:53:46,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7770 states. [2019-11-20 02:53:46,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7770 to 5585. [2019-11-20 02:53:46,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5585 states. [2019-11-20 02:53:46,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5585 states to 5585 states and 9036 transitions. [2019-11-20 02:53:46,541 INFO L78 Accepts]: Start accepts. Automaton has 5585 states and 9036 transitions. Word has length 180 [2019-11-20 02:53:46,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:53:46,541 INFO L462 AbstractCegarLoop]: Abstraction has 5585 states and 9036 transitions. [2019-11-20 02:53:46,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:53:46,541 INFO L276 IsEmpty]: Start isEmpty. Operand 5585 states and 9036 transitions. [2019-11-20 02:53:46,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-20 02:53:46,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:53:46,548 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 02:53:46,749 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:53:46,749 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:53:46,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:53:46,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1495065988, now seen corresponding path program 1 times [2019-11-20 02:53:46,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:53:46,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [606696793] [2019-11-20 02:53:46,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:53:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:53:47,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 02:53:47,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:53:47,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:53:47,330 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 02:53:47,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:53:47,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:47,346 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-20 02:53:47,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 02:53:47,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:53:47,365 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:47,366 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 02:53:47,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:53:47,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:47,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:53:47,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 02:53:47,377 INFO L377 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-20 02:53:47,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:53:47,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:47,379 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-20 02:53:47,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 02:53:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-11-20 02:53:47,413 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:53:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-11-20 02:53:47,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [606696793] [2019-11-20 02:53:47,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:53:47,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 02:53:47,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163502121] [2019-11-20 02:53:47,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:53:47,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:53:47,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:53:47,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:53:47,489 INFO L87 Difference]: Start difference. First operand 5585 states and 9036 transitions. Second operand 6 states. [2019-11-20 02:53:52,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:53:52,065 INFO L93 Difference]: Finished difference Result 9756 states and 15425 transitions. [2019-11-20 02:53:52,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:53:52,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-11-20 02:53:52,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:53:52,071 INFO L225 Difference]: With dead ends: 9756 [2019-11-20 02:53:52,071 INFO L226 Difference]: Without dead ends: 6829 [2019-11-20 02:53:52,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 353 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:53:52,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6829 states. [2019-11-20 02:53:52,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6829 to 5585. [2019-11-20 02:53:52,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5585 states. [2019-11-20 02:53:52,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5585 states to 5585 states and 8940 transitions. [2019-11-20 02:53:52,230 INFO L78 Accepts]: Start accepts. Automaton has 5585 states and 8940 transitions. Word has length 180 [2019-11-20 02:53:52,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:53:52,230 INFO L462 AbstractCegarLoop]: Abstraction has 5585 states and 8940 transitions. [2019-11-20 02:53:52,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:53:52,231 INFO L276 IsEmpty]: Start isEmpty. Operand 5585 states and 8940 transitions. [2019-11-20 02:53:52,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-20 02:53:52,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:53:52,237 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 02:53:52,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:53:52,437 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:53:52,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:53:52,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1686899962, now seen corresponding path program 1 times [2019-11-20 02:53:52,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:53:52,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1024835289] [2019-11-20 02:53:52,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:53:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:53:53,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 02:53:53,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:53:53,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:53:53,081 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 02:53:53,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:53:53,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:53,089 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-20 02:53:53,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 02:53:53,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:53:53,102 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:53,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 02:53:53,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:53:53,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:53,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:53:53,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 02:53:53,115 INFO L377 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-20 02:53:53,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:53:53,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:53,117 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-20 02:53:53,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 02:53:53,139 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-11-20 02:53:53,139 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:53:53,206 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-11-20 02:53:53,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1024835289] [2019-11-20 02:53:53,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:53:53,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 02:53:53,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281477129] [2019-11-20 02:53:53,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:53:53,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:53:53,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:53:53,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:53:53,207 INFO L87 Difference]: Start difference. First operand 5585 states and 8940 transitions. Second operand 6 states. [2019-11-20 02:53:57,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:53:57,323 INFO L93 Difference]: Finished difference Result 9756 states and 15277 transitions. [2019-11-20 02:53:57,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:53:57,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2019-11-20 02:53:57,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:53:57,328 INFO L225 Difference]: With dead ends: 9756 [2019-11-20 02:53:57,328 INFO L226 Difference]: Without dead ends: 6829 [2019-11-20 02:53:57,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 355 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:53:57,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6829 states. [2019-11-20 02:53:57,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6829 to 5585. [2019-11-20 02:53:57,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5585 states. [2019-11-20 02:53:57,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5585 states to 5585 states and 8844 transitions. [2019-11-20 02:53:57,490 INFO L78 Accepts]: Start accepts. Automaton has 5585 states and 8844 transitions. Word has length 181 [2019-11-20 02:53:57,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:53:57,491 INFO L462 AbstractCegarLoop]: Abstraction has 5585 states and 8844 transitions. [2019-11-20 02:53:57,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:53:57,491 INFO L276 IsEmpty]: Start isEmpty. Operand 5585 states and 8844 transitions. [2019-11-20 02:53:57,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-20 02:53:57,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:53:57,496 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-20 02:53:57,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:53:57,700 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:53:57,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:53:57,700 INFO L82 PathProgramCache]: Analyzing trace with hash 829037769, now seen corresponding path program 1 times [2019-11-20 02:53:57,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:53:57,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [162555181] [2019-11-20 02:53:57,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:53:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:53:58,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 02:53:58,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:53:58,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:53:58,261 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-20 02:53:58,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:53:58,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:58,269 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-20 02:53:58,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 02:53:58,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 02:53:58,290 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:58,291 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-20 02:53:58,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:53:58,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:58,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:53:58,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 02:53:58,306 INFO L377 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-20 02:53:58,306 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 02:53:58,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:53:58,308 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-20 02:53:58,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 02:53:58,336 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-11-20 02:53:58,336 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:53:58,383 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-11-20 02:53:58,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [162555181] [2019-11-20 02:53:58,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:53:58,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 02:53:58,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224431589] [2019-11-20 02:53:58,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 02:53:58,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:53:58,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:53:58,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:53:58,385 INFO L87 Difference]: Start difference. First operand 5585 states and 8844 transitions. Second operand 6 states. [2019-11-20 02:54:02,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:54:02,310 INFO L93 Difference]: Finished difference Result 9656 states and 14999 transitions. [2019-11-20 02:54:02,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:54:02,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 182 [2019-11-20 02:54:02,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:54:02,316 INFO L225 Difference]: With dead ends: 9656 [2019-11-20 02:54:02,317 INFO L226 Difference]: Without dead ends: 6729 [2019-11-20 02:54:02,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 357 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:54:02,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6729 states. [2019-11-20 02:54:02,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6729 to 5585. [2019-11-20 02:54:02,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5585 states. [2019-11-20 02:54:02,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5585 states to 5585 states and 8748 transitions. [2019-11-20 02:54:02,578 INFO L78 Accepts]: Start accepts. Automaton has 5585 states and 8748 transitions. Word has length 182 [2019-11-20 02:54:02,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:54:02,578 INFO L462 AbstractCegarLoop]: Abstraction has 5585 states and 8748 transitions. [2019-11-20 02:54:02,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 02:54:02,578 INFO L276 IsEmpty]: Start isEmpty. Operand 5585 states and 8748 transitions. [2019-11-20 02:54:02,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-20 02:54:02,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:54:02,583 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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-20 02:54:02,783 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:54:02,784 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:54:02,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:54:02,784 INFO L82 PathProgramCache]: Analyzing trace with hash -512641310, now seen corresponding path program 1 times [2019-11-20 02:54:02,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:54:02,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1688411779] [2019-11-20 02:54:02,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:54:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:54:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:54:05,875 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-20 02:54:05,877 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 02:54:06,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 02:54:06,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:54:06 BoogieIcfgContainer [2019-11-20 02:54:06,300 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 02:54:06,300 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 02:54:06,300 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 02:54:06,300 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 02:54:06,301 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:41:39" (3/4) ... [2019-11-20 02:54:06,303 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 02:54:06,447 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_602bad8f-be23-45b6-95aa-520e49b0e166/bin/uautomizer/witness.graphml [2019-11-20 02:54:06,447 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 02:54:06,449 INFO L168 Benchmark]: Toolchain (without parser) took 751895.56 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 371.7 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 228.0 MB. Max. memory is 11.5 GB. [2019-11-20 02:54:06,449 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:54:06,449 INFO L168 Benchmark]: CACSL2BoogieTranslator took 791.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-20 02:54:06,452 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.98 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-20 02:54:06,453 INFO L168 Benchmark]: Boogie Preprocessor took 121.66 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-20 02:54:06,453 INFO L168 Benchmark]: RCFGBuilder took 3527.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.6 MB). Peak memory consumption was 95.6 MB. Max. memory is 11.5 GB. [2019-11-20 02:54:06,453 INFO L168 Benchmark]: TraceAbstraction took 747185.33 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 203.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -88.0 MB). Peak memory consumption was 115.5 MB. Max. memory is 11.5 GB. [2019-11-20 02:54:06,454 INFO L168 Benchmark]: Witness Printer took 147.56 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. [2019-11-20 02:54:06,460 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 791.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 116.98 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 121.66 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3527.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.6 MB). Peak memory consumption was 95.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 747185.33 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 203.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -88.0 MB). Peak memory consumption was 115.5 MB. Max. memory is 11.5 GB. * Witness Printer took 147.56 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1726]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={1723926188:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={1723926188:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={1723926188:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={1723926188:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={1723926188:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={1723926188:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={1723926188:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1229] COND TRUE s->state == 8656 [L1570] EXPR s->session [L1570] EXPR s->s3 [L1570] EXPR (s->s3)->tmp.new_cipher [L1570] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1571] COND FALSE !(! tmp___9) [L1577] ret = __VERIFIER_nondet_int() [L1578] COND TRUE blastFlag == 2 [L1579] blastFlag = 3 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1583] COND FALSE !(ret <= 0) [L1588] s->state = 8672 [L1589] s->init_num = 0 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1590] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={1723926188:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={1723926188:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1235] COND TRUE s->state == 8672 [L1599] ret = __VERIFIER_nondet_int() [L1600] COND TRUE blastFlag == 3 [L1601] blastFlag = 4 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1613] COND FALSE !(ret <= 0) [L1618] s->state = 8448 [L1619] s->hit VAL [init=1, SSLv3_server_data={1723926188:0}] [L1619] COND TRUE s->hit [L1620] EXPR s->s3 [L1620] (s->s3)->tmp.next_state = 8640 [L1624] s->init_num = 0 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={1723926188:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={1723926188:0}] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={1723926188:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={1723926188:0}] [L1223] COND TRUE s->state == 8640 [L1550] ret = __VERIFIER_nondet_int() [L1551] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={1723926188:0}] [L1726] __VERIFIER_error() VAL [init=1, SSLv3_server_data={1723926188:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 747.1s, OverallIterations: 18, TraceHistogramMax: 6, AutomataDifference: 339.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3652 SDtfs, 5590 SDslu, 8950 SDs, 0 SdLazy, 8285 SolverSat, 1292 SolverUnsat, 108 SolverUnknown, 0 SolverNotchecked, 327.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5293 GetRequests, 5175 SyntacticMatches, 12 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5585occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 25702 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 9.2s SatisfiabilityAnalysisTime, 387.4s InterpolantComputationTime, 2840 NumberOfCodeBlocks, 2840 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 5260 ConstructedInterpolants, 285 QuantifiedInterpolants, 5788539 SizeOfPredicates, 97 NumberOfNonLiveVariables, 6294 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 34 InterpolantComputations, 29 PerfectInterpolantSequences, 6186/6542 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...