./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.13.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_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/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 17194510d9b99ec25b25421f731ec156f7460313 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/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 17194510d9b99ec25b25421f731ec156f7460313 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 00:43:02,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:43:02,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:43:02,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:43:02,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:43:02,893 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:43:02,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:43:02,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:43:02,907 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:43:02,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:43:02,912 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:43:02,913 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:43:02,913 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:43:02,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:43:02,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:43:02,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:43:02,918 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:43:02,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:43:02,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:43:02,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:43:02,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:43:02,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:43:02,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:43:02,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:43:02,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:43:02,937 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:43:02,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:43:02,939 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:43:02,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:43:02,940 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:43:02,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:43:02,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:43:02,942 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:43:02,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:43:02,943 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:43:02,943 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:43:02,944 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:43:02,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:43:02,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:43:02,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:43:02,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:43:02,947 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 00:43:02,970 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:43:02,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:43:02,982 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:43:02,982 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:43:02,982 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:43:02,982 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:43:02,983 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:43:02,983 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:43:02,983 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:43:02,983 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:43:02,983 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:43:02,984 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:43:02,984 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:43:02,984 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:43:02,984 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:43:02,984 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:43:02,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:43:02,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:43:02,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:43:02,986 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:43:02,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:43:02,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:43:02,987 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:43:02,987 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:43:02,987 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:43:02,988 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 00:43:02,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:43:02,988 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:43:02,988 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_faae8d45-3f39-4719-8c25-587366c272db/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 -> 17194510d9b99ec25b25421f731ec156f7460313 [2019-11-20 00:43:03,151 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:43:03,159 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:43:03,162 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:43:03,167 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:43:03,168 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:43:03,169 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-2.c [2019-11-20 00:43:03,231 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/data/44e33a523/3ba366e084c644e8a9ada13be291ca76/FLAG091351ad0 [2019-11-20 00:43:03,672 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:43:03,673 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-2.c [2019-11-20 00:43:03,697 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/data/44e33a523/3ba366e084c644e8a9ada13be291ca76/FLAG091351ad0 [2019-11-20 00:43:03,932 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/data/44e33a523/3ba366e084c644e8a9ada13be291ca76 [2019-11-20 00:43:03,934 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:43:03,935 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:43:03,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:43:03,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:43:03,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:43:03,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:43:03" (1/1) ... [2019-11-20 00:43:03,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64b4d43c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:03, skipping insertion in model container [2019-11-20 00:43:03,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:43:03" (1/1) ... [2019-11-20 00:43:03,952 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:43:04,032 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:43:04,575 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:43:04,596 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:43:04,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:43:04,758 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:43:04,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:04 WrapperNode [2019-11-20 00:43:04,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:43:04,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:43:04,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:43:04,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:43:04,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:04" (1/1) ... [2019-11-20 00:43:04,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:04" (1/1) ... [2019-11-20 00:43:04,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:43:04,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:43:04,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:43:04,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:43:04,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:04" (1/1) ... [2019-11-20 00:43:04,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:04" (1/1) ... [2019-11-20 00:43:04,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:04" (1/1) ... [2019-11-20 00:43:04,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:04" (1/1) ... [2019-11-20 00:43:04,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:04" (1/1) ... [2019-11-20 00:43:04,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:04" (1/1) ... [2019-11-20 00:43:04,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:04" (1/1) ... [2019-11-20 00:43:04,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:43:04,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:43:04,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:43:04,976 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:43:04,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/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 00:43:05,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 00:43:05,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 00:43:05,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 00:43:05,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 00:43:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 00:43:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 00:43:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:43:05,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:43:05,235 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 00:43:06,075 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 00:43:06,075 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 00:43:06,076 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:43:06,076 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 00:43:06,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:43:06 BoogieIcfgContainer [2019-11-20 00:43:06,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:43:06,081 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:43:06,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:43:06,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:43:06,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:43:03" (1/3) ... [2019-11-20 00:43:06,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e631fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:43:06, skipping insertion in model container [2019-11-20 00:43:06,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:43:04" (2/3) ... [2019-11-20 00:43:06,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e631fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:43:06, skipping insertion in model container [2019-11-20 00:43:06,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:43:06" (3/3) ... [2019-11-20 00:43:06,087 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.13.i.cil-2.c [2019-11-20 00:43:06,096 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:43:06,101 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 00:43:06,110 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 00:43:06,131 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:43:06,132 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:43:06,132 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:43:06,132 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:43:06,132 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:43:06,132 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:43:06,132 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:43:06,133 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:43:06,150 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-20 00:43:06,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 00:43:06,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:06,157 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 00:43:06,157 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:06,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:06,162 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756972, now seen corresponding path program 1 times [2019-11-20 00:43:06,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:06,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846152900] [2019-11-20 00:43:06,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:06,472 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 00:43:06,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846152900] [2019-11-20 00:43:06,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:06,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:06,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972245755] [2019-11-20 00:43:06,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:06,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:06,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:06,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:06,493 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-20 00:43:07,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:07,047 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2019-11-20 00:43:07,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:07,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-20 00:43:07,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:07,068 INFO L225 Difference]: With dead ends: 323 [2019-11-20 00:43:07,068 INFO L226 Difference]: Without dead ends: 163 [2019-11-20 00:43:07,072 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 00:43:07,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-20 00:43:07,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-20 00:43:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 00:43:07,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2019-11-20 00:43:07,138 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2019-11-20 00:43:07,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:07,139 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2019-11-20 00:43:07,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:07,139 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2019-11-20 00:43:07,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-20 00:43:07,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:07,143 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 00:43:07,143 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:07,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:07,144 INFO L82 PathProgramCache]: Analyzing trace with hash 2027967358, now seen corresponding path program 1 times [2019-11-20 00:43:07,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:07,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350170189] [2019-11-20 00:43:07,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:07,294 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 00:43:07,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350170189] [2019-11-20 00:43:07,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:07,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:07,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566670020] [2019-11-20 00:43:07,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:07,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:07,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:07,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:07,297 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2019-11-20 00:43:07,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:07,667 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2019-11-20 00:43:07,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:07,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-20 00:43:07,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:07,670 INFO L225 Difference]: With dead ends: 290 [2019-11-20 00:43:07,670 INFO L226 Difference]: Without dead ends: 163 [2019-11-20 00:43:07,672 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 00:43:07,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-20 00:43:07,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-20 00:43:07,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 00:43:07,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2019-11-20 00:43:07,683 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2019-11-20 00:43:07,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:07,683 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2019-11-20 00:43:07,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:07,683 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2019-11-20 00:43:07,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 00:43:07,685 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:07,686 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 00:43:07,686 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:07,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:07,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1944321008, now seen corresponding path program 1 times [2019-11-20 00:43:07,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:07,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754444690] [2019-11-20 00:43:07,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:07,797 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 00:43:07,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754444690] [2019-11-20 00:43:07,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:07,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:07,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974740855] [2019-11-20 00:43:07,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:07,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:07,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:07,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:07,799 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2019-11-20 00:43:08,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:08,123 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2019-11-20 00:43:08,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:08,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-20 00:43:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:08,125 INFO L225 Difference]: With dead ends: 289 [2019-11-20 00:43:08,125 INFO L226 Difference]: Without dead ends: 162 [2019-11-20 00:43:08,126 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 00:43:08,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-20 00:43:08,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2019-11-20 00:43:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 00:43:08,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2019-11-20 00:43:08,136 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2019-11-20 00:43:08,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:08,136 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2019-11-20 00:43:08,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:08,136 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2019-11-20 00:43:08,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 00:43:08,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:08,138 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 00:43:08,139 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:08,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:08,139 INFO L82 PathProgramCache]: Analyzing trace with hash -2008072389, now seen corresponding path program 1 times [2019-11-20 00:43:08,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:08,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30820282] [2019-11-20 00:43:08,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:08,210 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 00:43:08,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30820282] [2019-11-20 00:43:08,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:08,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:08,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954667000] [2019-11-20 00:43:08,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:08,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:08,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:08,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:08,212 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2019-11-20 00:43:08,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:08,536 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2019-11-20 00:43:08,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:08,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-20 00:43:08,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:08,538 INFO L225 Difference]: With dead ends: 287 [2019-11-20 00:43:08,539 INFO L226 Difference]: Without dead ends: 160 [2019-11-20 00:43:08,539 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 00:43:08,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-20 00:43:08,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2019-11-20 00:43:08,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 00:43:08,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2019-11-20 00:43:08,559 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2019-11-20 00:43:08,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:08,560 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2019-11-20 00:43:08,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:08,561 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2019-11-20 00:43:08,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 00:43:08,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:08,566 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 00:43:08,566 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:08,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:08,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1467926917, now seen corresponding path program 1 times [2019-11-20 00:43:08,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:08,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442662111] [2019-11-20 00:43:08,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:08,629 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 00:43:08,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442662111] [2019-11-20 00:43:08,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:08,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:08,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607590660] [2019-11-20 00:43:08,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:08,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:08,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:08,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:08,632 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2019-11-20 00:43:08,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:08,943 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2019-11-20 00:43:08,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:08,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-20 00:43:08,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:08,946 INFO L225 Difference]: With dead ends: 286 [2019-11-20 00:43:08,946 INFO L226 Difference]: Without dead ends: 159 [2019-11-20 00:43:08,946 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 00:43:08,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-20 00:43:08,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-20 00:43:08,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 00:43:08,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2019-11-20 00:43:08,954 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2019-11-20 00:43:08,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:08,955 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2019-11-20 00:43:08,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:08,955 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2019-11-20 00:43:08,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 00:43:08,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:08,957 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 00:43:08,957 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:08,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:08,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1078741852, now seen corresponding path program 1 times [2019-11-20 00:43:08,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:08,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388552091] [2019-11-20 00:43:08,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:09,007 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 00:43:09,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388552091] [2019-11-20 00:43:09,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:09,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:09,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349987866] [2019-11-20 00:43:09,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:09,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:09,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:09,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:09,009 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2019-11-20 00:43:09,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:09,341 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-11-20 00:43:09,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:09,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-20 00:43:09,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:09,343 INFO L225 Difference]: With dead ends: 286 [2019-11-20 00:43:09,343 INFO L226 Difference]: Without dead ends: 159 [2019-11-20 00:43:09,344 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 00:43:09,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-20 00:43:09,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-20 00:43:09,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 00:43:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2019-11-20 00:43:09,350 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2019-11-20 00:43:09,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:09,350 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2019-11-20 00:43:09,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:09,350 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2019-11-20 00:43:09,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-20 00:43:09,359 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:09,359 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 00:43:09,359 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:09,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:09,360 INFO L82 PathProgramCache]: Analyzing trace with hash 231094087, now seen corresponding path program 1 times [2019-11-20 00:43:09,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:09,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964807414] [2019-11-20 00:43:09,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:09,437 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 00:43:09,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964807414] [2019-11-20 00:43:09,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:09,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:09,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579013670] [2019-11-20 00:43:09,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:09,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:09,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:09,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:09,442 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2019-11-20 00:43:09,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:09,711 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2019-11-20 00:43:09,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:09,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-20 00:43:09,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:09,713 INFO L225 Difference]: With dead ends: 286 [2019-11-20 00:43:09,713 INFO L226 Difference]: Without dead ends: 159 [2019-11-20 00:43:09,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 00:43:09,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-20 00:43:09,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-20 00:43:09,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 00:43:09,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2019-11-20 00:43:09,718 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2019-11-20 00:43:09,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:09,719 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2019-11-20 00:43:09,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:09,719 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2019-11-20 00:43:09,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-20 00:43:09,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:09,720 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 00:43:09,720 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:09,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:09,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1862851913, now seen corresponding path program 1 times [2019-11-20 00:43:09,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:09,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927053397] [2019-11-20 00:43:09,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:09,772 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 00:43:09,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927053397] [2019-11-20 00:43:09,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:09,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:09,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340742402] [2019-11-20 00:43:09,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:09,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:09,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:09,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:09,774 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2019-11-20 00:43:10,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:10,106 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2019-11-20 00:43:10,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:10,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-20 00:43:10,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:10,108 INFO L225 Difference]: With dead ends: 286 [2019-11-20 00:43:10,108 INFO L226 Difference]: Without dead ends: 159 [2019-11-20 00:43:10,108 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 00:43:10,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-20 00:43:10,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-20 00:43:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 00:43:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2019-11-20 00:43:10,115 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2019-11-20 00:43:10,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:10,115 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2019-11-20 00:43:10,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:10,115 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2019-11-20 00:43:10,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-20 00:43:10,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:10,117 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 00:43:10,118 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:10,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:10,118 INFO L82 PathProgramCache]: Analyzing trace with hash 589286348, now seen corresponding path program 1 times [2019-11-20 00:43:10,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:10,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969099245] [2019-11-20 00:43:10,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:10,189 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 00:43:10,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969099245] [2019-11-20 00:43:10,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:10,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:10,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614872067] [2019-11-20 00:43:10,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:10,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:10,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:10,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:10,191 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2019-11-20 00:43:10,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:10,459 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2019-11-20 00:43:10,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:10,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-20 00:43:10,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:10,461 INFO L225 Difference]: With dead ends: 276 [2019-11-20 00:43:10,461 INFO L226 Difference]: Without dead ends: 149 [2019-11-20 00:43:10,462 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 00:43:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-20 00:43:10,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-11-20 00:43:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-20 00:43:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2019-11-20 00:43:10,466 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2019-11-20 00:43:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:10,466 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2019-11-20 00:43:10,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2019-11-20 00:43:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-20 00:43:10,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:10,467 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 00:43:10,468 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:10,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:10,468 INFO L82 PathProgramCache]: Analyzing trace with hash -350273228, now seen corresponding path program 1 times [2019-11-20 00:43:10,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:10,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491966192] [2019-11-20 00:43:10,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:10,520 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 00:43:10,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491966192] [2019-11-20 00:43:10,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:10,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:10,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682894484] [2019-11-20 00:43:10,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:10,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:10,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:10,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:10,522 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2019-11-20 00:43:10,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:10,883 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2019-11-20 00:43:10,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:10,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-20 00:43:10,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:10,885 INFO L225 Difference]: With dead ends: 316 [2019-11-20 00:43:10,886 INFO L226 Difference]: Without dead ends: 189 [2019-11-20 00:43:10,886 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 00:43:10,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-20 00:43:10,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-20 00:43:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 00:43:10,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2019-11-20 00:43:10,891 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2019-11-20 00:43:10,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:10,892 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2019-11-20 00:43:10,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:10,892 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2019-11-20 00:43:10,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-20 00:43:10,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:10,893 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 00:43:10,893 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:10,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:10,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1467398046, now seen corresponding path program 1 times [2019-11-20 00:43:10,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:10,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309221371] [2019-11-20 00:43:10,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:10,963 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 00:43:10,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309221371] [2019-11-20 00:43:10,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:10,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:10,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802676045] [2019-11-20 00:43:10,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:10,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:10,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:10,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:10,968 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2019-11-20 00:43:11,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:11,311 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2019-11-20 00:43:11,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:11,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-20 00:43:11,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:11,314 INFO L225 Difference]: With dead ends: 338 [2019-11-20 00:43:11,314 INFO L226 Difference]: Without dead ends: 189 [2019-11-20 00:43:11,315 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 00:43:11,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-20 00:43:11,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-20 00:43:11,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 00:43:11,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2019-11-20 00:43:11,323 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2019-11-20 00:43:11,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:11,324 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2019-11-20 00:43:11,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:11,324 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2019-11-20 00:43:11,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 00:43:11,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:11,325 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 00:43:11,325 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:11,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:11,326 INFO L82 PathProgramCache]: Analyzing trace with hash -2142100496, now seen corresponding path program 1 times [2019-11-20 00:43:11,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:11,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568897006] [2019-11-20 00:43:11,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:11,367 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 00:43:11,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568897006] [2019-11-20 00:43:11,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:11,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:11,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552303667] [2019-11-20 00:43:11,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:11,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:11,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:11,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:11,369 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2019-11-20 00:43:11,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:11,717 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2019-11-20 00:43:11,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:11,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-20 00:43:11,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:11,719 INFO L225 Difference]: With dead ends: 337 [2019-11-20 00:43:11,719 INFO L226 Difference]: Without dead ends: 188 [2019-11-20 00:43:11,720 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 00:43:11,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-20 00:43:11,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2019-11-20 00:43:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 00:43:11,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2019-11-20 00:43:11,727 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2019-11-20 00:43:11,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:11,727 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2019-11-20 00:43:11,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:11,728 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2019-11-20 00:43:11,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 00:43:11,728 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:11,729 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 00:43:11,729 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:11,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:11,729 INFO L82 PathProgramCache]: Analyzing trace with hash 2089115419, now seen corresponding path program 1 times [2019-11-20 00:43:11,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:11,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143722330] [2019-11-20 00:43:11,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:11,781 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 00:43:11,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143722330] [2019-11-20 00:43:11,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:11,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:11,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382785491] [2019-11-20 00:43:11,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:11,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:11,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:11,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:11,783 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2019-11-20 00:43:12,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:12,153 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2019-11-20 00:43:12,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:12,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-20 00:43:12,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:12,155 INFO L225 Difference]: With dead ends: 335 [2019-11-20 00:43:12,155 INFO L226 Difference]: Without dead ends: 186 [2019-11-20 00:43:12,155 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 00:43:12,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-20 00:43:12,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2019-11-20 00:43:12,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 00:43:12,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2019-11-20 00:43:12,162 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2019-11-20 00:43:12,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:12,163 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2019-11-20 00:43:12,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:12,163 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2019-11-20 00:43:12,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 00:43:12,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:12,164 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 00:43:12,164 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:12,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:12,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1665706405, now seen corresponding path program 1 times [2019-11-20 00:43:12,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:12,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930663322] [2019-11-20 00:43:12,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:12,215 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 00:43:12,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930663322] [2019-11-20 00:43:12,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:12,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:12,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717742615] [2019-11-20 00:43:12,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:12,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:12,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:12,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:12,217 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2019-11-20 00:43:12,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:12,580 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2019-11-20 00:43:12,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:12,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-20 00:43:12,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:12,582 INFO L225 Difference]: With dead ends: 334 [2019-11-20 00:43:12,582 INFO L226 Difference]: Without dead ends: 185 [2019-11-20 00:43:12,582 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 00:43:12,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-20 00:43:12,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-20 00:43:12,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 00:43:12,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2019-11-20 00:43:12,588 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2019-11-20 00:43:12,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:12,588 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2019-11-20 00:43:12,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:12,588 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2019-11-20 00:43:12,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 00:43:12,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:12,589 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 00:43:12,589 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:12,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:12,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1276521340, now seen corresponding path program 1 times [2019-11-20 00:43:12,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:12,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427062588] [2019-11-20 00:43:12,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:12,664 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 00:43:12,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427062588] [2019-11-20 00:43:12,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:12,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:12,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575150885] [2019-11-20 00:43:12,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:12,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:12,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:12,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:12,666 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2019-11-20 00:43:13,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:13,029 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2019-11-20 00:43:13,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:13,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-20 00:43:13,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:13,031 INFO L225 Difference]: With dead ends: 334 [2019-11-20 00:43:13,031 INFO L226 Difference]: Without dead ends: 185 [2019-11-20 00:43:13,032 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 00:43:13,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-20 00:43:13,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-20 00:43:13,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 00:43:13,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2019-11-20 00:43:13,037 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2019-11-20 00:43:13,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:13,037 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-11-20 00:43:13,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:13,037 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2019-11-20 00:43:13,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-20 00:43:13,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:13,038 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 00:43:13,038 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:13,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:13,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1605102745, now seen corresponding path program 1 times [2019-11-20 00:43:13,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:13,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352720338] [2019-11-20 00:43:13,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:13,079 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 00:43:13,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352720338] [2019-11-20 00:43:13,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:13,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:13,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850689800] [2019-11-20 00:43:13,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:13,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:13,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:13,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:13,081 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2019-11-20 00:43:13,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:13,423 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2019-11-20 00:43:13,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:13,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-20 00:43:13,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:13,425 INFO L225 Difference]: With dead ends: 334 [2019-11-20 00:43:13,425 INFO L226 Difference]: Without dead ends: 185 [2019-11-20 00:43:13,425 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 00:43:13,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-20 00:43:13,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-20 00:43:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 00:43:13,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-11-20 00:43:13,430 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2019-11-20 00:43:13,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:13,431 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-11-20 00:43:13,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:13,431 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2019-11-20 00:43:13,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-20 00:43:13,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:13,432 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 00:43:13,432 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:13,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:13,433 INFO L82 PathProgramCache]: Analyzing trace with hash 775324969, now seen corresponding path program 1 times [2019-11-20 00:43:13,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:13,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197650660] [2019-11-20 00:43:13,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:13,483 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 00:43:13,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197650660] [2019-11-20 00:43:13,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:13,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:13,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345627233] [2019-11-20 00:43:13,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:13,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:13,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:13,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:13,484 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2019-11-20 00:43:13,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:13,815 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2019-11-20 00:43:13,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:13,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-20 00:43:13,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:13,817 INFO L225 Difference]: With dead ends: 334 [2019-11-20 00:43:13,817 INFO L226 Difference]: Without dead ends: 185 [2019-11-20 00:43:13,818 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 00:43:13,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-20 00:43:13,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-20 00:43:13,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 00:43:13,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2019-11-20 00:43:13,823 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2019-11-20 00:43:13,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:13,823 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2019-11-20 00:43:13,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:13,823 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2019-11-20 00:43:13,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-20 00:43:13,824 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:13,824 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 00:43:13,824 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:13,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:13,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1235689452, now seen corresponding path program 1 times [2019-11-20 00:43:13,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:13,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101169251] [2019-11-20 00:43:13,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:13,865 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 00:43:13,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101169251] [2019-11-20 00:43:13,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:13,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:13,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961997384] [2019-11-20 00:43:13,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:13,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:13,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:13,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:13,867 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2019-11-20 00:43:14,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:14,165 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2019-11-20 00:43:14,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:14,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-20 00:43:14,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:14,167 INFO L225 Difference]: With dead ends: 324 [2019-11-20 00:43:14,167 INFO L226 Difference]: Without dead ends: 175 [2019-11-20 00:43:14,167 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 00:43:14,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-20 00:43:14,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2019-11-20 00:43:14,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-20 00:43:14,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2019-11-20 00:43:14,172 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2019-11-20 00:43:14,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:14,172 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2019-11-20 00:43:14,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:14,172 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2019-11-20 00:43:14,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 00:43:14,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:14,173 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 00:43:14,173 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:14,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:14,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1988306166, now seen corresponding path program 1 times [2019-11-20 00:43:14,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:14,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143411653] [2019-11-20 00:43:14,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:14,242 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 00:43:14,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143411653] [2019-11-20 00:43:14,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:14,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:14,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326488478] [2019-11-20 00:43:14,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:14,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:14,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:14,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:14,245 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2019-11-20 00:43:14,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:14,768 INFO L93 Difference]: Finished difference Result 424 states and 639 transitions. [2019-11-20 00:43:14,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:14,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-20 00:43:14,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:14,771 INFO L225 Difference]: With dead ends: 424 [2019-11-20 00:43:14,771 INFO L226 Difference]: Without dead ends: 275 [2019-11-20 00:43:14,771 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 00:43:14,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-20 00:43:14,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 198. [2019-11-20 00:43:14,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-20 00:43:14,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2019-11-20 00:43:14,779 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2019-11-20 00:43:14,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:14,780 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2019-11-20 00:43:14,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:14,780 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2019-11-20 00:43:14,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 00:43:14,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:14,781 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 00:43:14,781 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:14,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:14,782 INFO L82 PathProgramCache]: Analyzing trace with hash -2060692724, now seen corresponding path program 1 times [2019-11-20 00:43:14,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:14,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692143257] [2019-11-20 00:43:14,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:14,857 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 00:43:14,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692143257] [2019-11-20 00:43:14,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:14,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:14,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864886752] [2019-11-20 00:43:14,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:14,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:14,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:14,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:14,859 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2019-11-20 00:43:15,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:15,335 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2019-11-20 00:43:15,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:15,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-20 00:43:15,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:15,338 INFO L225 Difference]: With dead ends: 427 [2019-11-20 00:43:15,338 INFO L226 Difference]: Without dead ends: 248 [2019-11-20 00:43:15,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 00:43:15,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-20 00:43:15,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2019-11-20 00:43:15,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-20 00:43:15,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2019-11-20 00:43:15,345 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2019-11-20 00:43:15,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:15,345 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2019-11-20 00:43:15,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:15,345 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2019-11-20 00:43:15,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-20 00:43:15,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:15,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 00:43:15,346 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:15,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:15,347 INFO L82 PathProgramCache]: Analyzing trace with hash 880688961, now seen corresponding path program 1 times [2019-11-20 00:43:15,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:15,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857008994] [2019-11-20 00:43:15,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:15,416 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 00:43:15,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857008994] [2019-11-20 00:43:15,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:15,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:15,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938202835] [2019-11-20 00:43:15,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:15,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:15,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:15,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:15,418 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2019-11-20 00:43:15,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:15,823 INFO L93 Difference]: Finished difference Result 494 states and 761 transitions. [2019-11-20 00:43:15,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:15,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-20 00:43:15,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:15,825 INFO L225 Difference]: With dead ends: 494 [2019-11-20 00:43:15,825 INFO L226 Difference]: Without dead ends: 291 [2019-11-20 00:43:15,826 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 00:43:15,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-20 00:43:15,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 223. [2019-11-20 00:43:15,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-20 00:43:15,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2019-11-20 00:43:15,832 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2019-11-20 00:43:15,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:15,833 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2019-11-20 00:43:15,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:15,833 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2019-11-20 00:43:15,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-20 00:43:15,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:15,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, 1, 1, 1, 1, 1, 1] [2019-11-20 00:43:15,834 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:15,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:15,834 INFO L82 PathProgramCache]: Analyzing trace with hash 979572393, now seen corresponding path program 1 times [2019-11-20 00:43:15,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:15,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306482115] [2019-11-20 00:43:15,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:15,899 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 00:43:15,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306482115] [2019-11-20 00:43:15,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:15,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:15,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063260544] [2019-11-20 00:43:15,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:15,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:15,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:15,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:15,902 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2019-11-20 00:43:16,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:16,365 INFO L93 Difference]: Finished difference Result 495 states and 761 transitions. [2019-11-20 00:43:16,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:16,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-20 00:43:16,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:16,367 INFO L225 Difference]: With dead ends: 495 [2019-11-20 00:43:16,367 INFO L226 Difference]: Without dead ends: 291 [2019-11-20 00:43:16,368 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 00:43:16,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-20 00:43:16,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 233. [2019-11-20 00:43:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-20 00:43:16,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2019-11-20 00:43:16,374 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 80 [2019-11-20 00:43:16,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:16,375 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2019-11-20 00:43:16,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:16,375 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2019-11-20 00:43:16,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 00:43:16,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:16,376 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 00:43:16,376 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:16,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:16,377 INFO L82 PathProgramCache]: Analyzing trace with hash 294608539, now seen corresponding path program 1 times [2019-11-20 00:43:16,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:16,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322676205] [2019-11-20 00:43:16,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:16,437 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 00:43:16,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322676205] [2019-11-20 00:43:16,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:16,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:16,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432801074] [2019-11-20 00:43:16,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:16,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:16,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:16,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:16,439 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2019-11-20 00:43:16,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:16,942 INFO L93 Difference]: Finished difference Result 499 states and 772 transitions. [2019-11-20 00:43:16,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:16,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-20 00:43:16,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:16,945 INFO L225 Difference]: With dead ends: 499 [2019-11-20 00:43:16,945 INFO L226 Difference]: Without dead ends: 285 [2019-11-20 00:43:16,945 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 00:43:16,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-20 00:43:16,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2019-11-20 00:43:16,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 00:43:16,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2019-11-20 00:43:16,953 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 81 [2019-11-20 00:43:16,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:16,953 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2019-11-20 00:43:16,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:16,953 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2019-11-20 00:43:16,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 00:43:16,954 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:16,954 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 00:43:16,954 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:16,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:16,955 INFO L82 PathProgramCache]: Analyzing trace with hash 354437512, now seen corresponding path program 1 times [2019-11-20 00:43:16,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:16,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102480924] [2019-11-20 00:43:16,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:17,015 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 00:43:17,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102480924] [2019-11-20 00:43:17,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:17,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:17,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796865940] [2019-11-20 00:43:17,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:17,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:17,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:17,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:17,018 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2019-11-20 00:43:17,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:17,417 INFO L93 Difference]: Finished difference Result 500 states and 772 transitions. [2019-11-20 00:43:17,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:17,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 00:43:17,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:17,419 INFO L225 Difference]: With dead ends: 500 [2019-11-20 00:43:17,419 INFO L226 Difference]: Without dead ends: 285 [2019-11-20 00:43:17,420 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 00:43:17,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-20 00:43:17,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2019-11-20 00:43:17,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 00:43:17,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2019-11-20 00:43:17,427 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2019-11-20 00:43:17,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:17,428 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2019-11-20 00:43:17,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:17,428 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2019-11-20 00:43:17,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-20 00:43:17,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:17,429 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 00:43:17,429 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:17,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:17,430 INFO L82 PathProgramCache]: Analyzing trace with hash -2012257082, now seen corresponding path program 1 times [2019-11-20 00:43:17,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:17,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174727267] [2019-11-20 00:43:17,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:17,479 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 00:43:17,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174727267] [2019-11-20 00:43:17,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:17,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:17,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016795220] [2019-11-20 00:43:17,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:17,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:17,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:17,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:17,481 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2019-11-20 00:43:17,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:17,821 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2019-11-20 00:43:17,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:17,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-20 00:43:17,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:17,823 INFO L225 Difference]: With dead ends: 475 [2019-11-20 00:43:17,823 INFO L226 Difference]: Without dead ends: 260 [2019-11-20 00:43:17,824 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 00:43:17,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-20 00:43:17,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2019-11-20 00:43:17,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 00:43:17,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2019-11-20 00:43:17,831 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2019-11-20 00:43:17,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:17,831 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2019-11-20 00:43:17,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:17,831 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2019-11-20 00:43:17,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 00:43:17,832 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:17,833 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 00:43:17,833 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:17,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:17,833 INFO L82 PathProgramCache]: Analyzing trace with hash 2010828614, now seen corresponding path program 1 times [2019-11-20 00:43:17,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:17,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305234260] [2019-11-20 00:43:17,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:17,891 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 00:43:17,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305234260] [2019-11-20 00:43:17,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:17,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:17,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312570681] [2019-11-20 00:43:17,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:17,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:17,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:17,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:17,894 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2019-11-20 00:43:18,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:18,243 INFO L93 Difference]: Finished difference Result 499 states and 767 transitions. [2019-11-20 00:43:18,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:18,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 00:43:18,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:18,245 INFO L225 Difference]: With dead ends: 499 [2019-11-20 00:43:18,245 INFO L226 Difference]: Without dead ends: 284 [2019-11-20 00:43:18,245 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 00:43:18,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-11-20 00:43:18,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 234. [2019-11-20 00:43:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 00:43:18,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2019-11-20 00:43:18,250 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2019-11-20 00:43:18,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:18,251 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2019-11-20 00:43:18,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:18,251 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2019-11-20 00:43:18,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 00:43:18,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:18,252 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 00:43:18,252 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:18,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:18,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1947077233, now seen corresponding path program 1 times [2019-11-20 00:43:18,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:18,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048253331] [2019-11-20 00:43:18,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:18,307 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 00:43:18,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048253331] [2019-11-20 00:43:18,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:18,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:18,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540005816] [2019-11-20 00:43:18,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:18,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:18,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:18,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:18,309 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2019-11-20 00:43:18,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:18,758 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2019-11-20 00:43:18,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:18,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 00:43:18,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:18,760 INFO L225 Difference]: With dead ends: 497 [2019-11-20 00:43:18,760 INFO L226 Difference]: Without dead ends: 282 [2019-11-20 00:43:18,761 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 00:43:18,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-20 00:43:18,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2019-11-20 00:43:18,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 00:43:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2019-11-20 00:43:18,766 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2019-11-20 00:43:18,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:18,767 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2019-11-20 00:43:18,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:18,767 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2019-11-20 00:43:18,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 00:43:18,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:18,768 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 00:43:18,768 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:18,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:18,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1807744591, now seen corresponding path program 1 times [2019-11-20 00:43:18,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:18,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526192003] [2019-11-20 00:43:18,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:18,819 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 00:43:18,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526192003] [2019-11-20 00:43:18,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:18,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:18,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648222100] [2019-11-20 00:43:18,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:18,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:18,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:18,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:18,821 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2019-11-20 00:43:19,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:19,152 INFO L93 Difference]: Finished difference Result 496 states and 760 transitions. [2019-11-20 00:43:19,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:19,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 00:43:19,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:19,154 INFO L225 Difference]: With dead ends: 496 [2019-11-20 00:43:19,154 INFO L226 Difference]: Without dead ends: 281 [2019-11-20 00:43:19,154 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 00:43:19,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-20 00:43:19,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 234. [2019-11-20 00:43:19,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-20 00:43:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2019-11-20 00:43:19,160 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2019-11-20 00:43:19,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:19,160 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2019-11-20 00:43:19,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:19,160 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2019-11-20 00:43:19,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 00:43:19,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:19,161 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 00:43:19,162 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:19,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:19,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1418559526, now seen corresponding path program 1 times [2019-11-20 00:43:19,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:19,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302269813] [2019-11-20 00:43:19,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:19,235 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 00:43:19,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302269813] [2019-11-20 00:43:19,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:19,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 00:43:19,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463831740] [2019-11-20 00:43:19,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:43:19,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:19,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:43:19,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:43:19,237 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2019-11-20 00:43:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:19,643 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2019-11-20 00:43:19,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:43:19,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-11-20 00:43:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:19,645 INFO L225 Difference]: With dead ends: 470 [2019-11-20 00:43:19,645 INFO L226 Difference]: Without dead ends: 255 [2019-11-20 00:43:19,645 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 00:43:19,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-20 00:43:19,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-11-20 00:43:19,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 00:43:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2019-11-20 00:43:19,651 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2019-11-20 00:43:19,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:19,652 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2019-11-20 00:43:19,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:43:19,652 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2019-11-20 00:43:19,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 00:43:19,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:19,653 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 00:43:19,653 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:19,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:19,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1593988851, now seen corresponding path program 1 times [2019-11-20 00:43:19,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:19,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398021077] [2019-11-20 00:43:19,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:19,707 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 00:43:19,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398021077] [2019-11-20 00:43:19,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:19,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:19,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396689480] [2019-11-20 00:43:19,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:19,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:19,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:19,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:19,709 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2019-11-20 00:43:20,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:20,067 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2019-11-20 00:43:20,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:20,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 00:43:20,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:20,069 INFO L225 Difference]: With dead ends: 512 [2019-11-20 00:43:20,069 INFO L226 Difference]: Without dead ends: 277 [2019-11-20 00:43:20,070 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 00:43:20,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-20 00:43:20,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2019-11-20 00:43:20,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 00:43:20,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2019-11-20 00:43:20,077 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2019-11-20 00:43:20,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:20,077 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2019-11-20 00:43:20,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:20,077 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2019-11-20 00:43:20,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-20 00:43:20,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:20,078 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 00:43:20,079 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:20,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:20,079 INFO L82 PathProgramCache]: Analyzing trace with hash 2134134323, now seen corresponding path program 1 times [2019-11-20 00:43:20,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:20,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921802128] [2019-11-20 00:43:20,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:20,133 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 00:43:20,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921802128] [2019-11-20 00:43:20,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:20,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:20,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780248415] [2019-11-20 00:43:20,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:20,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:20,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:20,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:20,135 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2019-11-20 00:43:20,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:20,488 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2019-11-20 00:43:20,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:20,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-20 00:43:20,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:20,490 INFO L225 Difference]: With dead ends: 511 [2019-11-20 00:43:20,490 INFO L226 Difference]: Without dead ends: 276 [2019-11-20 00:43:20,490 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 00:43:20,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-20 00:43:20,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-20 00:43:20,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 00:43:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2019-11-20 00:43:20,497 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2019-11-20 00:43:20,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:20,497 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2019-11-20 00:43:20,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2019-11-20 00:43:20,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 00:43:20,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:20,498 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 00:43:20,498 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:20,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:20,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1582169212, now seen corresponding path program 1 times [2019-11-20 00:43:20,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:20,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483463184] [2019-11-20 00:43:20,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:20,552 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 00:43:20,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483463184] [2019-11-20 00:43:20,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:20,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:20,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944882687] [2019-11-20 00:43:20,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:20,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:20,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:20,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:20,554 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2019-11-20 00:43:21,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:21,030 INFO L93 Difference]: Finished difference Result 536 states and 805 transitions. [2019-11-20 00:43:21,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:21,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-20 00:43:21,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:21,033 INFO L225 Difference]: With dead ends: 536 [2019-11-20 00:43:21,033 INFO L226 Difference]: Without dead ends: 301 [2019-11-20 00:43:21,033 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 00:43:21,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-20 00:43:21,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-11-20 00:43:21,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 00:43:21,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2019-11-20 00:43:21,041 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2019-11-20 00:43:21,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:21,041 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2019-11-20 00:43:21,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:21,041 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2019-11-20 00:43:21,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 00:43:21,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:21,042 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 00:43:21,043 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:21,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:21,043 INFO L82 PathProgramCache]: Analyzing trace with hash 356992834, now seen corresponding path program 1 times [2019-11-20 00:43:21,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:21,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571040433] [2019-11-20 00:43:21,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:21,095 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 00:43:21,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571040433] [2019-11-20 00:43:21,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:21,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:21,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615219413] [2019-11-20 00:43:21,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:21,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:21,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:21,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:21,097 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2019-11-20 00:43:21,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:21,446 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2019-11-20 00:43:21,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:21,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-20 00:43:21,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:21,448 INFO L225 Difference]: With dead ends: 511 [2019-11-20 00:43:21,448 INFO L226 Difference]: Without dead ends: 276 [2019-11-20 00:43:21,449 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 00:43:21,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-20 00:43:21,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-20 00:43:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 00:43:21,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2019-11-20 00:43:21,455 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2019-11-20 00:43:21,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:21,456 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2019-11-20 00:43:21,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:21,456 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2019-11-20 00:43:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 00:43:21,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:21,457 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 00:43:21,457 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:21,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:21,457 INFO L82 PathProgramCache]: Analyzing trace with hash -2129784979, now seen corresponding path program 1 times [2019-11-20 00:43:21,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:21,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476019740] [2019-11-20 00:43:21,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:21,504 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 00:43:21,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476019740] [2019-11-20 00:43:21,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:21,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:21,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212828429] [2019-11-20 00:43:21,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:21,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:21,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:21,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:21,506 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2019-11-20 00:43:21,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:21,929 INFO L93 Difference]: Finished difference Result 536 states and 801 transitions. [2019-11-20 00:43:21,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:21,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-20 00:43:21,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:21,931 INFO L225 Difference]: With dead ends: 536 [2019-11-20 00:43:21,931 INFO L226 Difference]: Without dead ends: 301 [2019-11-20 00:43:21,932 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 00:43:21,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-20 00:43:21,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-11-20 00:43:21,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 00:43:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2019-11-20 00:43:21,938 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2019-11-20 00:43:21,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:21,939 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2019-11-20 00:43:21,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:21,939 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2019-11-20 00:43:21,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 00:43:21,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:21,940 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 00:43:21,940 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:21,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:21,941 INFO L82 PathProgramCache]: Analyzing trace with hash -2145303697, now seen corresponding path program 1 times [2019-11-20 00:43:21,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:21,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509774210] [2019-11-20 00:43:21,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:21,990 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 00:43:21,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509774210] [2019-11-20 00:43:21,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:21,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:21,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197454270] [2019-11-20 00:43:21,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:21,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:21,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:21,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:21,992 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2019-11-20 00:43:22,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:22,346 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2019-11-20 00:43:22,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:22,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-20 00:43:22,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:22,348 INFO L225 Difference]: With dead ends: 511 [2019-11-20 00:43:22,348 INFO L226 Difference]: Without dead ends: 276 [2019-11-20 00:43:22,348 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 00:43:22,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-20 00:43:22,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-20 00:43:22,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 00:43:22,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2019-11-20 00:43:22,354 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2019-11-20 00:43:22,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:22,355 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2019-11-20 00:43:22,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:22,357 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2019-11-20 00:43:22,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 00:43:22,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:22,358 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 00:43:22,358 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:22,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:22,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1086928127, now seen corresponding path program 1 times [2019-11-20 00:43:22,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:22,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665329777] [2019-11-20 00:43:22,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:22,434 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 00:43:22,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665329777] [2019-11-20 00:43:22,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:22,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:22,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830117865] [2019-11-20 00:43:22,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:22,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:22,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:22,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:22,436 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2019-11-20 00:43:22,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:22,833 INFO L93 Difference]: Finished difference Result 536 states and 797 transitions. [2019-11-20 00:43:22,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:22,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-20 00:43:22,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:22,835 INFO L225 Difference]: With dead ends: 536 [2019-11-20 00:43:22,835 INFO L226 Difference]: Without dead ends: 301 [2019-11-20 00:43:22,836 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 00:43:22,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-20 00:43:22,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-11-20 00:43:22,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 00:43:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2019-11-20 00:43:22,843 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2019-11-20 00:43:22,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:22,843 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2019-11-20 00:43:22,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:22,843 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2019-11-20 00:43:22,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 00:43:22,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:22,844 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 00:43:22,844 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:22,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:22,844 INFO L82 PathProgramCache]: Analyzing trace with hash 605847869, now seen corresponding path program 1 times [2019-11-20 00:43:22,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:22,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155177563] [2019-11-20 00:43:22,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:22,901 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 00:43:22,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155177563] [2019-11-20 00:43:22,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:22,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:22,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797084976] [2019-11-20 00:43:22,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:22,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:22,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:22,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:22,903 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2019-11-20 00:43:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:23,193 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2019-11-20 00:43:23,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:23,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-20 00:43:23,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:23,195 INFO L225 Difference]: With dead ends: 511 [2019-11-20 00:43:23,195 INFO L226 Difference]: Without dead ends: 276 [2019-11-20 00:43:23,195 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 00:43:23,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-20 00:43:23,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-20 00:43:23,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 00:43:23,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2019-11-20 00:43:23,202 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2019-11-20 00:43:23,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:23,202 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2019-11-20 00:43:23,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:23,203 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2019-11-20 00:43:23,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-20 00:43:23,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:23,204 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 00:43:23,204 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:23,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:23,204 INFO L82 PathProgramCache]: Analyzing trace with hash 738752008, now seen corresponding path program 1 times [2019-11-20 00:43:23,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:23,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735341458] [2019-11-20 00:43:23,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:23,255 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 00:43:23,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735341458] [2019-11-20 00:43:23,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:23,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:23,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338631942] [2019-11-20 00:43:23,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:23,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:23,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:23,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:23,257 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2019-11-20 00:43:23,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:23,669 INFO L93 Difference]: Finished difference Result 526 states and 781 transitions. [2019-11-20 00:43:23,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:23,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-20 00:43:23,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:23,672 INFO L225 Difference]: With dead ends: 526 [2019-11-20 00:43:23,672 INFO L226 Difference]: Without dead ends: 291 [2019-11-20 00:43:23,673 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 00:43:23,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-20 00:43:23,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2019-11-20 00:43:23,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 00:43:23,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-11-20 00:43:23,682 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2019-11-20 00:43:23,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:23,682 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-11-20 00:43:23,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:23,683 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-11-20 00:43:23,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-20 00:43:23,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:23,684 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 00:43:23,684 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:23,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:23,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1289834102, now seen corresponding path program 1 times [2019-11-20 00:43:23,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:23,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190310372] [2019-11-20 00:43:23,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:23,742 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 00:43:23,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190310372] [2019-11-20 00:43:23,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:23,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:23,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259367864] [2019-11-20 00:43:23,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:23,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:23,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:23,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:23,744 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2019-11-20 00:43:24,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:24,019 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2019-11-20 00:43:24,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:24,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-20 00:43:24,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:24,020 INFO L225 Difference]: With dead ends: 501 [2019-11-20 00:43:24,021 INFO L226 Difference]: Without dead ends: 266 [2019-11-20 00:43:24,021 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 00:43:24,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-20 00:43:24,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2019-11-20 00:43:24,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 00:43:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2019-11-20 00:43:24,028 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2019-11-20 00:43:24,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:24,029 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2019-11-20 00:43:24,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:24,029 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2019-11-20 00:43:24,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 00:43:24,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:24,030 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 00:43:24,030 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:24,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:24,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1110599922, now seen corresponding path program 1 times [2019-11-20 00:43:24,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:24,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566631913] [2019-11-20 00:43:24,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:24,118 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 00:43:24,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566631913] [2019-11-20 00:43:24,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:24,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:24,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051293710] [2019-11-20 00:43:24,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:24,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:24,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:24,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:24,121 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2019-11-20 00:43:24,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:24,476 INFO L93 Difference]: Finished difference Result 526 states and 777 transitions. [2019-11-20 00:43:24,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:24,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-20 00:43:24,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:24,478 INFO L225 Difference]: With dead ends: 526 [2019-11-20 00:43:24,478 INFO L226 Difference]: Without dead ends: 291 [2019-11-20 00:43:24,478 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 00:43:24,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-20 00:43:24,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2019-11-20 00:43:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-20 00:43:24,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2019-11-20 00:43:24,482 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2019-11-20 00:43:24,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:24,483 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2019-11-20 00:43:24,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:24,483 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2019-11-20 00:43:24,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 00:43:24,483 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:24,484 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 00:43:24,484 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:24,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:24,484 INFO L82 PathProgramCache]: Analyzing trace with hash 276185488, now seen corresponding path program 1 times [2019-11-20 00:43:24,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:24,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179559223] [2019-11-20 00:43:24,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:24,536 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 00:43:24,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179559223] [2019-11-20 00:43:24,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:24,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:43:24,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564639316] [2019-11-20 00:43:24,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:43:24,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:24,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:43:24,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:43:24,538 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2019-11-20 00:43:24,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:24,589 INFO L93 Difference]: Finished difference Result 722 states and 1074 transitions. [2019-11-20 00:43:24,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:43:24,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-20 00:43:24,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:24,592 INFO L225 Difference]: With dead ends: 722 [2019-11-20 00:43:24,593 INFO L226 Difference]: Without dead ends: 487 [2019-11-20 00:43:24,593 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 00:43:24,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-11-20 00:43:24,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2019-11-20 00:43:24,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-20 00:43:24,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 717 transitions. [2019-11-20 00:43:24,606 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 717 transitions. Word has length 96 [2019-11-20 00:43:24,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:24,606 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 717 transitions. [2019-11-20 00:43:24,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:43:24,606 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 717 transitions. [2019-11-20 00:43:24,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-20 00:43:24,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:24,608 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 00:43:24,608 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:24,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:24,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1173556134, now seen corresponding path program 1 times [2019-11-20 00:43:24,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:24,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796425967] [2019-11-20 00:43:24,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:24,659 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 00:43:24,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796425967] [2019-11-20 00:43:24,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:24,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:43:24,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573120398] [2019-11-20 00:43:24,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:43:24,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:24,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:43:24,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:43:24,661 INFO L87 Difference]: Start difference. First operand 487 states and 717 transitions. Second operand 3 states. [2019-11-20 00:43:24,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:24,723 INFO L93 Difference]: Finished difference Result 1190 states and 1763 transitions. [2019-11-20 00:43:24,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:43:24,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-20 00:43:24,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:24,727 INFO L225 Difference]: With dead ends: 1190 [2019-11-20 00:43:24,727 INFO L226 Difference]: Without dead ends: 722 [2019-11-20 00:43:24,728 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 00:43:24,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-11-20 00:43:24,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 720. [2019-11-20 00:43:24,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-20 00:43:24,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1065 transitions. [2019-11-20 00:43:24,745 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1065 transitions. Word has length 98 [2019-11-20 00:43:24,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:24,746 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1065 transitions. [2019-11-20 00:43:24,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:43:24,746 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1065 transitions. [2019-11-20 00:43:24,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 00:43:24,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:24,747 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 00:43:24,748 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:24,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:24,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1028721671, now seen corresponding path program 1 times [2019-11-20 00:43:24,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:24,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898124960] [2019-11-20 00:43:24,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:24,799 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 00:43:24,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898124960] [2019-11-20 00:43:24,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:24,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:43:24,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174960730] [2019-11-20 00:43:24,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:43:24,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:24,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:43:24,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:43:24,803 INFO L87 Difference]: Start difference. First operand 720 states and 1065 transitions. Second operand 3 states. [2019-11-20 00:43:24,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:24,888 INFO L93 Difference]: Finished difference Result 1656 states and 2457 transitions. [2019-11-20 00:43:24,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:43:24,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-20 00:43:24,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:24,893 INFO L225 Difference]: With dead ends: 1656 [2019-11-20 00:43:24,893 INFO L226 Difference]: Without dead ends: 955 [2019-11-20 00:43:24,895 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 00:43:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-11-20 00:43:24,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 953. [2019-11-20 00:43:24,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-11-20 00:43:24,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1399 transitions. [2019-11-20 00:43:24,917 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1399 transitions. Word has length 104 [2019-11-20 00:43:24,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:24,917 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1399 transitions. [2019-11-20 00:43:24,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:43:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1399 transitions. [2019-11-20 00:43:24,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-20 00:43:24,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:24,920 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 00:43:24,920 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:24,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:24,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1513823389, now seen corresponding path program 1 times [2019-11-20 00:43:24,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:24,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287258749] [2019-11-20 00:43:24,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:24,970 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 00:43:24,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287258749] [2019-11-20 00:43:24,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:24,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:43:24,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921985677] [2019-11-20 00:43:24,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:43:24,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:24,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:43:24,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:43:24,972 INFO L87 Difference]: Start difference. First operand 953 states and 1399 transitions. Second operand 3 states. [2019-11-20 00:43:25,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:25,037 INFO L93 Difference]: Finished difference Result 2120 states and 3124 transitions. [2019-11-20 00:43:25,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:43:25,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-20 00:43:25,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:25,043 INFO L225 Difference]: With dead ends: 2120 [2019-11-20 00:43:25,044 INFO L226 Difference]: Without dead ends: 1186 [2019-11-20 00:43:25,045 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 00:43:25,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-11-20 00:43:25,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2019-11-20 00:43:25,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-11-20 00:43:25,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1744 transitions. [2019-11-20 00:43:25,072 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1744 transitions. Word has length 121 [2019-11-20 00:43:25,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:25,073 INFO L462 AbstractCegarLoop]: Abstraction has 1186 states and 1744 transitions. [2019-11-20 00:43:25,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:43:25,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1744 transitions. [2019-11-20 00:43:25,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 00:43:25,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:25,075 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 00:43:25,076 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:25,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:25,076 INFO L82 PathProgramCache]: Analyzing trace with hash -799556719, now seen corresponding path program 1 times [2019-11-20 00:43:25,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:25,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303436797] [2019-11-20 00:43:25,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:25,129 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 00:43:25,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303436797] [2019-11-20 00:43:25,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:25,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:43:25,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693514571] [2019-11-20 00:43:25,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:43:25,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:25,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:43:25,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:43:25,131 INFO L87 Difference]: Start difference. First operand 1186 states and 1744 transitions. Second operand 3 states. [2019-11-20 00:43:25,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:25,196 INFO L93 Difference]: Finished difference Result 1423 states and 2089 transitions. [2019-11-20 00:43:25,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:43:25,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-20 00:43:25,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:25,203 INFO L225 Difference]: With dead ends: 1423 [2019-11-20 00:43:25,203 INFO L226 Difference]: Without dead ends: 1421 [2019-11-20 00:43:25,204 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 00:43:25,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2019-11-20 00:43:25,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1419. [2019-11-20 00:43:25,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-11-20 00:43:25,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2086 transitions. [2019-11-20 00:43:25,238 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2086 transitions. Word has length 127 [2019-11-20 00:43:25,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:25,238 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 2086 transitions. [2019-11-20 00:43:25,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:43:25,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2086 transitions. [2019-11-20 00:43:25,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-20 00:43:25,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:25,242 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] [2019-11-20 00:43:25,242 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:25,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:25,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1090500354, now seen corresponding path program 1 times [2019-11-20 00:43:25,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:25,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351574908] [2019-11-20 00:43:25,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:25,319 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 00:43:25,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351574908] [2019-11-20 00:43:25,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:25,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:25,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579280479] [2019-11-20 00:43:25,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:25,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:25,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:25,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:25,321 INFO L87 Difference]: Start difference. First operand 1419 states and 2086 transitions. Second operand 4 states. [2019-11-20 00:43:25,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:25,740 INFO L93 Difference]: Finished difference Result 3197 states and 4729 transitions. [2019-11-20 00:43:25,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:25,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-20 00:43:25,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:25,749 INFO L225 Difference]: With dead ends: 3197 [2019-11-20 00:43:25,749 INFO L226 Difference]: Without dead ends: 1797 [2019-11-20 00:43:25,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 00:43:25,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2019-11-20 00:43:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1587. [2019-11-20 00:43:25,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1587 states. [2019-11-20 00:43:25,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2380 transitions. [2019-11-20 00:43:25,788 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2380 transitions. Word has length 163 [2019-11-20 00:43:25,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:25,789 INFO L462 AbstractCegarLoop]: Abstraction has 1587 states and 2380 transitions. [2019-11-20 00:43:25,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:25,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2380 transitions. [2019-11-20 00:43:25,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-20 00:43:25,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:25,793 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 00:43:25,793 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:25,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:25,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1035384371, now seen corresponding path program 1 times [2019-11-20 00:43:25,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:25,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41315021] [2019-11-20 00:43:25,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:26,175 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 00:43:26,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41315021] [2019-11-20 00:43:26,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334164499] [2019-11-20 00:43:26,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/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 00:43:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:26,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-20 00:43:26,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:43:26,524 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:43:26,525 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 00:43:26,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:43:26,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:43:26,577 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 00:43:26,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:43:26,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:43:26,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:43:26,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:43:26,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:43:26,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:43:26,637 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 00:43:26,638 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:43:26,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:43:26,682 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:43:26,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:43:26,799 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-20 00:43:26,799 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 7 case distinctions, treesize of input 52 treesize of output 46 [2019-11-20 00:43:26,800 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 00:43:26,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:43:26,824 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 00:43:26,825 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-20 00:43:26,897 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 00:43:26,898 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 00:43:26,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:43:26,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:43:26,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:43:26,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 00:43:26,963 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 00:43:26,964 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 00:43:26,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:43:26,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:43:26,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:43:26,971 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 00:43:26,974 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_165|]} [2019-11-20 00:43:26,976 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 00:43:26,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:43:27,035 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-20 00:43:27,036 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 00:43:27,036 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:43:27,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:43:27,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:43:27,050 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-20 00:43:27,105 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 00:43:27,105 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 00:43:27,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:43:27,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:43:27,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:43:27,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 00:43:27,149 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-20 00:43:27,150 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 00:43:27,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:43:27,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:43:27,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:43:27,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-20 00:43:27,169 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_158|], 20=[|v_#memory_$Pointer$.base_168|]} [2019-11-20 00:43:27,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:43:27,173 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 00:43:27,174 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 00:43:27,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:43:27,398 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-11-20 00:43:27,400 INFO L343 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2019-11-20 00:43:27,400 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 00:43:27,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:27,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:27,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:27,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:27,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:27,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:27,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:27,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:27,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:27,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:27,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:27,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:27,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:27,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:27,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:27,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:27,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:27,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:27,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:27,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:27,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:27,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:27,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:27,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:27,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:27,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:27,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:27,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:27,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:27,469 INFO L496 ElimStorePlain]: Start of recursive call 3: 21 dim-0 vars, End of recursive call: 21 dim-0 vars, and 1 xjuncts. [2019-11-20 00:43:27,708 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 296 DAG size of output: 62 [2019-11-20 00:43:27,708 INFO L567 ElimStorePlain]: treesize reduction 2426, result has 8.5 percent of original size [2019-11-20 00:43:27,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-11-20 00:43:27,710 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:233 [2019-11-20 00:43:27,814 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 30=[|v_#memory_$Pointer$.base_169|]} [2019-11-20 00:43:27,819 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 00:43:27,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:43:28,081 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 61 [2019-11-20 00:43:28,082 INFO L343 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2019-11-20 00:43:28,082 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 00:43:28,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,084 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:43:28,125 INFO L567 ElimStorePlain]: treesize reduction 69, result has 56.3 percent of original size [2019-11-20 00:43:28,126 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 00:43:28,126 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2019-11-20 00:43:28,171 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 30=[|v_#memory_$Pointer$.base_170|]} [2019-11-20 00:43:28,176 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 00:43:28,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:43:28,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:43:28,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:43:28,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:43:28,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:43:28,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:43:28,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:43:28,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:43:28,362 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-11-20 00:43:28,363 INFO L343 Elim1Store]: treesize reduction 56, result has 73.5 percent of original size [2019-11-20 00:43:28,363 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 00:43:28,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:28,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:28,372 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:43:28,548 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 40 [2019-11-20 00:43:28,549 INFO L567 ElimStorePlain]: treesize reduction 5955, result has 1.5 percent of original size [2019-11-20 00:43:28,549 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 00:43:28,550 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:89 [2019-11-20 00:43:28,595 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 00:43:28,600 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 00:43:28,600 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 00:43:28,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:43:28,624 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 00:43:28,624 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:43:28,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:43:28,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:43:28,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:43:28,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:43:28,716 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:43:28,716 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 00:43:28,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:28,841 INFO L496 ElimStorePlain]: Start of recursive call 4: 162 dim-0 vars, End of recursive call: 163 dim-0 vars, and 21 xjuncts. [2019-11-20 00:43:36,030 WARN L191 SmtUtils]: Spent 7.19 s on a formula simplification. DAG size of input: 1276 DAG size of output: 1267 [2019-11-20 00:43:36,031 INFO L567 ElimStorePlain]: treesize reduction 48, result has 98.6 percent of original size [2019-11-20 00:43:36,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 00:43:36,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 11 terms [2019-11-20 00:43:36,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 00:43:36,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 00:43:36,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 00:43:36,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 16 terms [2019-11-20 00:43:36,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 00:43:36,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 11 terms [2019-11-20 00:43:36,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 00:43:36,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 00:43:36,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 00:43:36,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:36,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 00:43:36,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:43:36,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:43:36,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 320 dim-0 vars, and 1 xjuncts. [2019-11-20 00:43:36,109 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:120, output treesize:2251 [2019-11-20 00:43:37,741 WARN L191 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 1613 DAG size of output: 22 [2019-11-20 00:43:37,764 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-20 00:43:37,765 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 00:43:37,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:43:37,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:43:37,775 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 00:43:37,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2019-11-20 00:43:37,834 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 00:43:37,835 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 00:43:37,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:43:37,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:43:37,840 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 00:43:37,840 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-11-20 00:43:38,083 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 00:43:38,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:43:38,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-11-20 00:43:38,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569321806] [2019-11-20 00:43:38,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 00:43:38,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:38,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 00:43:38,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-20 00:43:38,086 INFO L87 Difference]: Start difference. First operand 1587 states and 2380 transitions. Second operand 13 states. [2019-11-20 00:43:43,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:43,110 INFO L93 Difference]: Finished difference Result 7397 states and 11123 transitions. [2019-11-20 00:43:43,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 00:43:43,111 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 164 [2019-11-20 00:43:43,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:43,141 INFO L225 Difference]: With dead ends: 7397 [2019-11-20 00:43:43,141 INFO L226 Difference]: Without dead ends: 5829 [2019-11-20 00:43:43,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 164 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2019-11-20 00:43:43,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5829 states. [2019-11-20 00:43:43,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5829 to 3417. [2019-11-20 00:43:43,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3417 states. [2019-11-20 00:43:43,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3417 states to 3417 states and 5271 transitions. [2019-11-20 00:43:43,257 INFO L78 Accepts]: Start accepts. Automaton has 3417 states and 5271 transitions. Word has length 164 [2019-11-20 00:43:43,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:43,258 INFO L462 AbstractCegarLoop]: Abstraction has 3417 states and 5271 transitions. [2019-11-20 00:43:43,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 00:43:43,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 5271 transitions. [2019-11-20 00:43:43,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-20 00:43:43,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:43,265 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] [2019-11-20 00:43:43,469 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:43:43,469 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:43,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:43,469 INFO L82 PathProgramCache]: Analyzing trace with hash 2088210405, now seen corresponding path program 1 times [2019-11-20 00:43:43,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:43,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87083999] [2019-11-20 00:43:43,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:43,559 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 00:43:43,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87083999] [2019-11-20 00:43:43,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:43,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:43,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245614620] [2019-11-20 00:43:43,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:43,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:43,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:43,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:43,561 INFO L87 Difference]: Start difference. First operand 3417 states and 5271 transitions. Second operand 4 states. [2019-11-20 00:43:43,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:43,927 INFO L93 Difference]: Finished difference Result 7163 states and 10994 transitions. [2019-11-20 00:43:43,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:43,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-11-20 00:43:43,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:43,950 INFO L225 Difference]: With dead ends: 7163 [2019-11-20 00:43:43,950 INFO L226 Difference]: Without dead ends: 3765 [2019-11-20 00:43:43,954 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 00:43:43,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3765 states. [2019-11-20 00:43:44,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3765 to 3417. [2019-11-20 00:43:44,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3417 states. [2019-11-20 00:43:44,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3417 states to 3417 states and 5259 transitions. [2019-11-20 00:43:44,041 INFO L78 Accepts]: Start accepts. Automaton has 3417 states and 5259 transitions. Word has length 177 [2019-11-20 00:43:44,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:44,041 INFO L462 AbstractCegarLoop]: Abstraction has 3417 states and 5259 transitions. [2019-11-20 00:43:44,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:44,042 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 5259 transitions. [2019-11-20 00:43:44,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 00:43:44,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:44,047 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 00:43:44,047 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:44,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:44,048 INFO L82 PathProgramCache]: Analyzing trace with hash -2093282790, now seen corresponding path program 1 times [2019-11-20 00:43:44,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:44,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742935602] [2019-11-20 00:43:44,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:44,135 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 00:43:44,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742935602] [2019-11-20 00:43:44,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:44,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:44,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748908638] [2019-11-20 00:43:44,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:44,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:44,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:44,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:44,137 INFO L87 Difference]: Start difference. First operand 3417 states and 5259 transitions. Second operand 4 states. [2019-11-20 00:43:44,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:44,575 INFO L93 Difference]: Finished difference Result 7981 states and 12279 transitions. [2019-11-20 00:43:44,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:44,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-20 00:43:44,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:44,585 INFO L225 Difference]: With dead ends: 7981 [2019-11-20 00:43:44,585 INFO L226 Difference]: Without dead ends: 4583 [2019-11-20 00:43:44,589 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 00:43:44,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2019-11-20 00:43:44,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 3885. [2019-11-20 00:43:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3885 states. [2019-11-20 00:43:44,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3885 states to 3885 states and 6111 transitions. [2019-11-20 00:43:44,687 INFO L78 Accepts]: Start accepts. Automaton has 3885 states and 6111 transitions. Word has length 178 [2019-11-20 00:43:44,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:44,688 INFO L462 AbstractCegarLoop]: Abstraction has 3885 states and 6111 transitions. [2019-11-20 00:43:44,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:44,688 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 6111 transitions. [2019-11-20 00:43:44,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 00:43:44,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:44,694 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] [2019-11-20 00:43:44,694 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:44,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:44,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1031578742, now seen corresponding path program 1 times [2019-11-20 00:43:44,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:44,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722123255] [2019-11-20 00:43:44,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:44,771 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 00:43:44,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722123255] [2019-11-20 00:43:44,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:44,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:44,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362748088] [2019-11-20 00:43:44,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:44,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:44,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:44,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:44,773 INFO L87 Difference]: Start difference. First operand 3885 states and 6111 transitions. Second operand 4 states. [2019-11-20 00:43:45,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:45,188 INFO L93 Difference]: Finished difference Result 6227 states and 9705 transitions. [2019-11-20 00:43:45,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:45,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-20 00:43:45,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:45,204 INFO L225 Difference]: With dead ends: 6227 [2019-11-20 00:43:45,204 INFO L226 Difference]: Without dead ends: 4233 [2019-11-20 00:43:45,207 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 00:43:45,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2019-11-20 00:43:45,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 3885. [2019-11-20 00:43:45,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3885 states. [2019-11-20 00:43:45,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3885 states to 3885 states and 6099 transitions. [2019-11-20 00:43:45,295 INFO L78 Accepts]: Start accepts. Automaton has 3885 states and 6099 transitions. Word has length 178 [2019-11-20 00:43:45,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:45,295 INFO L462 AbstractCegarLoop]: Abstraction has 3885 states and 6099 transitions. [2019-11-20 00:43:45,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:45,296 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 6099 transitions. [2019-11-20 00:43:45,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 00:43:45,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:45,301 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 00:43:45,302 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:45,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:45,302 INFO L82 PathProgramCache]: Analyzing trace with hash -474621622, now seen corresponding path program 1 times [2019-11-20 00:43:45,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:45,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822289606] [2019-11-20 00:43:45,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:45,400 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 00:43:45,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822289606] [2019-11-20 00:43:45,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:45,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:45,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794514784] [2019-11-20 00:43:45,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:45,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:45,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:45,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:45,402 INFO L87 Difference]: Start difference. First operand 3885 states and 6099 transitions. Second operand 4 states. [2019-11-20 00:43:45,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:45,855 INFO L93 Difference]: Finished difference Result 8399 states and 13032 transitions. [2019-11-20 00:43:45,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:45,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-11-20 00:43:45,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:45,861 INFO L225 Difference]: With dead ends: 8399 [2019-11-20 00:43:45,862 INFO L226 Difference]: Without dead ends: 4533 [2019-11-20 00:43:45,866 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 00:43:45,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4533 states. [2019-11-20 00:43:45,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4533 to 3765. [2019-11-20 00:43:45,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3765 states. [2019-11-20 00:43:45,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 3765 states and 5871 transitions. [2019-11-20 00:43:45,956 INFO L78 Accepts]: Start accepts. Automaton has 3765 states and 5871 transitions. Word has length 179 [2019-11-20 00:43:45,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:45,956 INFO L462 AbstractCegarLoop]: Abstraction has 3765 states and 5871 transitions. [2019-11-20 00:43:45,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 5871 transitions. [2019-11-20 00:43:45,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 00:43:45,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:45,962 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 00:43:45,962 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:45,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:45,963 INFO L82 PathProgramCache]: Analyzing trace with hash -2087807271, now seen corresponding path program 1 times [2019-11-20 00:43:45,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:45,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830235329] [2019-11-20 00:43:45,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:46,087 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 00:43:46,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830235329] [2019-11-20 00:43:46,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:46,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 00:43:46,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64518544] [2019-11-20 00:43:46,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:43:46,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:46,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:43:46,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:43:46,090 INFO L87 Difference]: Start difference. First operand 3765 states and 5871 transitions. Second operand 5 states. [2019-11-20 00:43:46,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:46,695 INFO L93 Difference]: Finished difference Result 9049 states and 14119 transitions. [2019-11-20 00:43:46,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:46,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2019-11-20 00:43:46,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:46,701 INFO L225 Difference]: With dead ends: 9049 [2019-11-20 00:43:46,701 INFO L226 Difference]: Without dead ends: 5303 [2019-11-20 00:43:46,705 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 00:43:46,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5303 states. [2019-11-20 00:43:46,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5303 to 4239. [2019-11-20 00:43:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4239 states. [2019-11-20 00:43:46,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4239 states to 4239 states and 6729 transitions. [2019-11-20 00:43:46,809 INFO L78 Accepts]: Start accepts. Automaton has 4239 states and 6729 transitions. Word has length 179 [2019-11-20 00:43:46,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:46,809 INFO L462 AbstractCegarLoop]: Abstraction has 4239 states and 6729 transitions. [2019-11-20 00:43:46,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:43:46,810 INFO L276 IsEmpty]: Start isEmpty. Operand 4239 states and 6729 transitions. [2019-11-20 00:43:46,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 00:43:46,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:46,816 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 00:43:46,816 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:46,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:46,816 INFO L82 PathProgramCache]: Analyzing trace with hash -728365523, now seen corresponding path program 2 times [2019-11-20 00:43:46,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:46,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073351286] [2019-11-20 00:43:46,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:46,887 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 00:43:46,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073351286] [2019-11-20 00:43:46,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:46,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:46,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602155298] [2019-11-20 00:43:46,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:46,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:46,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:46,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:46,889 INFO L87 Difference]: Start difference. First operand 4239 states and 6729 transitions. Second operand 4 states. [2019-11-20 00:43:47,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:47,581 INFO L93 Difference]: Finished difference Result 7579 states and 11932 transitions. [2019-11-20 00:43:47,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:47,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-11-20 00:43:47,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:47,588 INFO L225 Difference]: With dead ends: 7579 [2019-11-20 00:43:47,588 INFO L226 Difference]: Without dead ends: 5405 [2019-11-20 00:43:47,591 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 00:43:47,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5405 states. [2019-11-20 00:43:47,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5405 to 4383. [2019-11-20 00:43:47,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4383 states. [2019-11-20 00:43:47,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4383 states to 4383 states and 6933 transitions. [2019-11-20 00:43:47,770 INFO L78 Accepts]: Start accepts. Automaton has 4383 states and 6933 transitions. Word has length 179 [2019-11-20 00:43:47,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:47,770 INFO L462 AbstractCegarLoop]: Abstraction has 4383 states and 6933 transitions. [2019-11-20 00:43:47,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:47,770 INFO L276 IsEmpty]: Start isEmpty. Operand 4383 states and 6933 transitions. [2019-11-20 00:43:47,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 00:43:47,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:47,775 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] [2019-11-20 00:43:47,775 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:47,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:47,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1570855393, now seen corresponding path program 1 times [2019-11-20 00:43:47,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:47,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44322612] [2019-11-20 00:43:47,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:47,852 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 00:43:47,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44322612] [2019-11-20 00:43:47,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:47,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:47,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152749168] [2019-11-20 00:43:47,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:47,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:47,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:47,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:47,854 INFO L87 Difference]: Start difference. First operand 4383 states and 6933 transitions. Second operand 4 states. [2019-11-20 00:43:48,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:48,388 INFO L93 Difference]: Finished difference Result 6977 states and 10941 transitions. [2019-11-20 00:43:48,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:48,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-11-20 00:43:48,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:48,393 INFO L225 Difference]: With dead ends: 6977 [2019-11-20 00:43:48,393 INFO L226 Difference]: Without dead ends: 4731 [2019-11-20 00:43:48,396 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 00:43:48,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4731 states. [2019-11-20 00:43:48,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4731 to 4383. [2019-11-20 00:43:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4383 states. [2019-11-20 00:43:48,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4383 states to 4383 states and 6921 transitions. [2019-11-20 00:43:48,505 INFO L78 Accepts]: Start accepts. Automaton has 4383 states and 6921 transitions. Word has length 179 [2019-11-20 00:43:48,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:48,506 INFO L462 AbstractCegarLoop]: Abstraction has 4383 states and 6921 transitions. [2019-11-20 00:43:48,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:48,506 INFO L276 IsEmpty]: Start isEmpty. Operand 4383 states and 6921 transitions. [2019-11-20 00:43:48,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-20 00:43:48,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:48,512 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 00:43:48,512 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:48,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:48,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1414237136, now seen corresponding path program 1 times [2019-11-20 00:43:48,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:48,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819698203] [2019-11-20 00:43:48,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:48,592 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 00:43:48,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819698203] [2019-11-20 00:43:48,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:48,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:48,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016408555] [2019-11-20 00:43:48,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:48,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:48,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:48,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:48,594 INFO L87 Difference]: Start difference. First operand 4383 states and 6921 transitions. Second operand 4 states. [2019-11-20 00:43:49,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:49,109 INFO L93 Difference]: Finished difference Result 7651 states and 12004 transitions. [2019-11-20 00:43:49,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:49,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-11-20 00:43:49,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:49,113 INFO L225 Difference]: With dead ends: 7651 [2019-11-20 00:43:49,113 INFO L226 Difference]: Without dead ends: 5405 [2019-11-20 00:43:49,115 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 00:43:49,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5405 states. [2019-11-20 00:43:49,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5405 to 4395. [2019-11-20 00:43:49,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4395 states. [2019-11-20 00:43:49,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4395 states to 4395 states and 6933 transitions. [2019-11-20 00:43:49,222 INFO L78 Accepts]: Start accepts. Automaton has 4395 states and 6933 transitions. Word has length 180 [2019-11-20 00:43:49,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:49,222 INFO L462 AbstractCegarLoop]: Abstraction has 4395 states and 6933 transitions. [2019-11-20 00:43:49,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:49,222 INFO L276 IsEmpty]: Start isEmpty. Operand 4395 states and 6933 transitions. [2019-11-20 00:43:49,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-20 00:43:49,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:49,229 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 00:43:49,229 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:49,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:49,229 INFO L82 PathProgramCache]: Analyzing trace with hash -304880533, now seen corresponding path program 1 times [2019-11-20 00:43:49,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:49,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001046429] [2019-11-20 00:43:49,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:49,348 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 00:43:49,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001046429] [2019-11-20 00:43:49,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:49,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 00:43:49,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223749415] [2019-11-20 00:43:49,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:43:49,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:49,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:43:49,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:43:49,350 INFO L87 Difference]: Start difference. First operand 4395 states and 6933 transitions. Second operand 5 states. [2019-11-20 00:43:49,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:49,891 INFO L93 Difference]: Finished difference Result 9973 states and 15697 transitions. [2019-11-20 00:43:49,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:49,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-11-20 00:43:49,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:49,895 INFO L225 Difference]: With dead ends: 9973 [2019-11-20 00:43:49,895 INFO L226 Difference]: Without dead ends: 5597 [2019-11-20 00:43:49,898 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 00:43:49,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2019-11-20 00:43:49,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 4263. [2019-11-20 00:43:49,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4263 states. [2019-11-20 00:43:50,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 6753 transitions. [2019-11-20 00:43:50,003 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 6753 transitions. Word has length 180 [2019-11-20 00:43:50,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:50,003 INFO L462 AbstractCegarLoop]: Abstraction has 4263 states and 6753 transitions. [2019-11-20 00:43:50,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:43:50,003 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 6753 transitions. [2019-11-20 00:43:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-20 00:43:50,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:50,008 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] [2019-11-20 00:43:50,008 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:50,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:50,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1891043653, now seen corresponding path program 1 times [2019-11-20 00:43:50,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:50,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600472150] [2019-11-20 00:43:50,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:50,140 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 00:43:50,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600472150] [2019-11-20 00:43:50,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:50,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:50,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843216545] [2019-11-20 00:43:50,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:50,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:50,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:50,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:50,142 INFO L87 Difference]: Start difference. First operand 4263 states and 6753 transitions. Second operand 4 states. [2019-11-20 00:43:50,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:50,643 INFO L93 Difference]: Finished difference Result 6797 states and 10671 transitions. [2019-11-20 00:43:50,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:50,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-11-20 00:43:50,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:50,646 INFO L225 Difference]: With dead ends: 6797 [2019-11-20 00:43:50,647 INFO L226 Difference]: Without dead ends: 4611 [2019-11-20 00:43:50,648 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 00:43:50,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4611 states. [2019-11-20 00:43:50,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4611 to 4263. [2019-11-20 00:43:50,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4263 states. [2019-11-20 00:43:50,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 6741 transitions. [2019-11-20 00:43:50,721 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 6741 transitions. Word has length 180 [2019-11-20 00:43:50,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:50,722 INFO L462 AbstractCegarLoop]: Abstraction has 4263 states and 6741 transitions. [2019-11-20 00:43:50,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:50,722 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 6741 transitions. [2019-11-20 00:43:50,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-20 00:43:50,726 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:50,726 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 00:43:50,726 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:50,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:50,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1166712722, now seen corresponding path program 1 times [2019-11-20 00:43:50,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:50,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120711289] [2019-11-20 00:43:50,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:50,794 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 00:43:50,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120711289] [2019-11-20 00:43:50,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:50,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:50,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571345069] [2019-11-20 00:43:50,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:50,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:50,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:50,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:50,796 INFO L87 Difference]: Start difference. First operand 4263 states and 6741 transitions. Second operand 4 states. [2019-11-20 00:43:51,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:51,260 INFO L93 Difference]: Finished difference Result 7409 states and 11635 transitions. [2019-11-20 00:43:51,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:51,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-11-20 00:43:51,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:51,265 INFO L225 Difference]: With dead ends: 7409 [2019-11-20 00:43:51,266 INFO L226 Difference]: Without dead ends: 5223 [2019-11-20 00:43:51,268 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 00:43:51,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5223 states. [2019-11-20 00:43:51,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5223 to 4275. [2019-11-20 00:43:51,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4275 states. [2019-11-20 00:43:51,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 6753 transitions. [2019-11-20 00:43:51,353 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 6753 transitions. Word has length 181 [2019-11-20 00:43:51,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:51,353 INFO L462 AbstractCegarLoop]: Abstraction has 4275 states and 6753 transitions. [2019-11-20 00:43:51,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:51,353 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 6753 transitions. [2019-11-20 00:43:51,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-20 00:43:51,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:51,358 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] [2019-11-20 00:43:51,358 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:51,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:51,358 INFO L82 PathProgramCache]: Analyzing trace with hash 181086524, now seen corresponding path program 1 times [2019-11-20 00:43:51,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:51,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962996058] [2019-11-20 00:43:51,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:51,432 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 00:43:51,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962996058] [2019-11-20 00:43:51,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:51,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:51,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064076959] [2019-11-20 00:43:51,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:51,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:51,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:51,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:51,434 INFO L87 Difference]: Start difference. First operand 4275 states and 6753 transitions. Second operand 4 states. [2019-11-20 00:43:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:51,921 INFO L93 Difference]: Finished difference Result 6755 states and 10599 transitions. [2019-11-20 00:43:51,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:51,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-11-20 00:43:51,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:51,924 INFO L225 Difference]: With dead ends: 6755 [2019-11-20 00:43:51,925 INFO L226 Difference]: Without dead ends: 4563 [2019-11-20 00:43:51,926 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 00:43:51,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4563 states. [2019-11-20 00:43:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4563 to 4275. [2019-11-20 00:43:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4275 states. [2019-11-20 00:43:52,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 6741 transitions. [2019-11-20 00:43:52,003 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 6741 transitions. Word has length 181 [2019-11-20 00:43:52,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:52,003 INFO L462 AbstractCegarLoop]: Abstraction has 4275 states and 6741 transitions. [2019-11-20 00:43:52,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:52,003 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 6741 transitions. [2019-11-20 00:43:52,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-20 00:43:52,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:52,007 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 00:43:52,007 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:52,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:52,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1939913077, now seen corresponding path program 1 times [2019-11-20 00:43:52,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:52,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500554650] [2019-11-20 00:43:52,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:52,074 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 00:43:52,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500554650] [2019-11-20 00:43:52,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:52,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:52,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028205404] [2019-11-20 00:43:52,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:52,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:52,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:52,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:52,076 INFO L87 Difference]: Start difference. First operand 4275 states and 6741 transitions. Second operand 4 states. [2019-11-20 00:43:52,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:52,496 INFO L93 Difference]: Finished difference Result 7355 states and 11539 transitions. [2019-11-20 00:43:52,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:52,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-11-20 00:43:52,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:52,500 INFO L225 Difference]: With dead ends: 7355 [2019-11-20 00:43:52,500 INFO L226 Difference]: Without dead ends: 5163 [2019-11-20 00:43:52,502 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 00:43:52,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5163 states. [2019-11-20 00:43:52,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5163 to 4287. [2019-11-20 00:43:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-20 00:43:52,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6753 transitions. [2019-11-20 00:43:52,596 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6753 transitions. Word has length 182 [2019-11-20 00:43:52,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:52,597 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6753 transitions. [2019-11-20 00:43:52,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:52,597 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6753 transitions. [2019-11-20 00:43:52,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-20 00:43:52,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:52,603 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1] [2019-11-20 00:43:52,603 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:52,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:52,603 INFO L82 PathProgramCache]: Analyzing trace with hash 298033814, now seen corresponding path program 1 times [2019-11-20 00:43:52,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:52,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811683824] [2019-11-20 00:43:52,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:52,763 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 00:43:52,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811683824] [2019-11-20 00:43:52,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:52,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:52,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679340402] [2019-11-20 00:43:52,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:52,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:52,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:52,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:52,767 INFO L87 Difference]: Start difference. First operand 4287 states and 6753 transitions. Second operand 4 states. [2019-11-20 00:43:53,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:53,197 INFO L93 Difference]: Finished difference Result 8843 states and 13886 transitions. [2019-11-20 00:43:53,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:53,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-11-20 00:43:53,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:53,201 INFO L225 Difference]: With dead ends: 8843 [2019-11-20 00:43:53,203 INFO L226 Difference]: Without dead ends: 4575 [2019-11-20 00:43:53,207 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 00:43:53,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2019-11-20 00:43:53,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4287. [2019-11-20 00:43:53,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-20 00:43:53,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6741 transitions. [2019-11-20 00:43:53,292 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6741 transitions. Word has length 185 [2019-11-20 00:43:53,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:53,292 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6741 transitions. [2019-11-20 00:43:53,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:53,293 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6741 transitions. [2019-11-20 00:43:53,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-20 00:43:53,295 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:53,296 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:43:53,296 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:53,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:53,296 INFO L82 PathProgramCache]: Analyzing trace with hash 104383426, now seen corresponding path program 1 times [2019-11-20 00:43:53,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:53,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667573728] [2019-11-20 00:43:53,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:53,372 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 00:43:53,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667573728] [2019-11-20 00:43:53,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:53,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:53,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544169970] [2019-11-20 00:43:53,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:53,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:53,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:53,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:53,374 INFO L87 Difference]: Start difference. First operand 4287 states and 6741 transitions. Second operand 4 states. [2019-11-20 00:43:53,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:53,747 INFO L93 Difference]: Finished difference Result 8843 states and 13862 transitions. [2019-11-20 00:43:53,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:53,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-11-20 00:43:53,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:53,751 INFO L225 Difference]: With dead ends: 8843 [2019-11-20 00:43:53,751 INFO L226 Difference]: Without dead ends: 4575 [2019-11-20 00:43:53,754 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 00:43:53,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2019-11-20 00:43:53,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4287. [2019-11-20 00:43:53,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-20 00:43:53,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6729 transitions. [2019-11-20 00:43:53,844 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6729 transitions. Word has length 185 [2019-11-20 00:43:53,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:53,844 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6729 transitions. [2019-11-20 00:43:53,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6729 transitions. [2019-11-20 00:43:53,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-20 00:43:53,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:53,847 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 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, 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 00:43:53,847 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:53,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:53,848 INFO L82 PathProgramCache]: Analyzing trace with hash -556828801, now seen corresponding path program 1 times [2019-11-20 00:43:53,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:53,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927517174] [2019-11-20 00:43:53,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:53,927 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 00:43:53,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927517174] [2019-11-20 00:43:53,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:53,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:53,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57033282] [2019-11-20 00:43:53,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:53,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:53,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:53,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:53,929 INFO L87 Difference]: Start difference. First operand 4287 states and 6729 transitions. Second operand 4 states. [2019-11-20 00:43:54,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:54,287 INFO L93 Difference]: Finished difference Result 8795 states and 13772 transitions. [2019-11-20 00:43:54,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:54,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-11-20 00:43:54,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:54,290 INFO L225 Difference]: With dead ends: 8795 [2019-11-20 00:43:54,291 INFO L226 Difference]: Without dead ends: 4527 [2019-11-20 00:43:54,294 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 00:43:54,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4527 states. [2019-11-20 00:43:54,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4527 to 4287. [2019-11-20 00:43:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-20 00:43:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6717 transitions. [2019-11-20 00:43:54,370 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6717 transitions. Word has length 186 [2019-11-20 00:43:54,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:54,370 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6717 transitions. [2019-11-20 00:43:54,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:54,371 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6717 transitions. [2019-11-20 00:43:54,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-20 00:43:54,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:54,373 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:43:54,373 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:54,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:54,374 INFO L82 PathProgramCache]: Analyzing trace with hash -829120181, now seen corresponding path program 1 times [2019-11-20 00:43:54,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:54,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335200659] [2019-11-20 00:43:54,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:54,449 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 00:43:54,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335200659] [2019-11-20 00:43:54,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:54,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:54,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447310154] [2019-11-20 00:43:54,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:54,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:54,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:54,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:54,451 INFO L87 Difference]: Start difference. First operand 4287 states and 6717 transitions. Second operand 4 states. [2019-11-20 00:43:54,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:54,967 INFO L93 Difference]: Finished difference Result 8735 states and 13670 transitions. [2019-11-20 00:43:54,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:54,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-11-20 00:43:54,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:54,972 INFO L225 Difference]: With dead ends: 8735 [2019-11-20 00:43:54,973 INFO L226 Difference]: Without dead ends: 4467 [2019-11-20 00:43:54,978 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 00:43:54,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4467 states. [2019-11-20 00:43:55,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4467 to 4287. [2019-11-20 00:43:55,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-11-20 00:43:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6705 transitions. [2019-11-20 00:43:55,094 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6705 transitions. Word has length 186 [2019-11-20 00:43:55,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:55,095 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6705 transitions. [2019-11-20 00:43:55,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:55,095 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6705 transitions. [2019-11-20 00:43:55,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-20 00:43:55,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:55,099 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 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] [2019-11-20 00:43:55,099 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:55,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:55,099 INFO L82 PathProgramCache]: Analyzing trace with hash 127197068, now seen corresponding path program 1 times [2019-11-20 00:43:55,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:55,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232173244] [2019-11-20 00:43:55,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 00:43:55,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232173244] [2019-11-20 00:43:55,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:55,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:55,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199636356] [2019-11-20 00:43:55,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:55,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:55,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:55,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:55,241 INFO L87 Difference]: Start difference. First operand 4287 states and 6705 transitions. Second operand 4 states. [2019-11-20 00:43:55,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:55,622 INFO L93 Difference]: Finished difference Result 9299 states and 14546 transitions. [2019-11-20 00:43:55,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:55,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-11-20 00:43:55,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:55,626 INFO L225 Difference]: With dead ends: 9299 [2019-11-20 00:43:55,626 INFO L226 Difference]: Without dead ends: 5031 [2019-11-20 00:43:55,630 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 00:43:55,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5031 states. [2019-11-20 00:43:55,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5031 to 4647. [2019-11-20 00:43:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4647 states. [2019-11-20 00:43:55,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4647 states to 4647 states and 7341 transitions. [2019-11-20 00:43:55,714 INFO L78 Accepts]: Start accepts. Automaton has 4647 states and 7341 transitions. Word has length 188 [2019-11-20 00:43:55,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:55,714 INFO L462 AbstractCegarLoop]: Abstraction has 4647 states and 7341 transitions. [2019-11-20 00:43:55,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 4647 states and 7341 transitions. [2019-11-20 00:43:55,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-20 00:43:55,717 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:55,717 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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] [2019-11-20 00:43:55,718 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:55,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:55,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1739670347, now seen corresponding path program 1 times [2019-11-20 00:43:55,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:55,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947040073] [2019-11-20 00:43:55,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:55,790 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-20 00:43:55,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947040073] [2019-11-20 00:43:55,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:55,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:55,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697949738] [2019-11-20 00:43:55,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:55,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:55,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:55,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:55,792 INFO L87 Difference]: Start difference. First operand 4647 states and 7341 transitions. Second operand 4 states. [2019-11-20 00:43:56,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:56,149 INFO L93 Difference]: Finished difference Result 9455 states and 14918 transitions. [2019-11-20 00:43:56,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:56,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-11-20 00:43:56,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:56,153 INFO L225 Difference]: With dead ends: 9455 [2019-11-20 00:43:56,153 INFO L226 Difference]: Without dead ends: 4827 [2019-11-20 00:43:56,155 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 00:43:56,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4827 states. [2019-11-20 00:43:56,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4827 to 4647. [2019-11-20 00:43:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4647 states. [2019-11-20 00:43:56,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4647 states to 4647 states and 7329 transitions. [2019-11-20 00:43:56,248 INFO L78 Accepts]: Start accepts. Automaton has 4647 states and 7329 transitions. Word has length 190 [2019-11-20 00:43:56,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:56,248 INFO L462 AbstractCegarLoop]: Abstraction has 4647 states and 7329 transitions. [2019-11-20 00:43:56,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:56,248 INFO L276 IsEmpty]: Start isEmpty. Operand 4647 states and 7329 transitions. [2019-11-20 00:43:56,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-20 00:43:56,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:56,251 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 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] [2019-11-20 00:43:56,251 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:56,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:56,251 INFO L82 PathProgramCache]: Analyzing trace with hash 55283532, now seen corresponding path program 1 times [2019-11-20 00:43:56,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:56,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660802893] [2019-11-20 00:43:56,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-11-20 00:43:56,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660802893] [2019-11-20 00:43:56,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:56,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:56,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926762629] [2019-11-20 00:43:56,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:56,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:56,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:56,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:56,328 INFO L87 Difference]: Start difference. First operand 4647 states and 7329 transitions. Second operand 4 states. [2019-11-20 00:43:56,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:56,676 INFO L93 Difference]: Finished difference Result 9431 states and 14870 transitions. [2019-11-20 00:43:56,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:56,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-11-20 00:43:56,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:56,680 INFO L225 Difference]: With dead ends: 9431 [2019-11-20 00:43:56,680 INFO L226 Difference]: Without dead ends: 4803 [2019-11-20 00:43:56,682 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 00:43:56,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4803 states. [2019-11-20 00:43:56,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4803 to 4647. [2019-11-20 00:43:56,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4647 states. [2019-11-20 00:43:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4647 states to 4647 states and 7317 transitions. [2019-11-20 00:43:56,773 INFO L78 Accepts]: Start accepts. Automaton has 4647 states and 7317 transitions. Word has length 191 [2019-11-20 00:43:56,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:56,773 INFO L462 AbstractCegarLoop]: Abstraction has 4647 states and 7317 transitions. [2019-11-20 00:43:56,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:56,773 INFO L276 IsEmpty]: Start isEmpty. Operand 4647 states and 7317 transitions. [2019-11-20 00:43:56,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-20 00:43:56,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:56,776 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 00:43:56,776 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:56,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:56,776 INFO L82 PathProgramCache]: Analyzing trace with hash -24309129, now seen corresponding path program 1 times [2019-11-20 00:43:56,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:56,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251599314] [2019-11-20 00:43:56,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:56,854 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 00:43:56,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251599314] [2019-11-20 00:43:56,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:56,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:56,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699914515] [2019-11-20 00:43:56,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:56,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:56,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:56,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:56,857 INFO L87 Difference]: Start difference. First operand 4647 states and 7317 transitions. Second operand 4 states. [2019-11-20 00:43:57,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:57,326 INFO L93 Difference]: Finished difference Result 10151 states and 15948 transitions. [2019-11-20 00:43:57,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:57,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-20 00:43:57,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:57,331 INFO L225 Difference]: With dead ends: 10151 [2019-11-20 00:43:57,331 INFO L226 Difference]: Without dead ends: 5523 [2019-11-20 00:43:57,334 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 00:43:57,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5523 states. [2019-11-20 00:43:57,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5523 to 4659. [2019-11-20 00:43:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4659 states. [2019-11-20 00:43:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4659 states to 4659 states and 7329 transitions. [2019-11-20 00:43:57,433 INFO L78 Accepts]: Start accepts. Automaton has 4659 states and 7329 transitions. Word has length 192 [2019-11-20 00:43:57,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:57,433 INFO L462 AbstractCegarLoop]: Abstraction has 4659 states and 7329 transitions. [2019-11-20 00:43:57,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:57,433 INFO L276 IsEmpty]: Start isEmpty. Operand 4659 states and 7329 transitions. [2019-11-20 00:43:57,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-20 00:43:57,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:57,436 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 00:43:57,436 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:57,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:57,436 INFO L82 PathProgramCache]: Analyzing trace with hash -269316076, now seen corresponding path program 1 times [2019-11-20 00:43:57,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:57,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125124751] [2019-11-20 00:43:57,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:57,528 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 00:43:57,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125124751] [2019-11-20 00:43:57,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:57,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:57,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468245830] [2019-11-20 00:43:57,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:57,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:57,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:57,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:57,530 INFO L87 Difference]: Start difference. First operand 4659 states and 7329 transitions. Second operand 4 states. [2019-11-20 00:43:58,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:58,012 INFO L93 Difference]: Finished difference Result 10139 states and 15924 transitions. [2019-11-20 00:43:58,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:58,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-20 00:43:58,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:58,017 INFO L225 Difference]: With dead ends: 10139 [2019-11-20 00:43:58,018 INFO L226 Difference]: Without dead ends: 5499 [2019-11-20 00:43:58,020 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 00:43:58,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5499 states. [2019-11-20 00:43:58,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5499 to 4671. [2019-11-20 00:43:58,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4671 states. [2019-11-20 00:43:58,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4671 states to 4671 states and 7341 transitions. [2019-11-20 00:43:58,119 INFO L78 Accepts]: Start accepts. Automaton has 4671 states and 7341 transitions. Word has length 193 [2019-11-20 00:43:58,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:58,119 INFO L462 AbstractCegarLoop]: Abstraction has 4671 states and 7341 transitions. [2019-11-20 00:43:58,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:58,119 INFO L276 IsEmpty]: Start isEmpty. Operand 4671 states and 7341 transitions. [2019-11-20 00:43:58,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-20 00:43:58,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:58,122 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 00:43:58,122 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:58,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:58,122 INFO L82 PathProgramCache]: Analyzing trace with hash 885688148, now seen corresponding path program 1 times [2019-11-20 00:43:58,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:58,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996302410] [2019-11-20 00:43:58,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:43:58,191 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 00:43:58,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996302410] [2019-11-20 00:43:58,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:43:58,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:43:58,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863398322] [2019-11-20 00:43:58,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:43:58,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:43:58,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:43:58,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:43:58,193 INFO L87 Difference]: Start difference. First operand 4671 states and 7341 transitions. Second operand 4 states. [2019-11-20 00:43:58,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:43:58,660 INFO L93 Difference]: Finished difference Result 8177 states and 12775 transitions. [2019-11-20 00:43:58,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:43:58,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-20 00:43:58,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:43:58,664 INFO L225 Difference]: With dead ends: 8177 [2019-11-20 00:43:58,664 INFO L226 Difference]: Without dead ends: 5787 [2019-11-20 00:43:58,666 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 00:43:58,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5787 states. [2019-11-20 00:43:58,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5787 to 4815. [2019-11-20 00:43:58,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4815 states. [2019-11-20 00:43:58,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4815 states to 4815 states and 7545 transitions. [2019-11-20 00:43:58,758 INFO L78 Accepts]: Start accepts. Automaton has 4815 states and 7545 transitions. Word has length 193 [2019-11-20 00:43:58,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:43:58,759 INFO L462 AbstractCegarLoop]: Abstraction has 4815 states and 7545 transitions. [2019-11-20 00:43:58,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:43:58,759 INFO L276 IsEmpty]: Start isEmpty. Operand 4815 states and 7545 transitions. [2019-11-20 00:43:58,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-20 00:43:58,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:43:58,765 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 00:43:58,766 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:43:58,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:43:58,766 INFO L82 PathProgramCache]: Analyzing trace with hash 990290520, now seen corresponding path program 1 times [2019-11-20 00:43:58,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:43:58,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031248950] [2019-11-20 00:43:58,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:43:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:43:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:43:59,017 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:43:59,018 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 00:43:59,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:43:59 BoogieIcfgContainer [2019-11-20 00:43:59,209 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 00:43:59,210 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:43:59,210 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:43:59,210 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:43:59,211 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:43:06" (3/4) ... [2019-11-20 00:43:59,213 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 00:43:59,214 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:43:59,215 INFO L168 Benchmark]: Toolchain (without parser) took 55279.98 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 949.0 MB). Free memory was 939.3 MB in the beginning and 1.4 GB in the end (delta: -413.3 MB). Peak memory consumption was 535.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:43:59,215 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:43:59,215 INFO L168 Benchmark]: CACSL2BoogieTranslator took 823.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-20 00:43:59,216 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:43:59,216 INFO L168 Benchmark]: Boogie Preprocessor took 130.63 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:43:59,216 INFO L168 Benchmark]: RCFGBuilder took 1104.50 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.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. [2019-11-20 00:43:59,217 INFO L168 Benchmark]: TraceAbstraction took 53128.18 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 808.5 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -350.3 MB). Peak memory consumption was 458.2 MB. Max. memory is 11.5 GB. [2019-11-20 00:43:59,219 INFO L168 Benchmark]: Witness Printer took 3.91 ms. Allocated memory is still 2.0 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:43:59,224 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 823.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -171.4 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 130.63 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1104.50 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.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 53128.18 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 808.5 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -350.3 MB). Peak memory consumption was 458.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.91 ms. Allocated memory is still 2.0 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1727]: 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={6: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={6: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={6:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={6:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6: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={6: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={6:0}] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6: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={6:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={6:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1229] COND TRUE s->state == 8656 [L1579] EXPR s->session [L1579] EXPR s->s3 [L1579] EXPR (s->s3)->tmp.new_cipher [L1579] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1580] COND FALSE !(! tmp___9) [L1586] ret = __VERIFIER_nondet_int() [L1587] COND TRUE blastFlag == 2 [L1588] blastFlag = 3 VAL [init=1, SSLv3_server_data={6:0}] [L1592] COND FALSE !(ret <= 0) [L1597] s->state = 8672 [L1598] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1599] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={6:0}] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1235] COND TRUE s->state == 8672 [L1608] ret = __VERIFIER_nondet_int() [L1609] COND TRUE blastFlag == 3 [L1610] blastFlag = 4 VAL [init=1, SSLv3_server_data={6:0}] [L1614] COND FALSE !(ret <= 0) [L1619] s->state = 8448 [L1620] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1620] COND TRUE s->hit [L1621] EXPR s->s3 [L1621] (s->s3)->tmp.next_state = 8640 [L1625] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={6:0}] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1223] COND TRUE s->state == 8640 [L1559] ret = __VERIFIER_nondet_int() [L1560] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={6:0}] [L1727] __VERIFIER_error() VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 53.0s, OverallIterations: 71, TraceHistogramMax: 8, AutomataDifference: 31.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 15246 SDtfs, 5635 SDslu, 23781 SDs, 0 SdLazy, 15786 SolverSat, 872 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 556 GetRequests, 304 SyntacticMatches, 34 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4815occurred in iteration=70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 70 MinimizatonAttempts, 17523 StatesRemovedByMinimization, 68 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 8375 NumberOfCodeBlocks, 8375 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 8111 ConstructedInterpolants, 80 QuantifiedInterpolants, 4038058 SizeOfPredicates, 11 NumberOfNonLiveVariables, 604 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 71 InterpolantComputations, 69 PerfectInterpolantSequences, 9387/9629 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 00:44:01,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:44:01,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:44:01,089 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:44:01,090 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:44:01,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:44:01,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:44:01,101 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:44:01,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:44:01,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:44:01,108 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:44:01,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:44:01,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:44:01,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:44:01,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:44:01,111 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:44:01,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:44:01,112 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:44:01,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:44:01,116 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:44:01,117 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:44:01,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:44:01,119 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:44:01,120 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:44:01,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:44:01,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:44:01,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:44:01,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:44:01,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:44:01,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:44:01,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:44:01,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:44:01,126 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:44:01,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:44:01,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:44:01,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:44:01,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:44:01,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:44:01,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:44:01,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:44:01,131 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:44:01,132 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 00:44:01,145 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:44:01,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:44:01,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:44:01,147 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:44:01,147 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:44:01,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:44:01,147 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:44:01,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:44:01,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:44:01,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:44:01,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:44:01,149 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:44:01,149 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 00:44:01,149 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 00:44:01,149 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:44:01,149 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:44:01,150 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:44:01,150 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:44:01,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:44:01,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:44:01,151 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:44:01,151 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:44:01,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:44:01,152 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:44:01,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:44:01,152 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:44:01,152 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 00:44:01,152 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 00:44:01,153 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:44:01,153 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 00:44:01,153 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_faae8d45-3f39-4719-8c25-587366c272db/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 -> 17194510d9b99ec25b25421f731ec156f7460313 [2019-11-20 00:44:01,415 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:44:01,430 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:44:01,432 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:44:01,435 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:44:01,435 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:44:01,436 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-2.c [2019-11-20 00:44:01,493 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/data/a9563051a/5fbbdf6115b94638a1eb286a31be7d31/FLAG5f0c133ef [2019-11-20 00:44:02,047 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:44:02,048 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/sv-benchmarks/c/ssh/s3_srvr.blast.13.i.cil-2.c [2019-11-20 00:44:02,079 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/data/a9563051a/5fbbdf6115b94638a1eb286a31be7d31/FLAG5f0c133ef [2019-11-20 00:44:02,322 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/data/a9563051a/5fbbdf6115b94638a1eb286a31be7d31 [2019-11-20 00:44:02,324 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:44:02,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:44:02,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:44:02,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:44:02,330 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:44:02,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:44:02" (1/1) ... [2019-11-20 00:44:02,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@798ad6db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:02, skipping insertion in model container [2019-11-20 00:44:02,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:44:02" (1/1) ... [2019-11-20 00:44:02,339 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:44:02,416 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:44:02,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:44:02,965 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:44:03,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:44:03,147 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:44:03,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:03 WrapperNode [2019-11-20 00:44:03,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:44:03,149 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:44:03,149 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:44:03,149 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:44:03,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:03" (1/1) ... [2019-11-20 00:44:03,198 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:03" (1/1) ... [2019-11-20 00:44:03,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:44:03,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:44:03,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:44:03,258 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:44:03,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:03" (1/1) ... [2019-11-20 00:44:03,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:03" (1/1) ... [2019-11-20 00:44:03,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:03" (1/1) ... [2019-11-20 00:44:03,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:03" (1/1) ... [2019-11-20 00:44:03,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:03" (1/1) ... [2019-11-20 00:44:03,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:03" (1/1) ... [2019-11-20 00:44:03,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:03" (1/1) ... [2019-11-20 00:44:03,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:44:03,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:44:03,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:44:03,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:44:03,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/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 00:44:03,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 00:44:03,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 00:44:03,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 00:44:03,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 00:44:03,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 00:44:03,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:44:03,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:44:03,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 00:44:03,640 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 00:44:07,806 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-20 00:44:07,807 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-20 00:44:07,809 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:44:07,809 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 00:44:07,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:44:07 BoogieIcfgContainer [2019-11-20 00:44:07,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:44:07,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:44:07,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:44:07,816 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:44:07,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:44:02" (1/3) ... [2019-11-20 00:44:07,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5993cb1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:44:07, skipping insertion in model container [2019-11-20 00:44:07,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:44:03" (2/3) ... [2019-11-20 00:44:07,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5993cb1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:44:07, skipping insertion in model container [2019-11-20 00:44:07,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:44:07" (3/3) ... [2019-11-20 00:44:07,823 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.13.i.cil-2.c [2019-11-20 00:44:07,832 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:44:07,840 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 00:44:07,851 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 00:44:07,876 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:44:07,877 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:44:07,877 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:44:07,877 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:44:07,878 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:44:07,878 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:44:07,878 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:44:07,878 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:44:07,901 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-20 00:44:07,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 00:44:07,913 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:44:07,914 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 00:44:07,914 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:44:07,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:44:07,921 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756972, now seen corresponding path program 1 times [2019-11-20 00:44:07,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:44:07,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [991961416] [2019-11-20 00:44:07,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/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 00:44:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:08,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 00:44:08,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:44:08,198 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 00:44:08,199 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:44:08,228 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 00:44:08,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [991961416] [2019-11-20 00:44:08,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:44:08,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 00:44:08,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850512136] [2019-11-20 00:44:08,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:44:08,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:44:08,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:44:08,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:44:08,253 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-20 00:44:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:44:08,479 INFO L93 Difference]: Finished difference Result 564 states and 962 transitions. [2019-11-20 00:44:08,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:44:08,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-20 00:44:08,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:44:08,504 INFO L225 Difference]: With dead ends: 564 [2019-11-20 00:44:08,507 INFO L226 Difference]: Without dead ends: 385 [2019-11-20 00:44:08,511 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 00:44:08,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-11-20 00:44:08,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2019-11-20 00:44:08,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-20 00:44:08,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 584 transitions. [2019-11-20 00:44:08,594 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 584 transitions. Word has length 35 [2019-11-20 00:44:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:44:08,594 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 584 transitions. [2019-11-20 00:44:08,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:44:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 584 transitions. [2019-11-20 00:44:08,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 00:44:08,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:44:08,599 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 00:44:08,799 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:44:08,799 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:44:08,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:44:08,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1008290477, now seen corresponding path program 1 times [2019-11-20 00:44:08,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:44:08,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1373757149] [2019-11-20 00:44:08,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/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 00:44:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:09,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 00:44:09,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:44:09,033 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 00:44:09,033 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:44:09,053 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 00:44:09,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1373757149] [2019-11-20 00:44:09,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:44:09,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 00:44:09,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474528905] [2019-11-20 00:44:09,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:44:09,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:44:09,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:44:09,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:44:09,057 INFO L87 Difference]: Start difference. First operand 383 states and 584 transitions. Second operand 4 states. [2019-11-20 00:44:10,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:44:10,512 INFO L93 Difference]: Finished difference Result 878 states and 1351 transitions. [2019-11-20 00:44:10,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:44:10,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-20 00:44:10,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:44:10,516 INFO L225 Difference]: With dead ends: 878 [2019-11-20 00:44:10,517 INFO L226 Difference]: Without dead ends: 627 [2019-11-20 00:44:10,519 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 00:44:10,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-11-20 00:44:10,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 625. [2019-11-20 00:44:10,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-11-20 00:44:10,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 948 transitions. [2019-11-20 00:44:10,568 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 948 transitions. Word has length 58 [2019-11-20 00:44:10,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:44:10,569 INFO L462 AbstractCegarLoop]: Abstraction has 625 states and 948 transitions. [2019-11-20 00:44:10,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:44:10,569 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 948 transitions. [2019-11-20 00:44:10,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-20 00:44:10,577 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:44:10,577 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] [2019-11-20 00:44:10,783 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:44:10,784 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:44:10,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:44:10,784 INFO L82 PathProgramCache]: Analyzing trace with hash 647290871, now seen corresponding path program 1 times [2019-11-20 00:44:10,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:44:10,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1225556079] [2019-11-20 00:44:10,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/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 00:44:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:11,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 00:44:11,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:44:11,083 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 00:44:11,084 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:44:11,113 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 00:44:11,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1225556079] [2019-11-20 00:44:11,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:44:11,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 00:44:11,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105830701] [2019-11-20 00:44:11,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:44:11,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:44:11,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:44:11,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:44:11,116 INFO L87 Difference]: Start difference. First operand 625 states and 948 transitions. Second operand 4 states. [2019-11-20 00:44:11,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:44:11,776 INFO L93 Difference]: Finished difference Result 1364 states and 2081 transitions. [2019-11-20 00:44:11,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:44:11,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-20 00:44:11,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:44:11,782 INFO L225 Difference]: With dead ends: 1364 [2019-11-20 00:44:11,782 INFO L226 Difference]: Without dead ends: 871 [2019-11-20 00:44:11,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 216 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 00:44:11,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2019-11-20 00:44:11,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2019-11-20 00:44:11,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2019-11-20 00:44:11,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1319 transitions. [2019-11-20 00:44:11,833 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1319 transitions. Word has length 110 [2019-11-20 00:44:11,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:44:11,834 INFO L462 AbstractCegarLoop]: Abstraction has 871 states and 1319 transitions. [2019-11-20 00:44:11,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:44:11,834 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1319 transitions. [2019-11-20 00:44:11,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-20 00:44:11,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:44:11,839 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 00:44:12,041 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:44:12,043 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:44:12,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:44:12,044 INFO L82 PathProgramCache]: Analyzing trace with hash 349104543, now seen corresponding path program 1 times [2019-11-20 00:44:12,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:44:12,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [122635121] [2019-11-20 00:44:12,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/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 00:44:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:12,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 00:44:12,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:44:12,334 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 00:44:12,334 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:44:12,380 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 00:44:12,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [122635121] [2019-11-20 00:44:12,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:44:12,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 00:44:12,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37121905] [2019-11-20 00:44:12,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:44:12,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:44:12,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:44:12,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:44:12,384 INFO L87 Difference]: Start difference. First operand 871 states and 1319 transitions. Second operand 4 states. [2019-11-20 00:44:12,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:44:12,976 INFO L93 Difference]: Finished difference Result 1856 states and 2820 transitions. [2019-11-20 00:44:12,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:44:12,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-11-20 00:44:12,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:44:12,985 INFO L225 Difference]: With dead ends: 1856 [2019-11-20 00:44:12,986 INFO L226 Difference]: Without dead ends: 1117 [2019-11-20 00:44:12,987 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 00:44:12,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2019-11-20 00:44:13,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1117. [2019-11-20 00:44:13,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2019-11-20 00:44:13,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1686 transitions. [2019-11-20 00:44:13,043 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1686 transitions. Word has length 147 [2019-11-20 00:44:13,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:44:13,044 INFO L462 AbstractCegarLoop]: Abstraction has 1117 states and 1686 transitions. [2019-11-20 00:44:13,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:44:13,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1686 transitions. [2019-11-20 00:44:13,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-20 00:44:13,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:44:13,049 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] [2019-11-20 00:44:13,251 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:44:13,251 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:44:13,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:44:13,251 INFO L82 PathProgramCache]: Analyzing trace with hash 959908544, now seen corresponding path program 1 times [2019-11-20 00:44:13,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:44:13,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [928896371] [2019-11-20 00:44:13,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/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 00:44:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:15,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:44:15,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:44:15,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:15,462 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 00:44:15,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:15,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:15,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:44:15,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 00:44:15,506 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:15,507 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 00:44:15,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:15,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:15,510 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 00:44:15,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 00:44:15,579 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 00:44:15,579 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:44:15,612 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 00:44:15,616 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:15,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:15,617 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:44:15,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:15,618 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 00:44:15,619 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-20 00:44:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 00:44:15,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [928896371] [2019-11-20 00:44:15,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:44:15,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 00:44:15,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508872715] [2019-11-20 00:44:15,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:44:15,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:44:15,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:44:15,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:44:15,670 INFO L87 Difference]: Start difference. First operand 1117 states and 1686 transitions. Second operand 4 states. [2019-11-20 00:44:20,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:44:20,462 INFO L93 Difference]: Finished difference Result 3269 states and 4957 transitions. [2019-11-20 00:44:20,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:44:20,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-11-20 00:44:20,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:44:20,475 INFO L225 Difference]: With dead ends: 3269 [2019-11-20 00:44:20,476 INFO L226 Difference]: Without dead ends: 2160 [2019-11-20 00:44:20,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 319 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 00:44:20,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2019-11-20 00:44:20,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 1369. [2019-11-20 00:44:20,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2019-11-20 00:44:20,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2136 transitions. [2019-11-20 00:44:20,543 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2136 transitions. Word has length 163 [2019-11-20 00:44:20,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:44:20,543 INFO L462 AbstractCegarLoop]: Abstraction has 1369 states and 2136 transitions. [2019-11-20 00:44:20,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:44:20,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2136 transitions. [2019-11-20 00:44:20,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-20 00:44:20,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:44:20,554 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:44:20,764 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:44:20,767 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:44:20,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:44:20,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2081031755, now seen corresponding path program 1 times [2019-11-20 00:44:20,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:44:20,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [222155743] [2019-11-20 00:44:20,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/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 00:44:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:22,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:44:22,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:44:22,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:22,862 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 00:44:22,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:22,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:22,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:44:22,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 00:44:22,903 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:22,904 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 00:44:22,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:22,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:22,907 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 00:44:22,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 00:44:22,948 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 91 proven. 1 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 00:44:22,949 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:44:22,976 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 00:44:22,985 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:22,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:22,986 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:44:22,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:22,987 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 00:44:22,987 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-20 00:44:23,012 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 00:44:23,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [222155743] [2019-11-20 00:44:23,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:44:23,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 00:44:23,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466332163] [2019-11-20 00:44:23,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:44:23,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:44:23,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:44:23,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:44:23,014 INFO L87 Difference]: Start difference. First operand 1369 states and 2136 transitions. Second operand 4 states. [2019-11-20 00:44:27,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:44:27,340 INFO L93 Difference]: Finished difference Result 3773 states and 5857 transitions. [2019-11-20 00:44:27,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:44:27,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-11-20 00:44:27,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:44:27,353 INFO L225 Difference]: With dead ends: 3773 [2019-11-20 00:44:27,354 INFO L226 Difference]: Without dead ends: 2412 [2019-11-20 00:44:27,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 321 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 00:44:27,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2019-11-20 00:44:27,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 1630. [2019-11-20 00:44:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1630 states. [2019-11-20 00:44:27,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2604 transitions. [2019-11-20 00:44:27,426 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2604 transitions. Word has length 164 [2019-11-20 00:44:27,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:44:27,427 INFO L462 AbstractCegarLoop]: Abstraction has 1630 states and 2604 transitions. [2019-11-20 00:44:27,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:44:27,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2604 transitions. [2019-11-20 00:44:27,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-20 00:44:27,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:44:27,431 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 00:44:27,640 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:44:27,641 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:44:27,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:44:27,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1035384371, now seen corresponding path program 1 times [2019-11-20 00:44:27,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:44:27,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2053533082] [2019-11-20 00:44:27,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/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 00:44:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:44:29,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-20 00:44:29,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:44:29,619 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:29,619 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 00:44:29,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:29,897 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 00:44:29,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:29,900 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_178|], 2=[|v_#memory_$Pointer$.base_174|, |v_#memory_$Pointer$.base_175|]} [2019-11-20 00:44:29,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:29,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:29,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:29,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:29,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:29,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:29,997 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 00:44:29,998 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:30,169 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 00:44:30,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:30,175 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 00:44:30,310 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-20 00:44:30,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:30,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-11-20 00:44:30,333 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:30,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:30,367 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 00:44:30,368 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:98, output treesize:56 [2019-11-20 00:44:30,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,405 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,411 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:30,412 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 00:44:30,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:30,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:30,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:44:30,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 00:44:30,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,458 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:30,458 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 00:44:30,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:30,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:30,475 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:44:30,475 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 00:44:30,484 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_176|], 12=[|v_#memory_$Pointer$.base_181|]} [2019-11-20 00:44:30,492 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 00:44:30,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:30,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,612 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:30,612 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 00:44:30,613 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:30,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:30,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:44:30,678 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2019-11-20 00:44:30,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,700 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:30,701 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 00:44:30,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:30,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:30,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:44:30,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 00:44:30,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,748 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:30,748 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 00:44:30,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:44:30,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:30,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:44:30,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 00:44:30,786 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_174|], 20=[|v_#memory_$Pointer$.base_184|]} [2019-11-20 00:44:30,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,801 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 00:44:30,801 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 00:44:30,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:30,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:30,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:31,307 WARN L191 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-11-20 00:44:31,308 INFO L343 Elim1Store]: treesize reduction 34, result has 84.6 percent of original size [2019-11-20 00:44:31,308 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 00:44:31,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:31,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:31,661 INFO L496 ElimStorePlain]: Start of recursive call 3: 54 dim-0 vars, End of recursive call: 54 dim-0 vars, and 26 xjuncts. [2019-11-20 00:44:42,258 WARN L191 SmtUtils]: Spent 10.60 s on a formula simplification. DAG size of input: 787 DAG size of output: 387 [2019-11-20 00:44:42,259 INFO L567 ElimStorePlain]: treesize reduction 15333, result has 16.0 percent of original size [2019-11-20 00:44:42,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:42,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:42,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:44:42,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:42,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 00:44:42,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:42,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 00:44:42,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:42,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 00:44:42,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:44:42,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 66 dim-0 vars, and 1 xjuncts. [2019-11-20 00:44:42,297 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:3468 [2019-11-20 00:44:45,069 WARN L191 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 541 DAG size of output: 37 [2019-11-20 00:44:45,076 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_177|], 30=[|v_#memory_$Pointer$.base_185|]} [2019-11-20 00:44:45,088 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 00:44:45,246 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 00:44:45,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:44:45,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:45,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:45,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:45,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:45,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:45,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:45,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:45,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:45,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:44:45,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:18,313 WARN L191 SmtUtils]: Spent 33.05 s on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2019-11-20 00:45:18,313 INFO L343 Elim1Store]: treesize reduction 22, result has 92.6 percent of original size [2019-11-20 00:45:18,314 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 00:45:18,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:18,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:18,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:18,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:18,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:18,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:18,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:18,323 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:19,004 WARN L191 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 40 [2019-11-20 00:45:19,005 INFO L567 ElimStorePlain]: treesize reduction 14719, result has 0.6 percent of original size [2019-11-20 00:45:19,005 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 00:45:19,005 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:121, output treesize:83 [2019-11-20 00:45:19,044 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_196|], 30=[|v_#memory_$Pointer$.base_186|]} [2019-11-20 00:45:19,060 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 00:45:19,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:19,171 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-20 00:45:19,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:19,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:19,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:19,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:19,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:19,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:19,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:35,604 WARN L191 SmtUtils]: Spent 16.42 s on a formula simplification that was a NOOP. DAG size: 79 [2019-11-20 00:45:35,604 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:35,605 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 00:45:35,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:35,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:35,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:35,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:35,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:35,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:35,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:35,612 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:35,846 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 42 [2019-11-20 00:45:35,847 INFO L567 ElimStorePlain]: treesize reduction 3619, result has 2.5 percent of original size [2019-11-20 00:45:35,847 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 00:45:35,847 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:115, output treesize:92 [2019-11-20 00:45:35,948 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_175|], 2=[|v_#memory_int_197|], 20=[|v_#memory_$Pointer$.base_187|]} [2019-11-20 00:45:35,972 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 00:45:35,973 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 00:45:36,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:36,080 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 00:45:36,081 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:36,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:36,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:36,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:36,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:36,326 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 00:45:36,327 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:36,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 00:45:36,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:36,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:36,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:36,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:36,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:36,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:36,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:36,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:36,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:36,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:36,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:36,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:36,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:36,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:36,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:36,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:36,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:36,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:36,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:36,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:36,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:36,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:36,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:36,364 INFO L496 ElimStorePlain]: Start of recursive call 4: 136 dim-0 vars, End of recursive call: 136 dim-0 vars, and 16 xjuncts. [2019-11-20 00:45:56,961 WARN L191 SmtUtils]: Spent 20.60 s on a formula simplification that was a NOOP. DAG size: 1158 [2019-11-20 00:45:56,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:56,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:56,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 00:45:56,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:56,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:56,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:56,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 11 terms [2019-11-20 00:45:56,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:56,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:56,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:56,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 00:45:56,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:56,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:56,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-11-20 00:45:56,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:56,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:56,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:56,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:56,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:56,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:56,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:56,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 00:45:56,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:56,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:56,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:56,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:57,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:57,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-11-20 00:45:57,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:57,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-20 00:45:57,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:57,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:57,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:57,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:57,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:57,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:57,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:57,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:57,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:57,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:57,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:57,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 00:45:57,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:57,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:57,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:57,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:45:57,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:45:57,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 272 dim-0 vars, and 1 xjuncts. [2019-11-20 00:45:57,038 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:123, output treesize:2014 [2019-11-20 00:45:58,490 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 1424 DAG size of output: 24 [2019-11-20 00:45:58,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:45:58,497 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 00:45:58,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:58,512 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:58,512 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 00:45:58,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2019-11-20 00:45:58,570 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 00:45:58,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:58,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:58,577 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 00:45:58,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-11-20 00:45:58,836 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 00:45:58,836 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:45:58,895 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 00:45:58,896 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 00:45:58,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:58,901 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 00:45:58,902 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2019-11-20 00:45:58,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:45:58,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:58,963 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 00:45:58,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:58,972 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 00:45:58,972 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:15 [2019-11-20 00:45:59,009 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_191|], 2=[|v_#memory_$Pointer$.base_177|]} [2019-11-20 00:45:59,012 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 00:45:59,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:59,025 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 00:45:59,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:59,028 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 00:45:59,028 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:25 [2019-11-20 00:45:59,060 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-20 00:45:59,060 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 00:45:59,061 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 00:45:59,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:59,067 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 00:45:59,067 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:49 [2019-11-20 00:45:59,148 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 00:45:59,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:59,161 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 00:45:59,161 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-11-20 00:45:59,286 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 00:45:59,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:59,295 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 00:45:59,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-11-20 00:45:59,435 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_176|], 20=[|v_#memory_$Pointer$.base_195|]} [2019-11-20 00:45:59,444 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 00:45:59,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:59,498 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 00:45:59,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:59,517 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 00:45:59,517 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:90, output treesize:124 [2019-11-20 00:45:59,908 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 00:45:59,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:45:59,918 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 00:45:59,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-11-20 00:46:00,037 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 00:46:00,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:46:00,048 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 00:46:00,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:94 [2019-11-20 00:46:00,368 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 00:46:00,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2053533082] [2019-11-20 00:46:00,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:46:00,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-20 00:46:00,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057204671] [2019-11-20 00:46:00,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 00:46:00,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:46:00,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 00:46:00,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-20 00:46:00,371 INFO L87 Difference]: Start difference. First operand 1630 states and 2604 transitions. Second operand 13 states. [2019-11-20 00:47:28,523 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-11-20 00:47:29,714 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-20 00:47:34,713 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-11-20 00:49:22,814 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-11-20 00:49:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:49:38,261 INFO L93 Difference]: Finished difference Result 9659 states and 15034 transitions. [2019-11-20 00:49:38,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 00:49:38,264 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 164 [2019-11-20 00:49:38,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:49:38,309 INFO L225 Difference]: With dead ends: 9659 [2019-11-20 00:49:38,309 INFO L226 Difference]: Without dead ends: 8037 [2019-11-20 00:49:38,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 308 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=122, Invalid=297, Unknown=1, NotChecked=0, Total=420 [2019-11-20 00:49:38,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8037 states. [2019-11-20 00:49:38,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8037 to 3803. [2019-11-20 00:49:38,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3803 states. [2019-11-20 00:49:38,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3803 states to 3803 states and 6236 transitions. [2019-11-20 00:49:38,536 INFO L78 Accepts]: Start accepts. Automaton has 3803 states and 6236 transitions. Word has length 164 [2019-11-20 00:49:38,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:49:38,536 INFO L462 AbstractCegarLoop]: Abstraction has 3803 states and 6236 transitions. [2019-11-20 00:49:38,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 00:49:38,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3803 states and 6236 transitions. [2019-11-20 00:49:38,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-20 00:49:38,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:49:38,546 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 00:49:38,754 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:49:38,754 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:49:38,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:49:38,754 INFO L82 PathProgramCache]: Analyzing trace with hash 2024779857, now seen corresponding path program 1 times [2019-11-20 00:49:38,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:49:38,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [13983455] [2019-11-20 00:49:38,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/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 00:49:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:49:40,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-20 00:49:40,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:49:40,621 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:49:40,621 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 00:49:40,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:49:40,917 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 00:49:40,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:49:40,918 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_203|], 2=[|v_#memory_$Pointer$.base_200|, |v_#memory_$Pointer$.base_199|]} [2019-11-20 00:49:40,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:40,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:40,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:40,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:40,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:40,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,023 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 00:49:41,023 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:49:41,164 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-20 00:49:41,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:49:41,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,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, 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 00:49:41,200 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 00:49:41,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:49:41,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,271 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 00:49:41,272 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 00:49:41,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:49:41,301 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 00:49:41,301 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:98, output treesize:56 [2019-11-20 00:49:41,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,331 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:49:41,332 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 00:49:41,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:49:41,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:49:41,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:49:41,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 00:49:41,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,362 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:49:41,362 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 00:49:41,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:49:41,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:49:41,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:49:41,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 00:49:41,395 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_201|], 12=[|v_#memory_$Pointer$.base_206|]} [2019-11-20 00:49:41,399 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 00:49:41,500 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-20 00:49:41,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:49:41,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,515 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:49:41,516 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 00:49:41,516 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:49:41,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:49:41,539 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:49:41,540 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:56 [2019-11-20 00:49:41,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,560 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:49:41,560 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 00:49:41,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:49:41,583 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:49:41,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:49:41,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 00:49:41,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,599 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:49:41,599 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 00:49:41,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:49:41,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:49:41,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:49:41,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:56 [2019-11-20 00:49:41,624 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_187|], 20=[|v_#memory_$Pointer$.base_209|]} [2019-11-20 00:49:41,636 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,637 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 00:49:41,637 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 00:49:41,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:49:41,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:41,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:42,108 WARN L191 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-11-20 00:49:42,109 INFO L343 Elim1Store]: treesize reduction 34, result has 84.6 percent of original size [2019-11-20 00:49:42,109 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 00:49:42,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:49:42,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:49:42,212 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 19 xjuncts. [2019-11-20 00:49:43,282 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 116 DAG size of output: 37 [2019-11-20 00:49:43,282 INFO L567 ElimStorePlain]: treesize reduction 42838, result has 0.2 percent of original size [2019-11-20 00:49:43,282 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 00:49:43,283 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:83 [2019-11-20 00:49:43,324 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_202|], 30=[|v_#memory_$Pointer$.base_210|]} [2019-11-20 00:49:43,332 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 00:49:43,462 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 00:49:43,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:49:43,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:43,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:43,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:43,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:43,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:43,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:43,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:43,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:43,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:49:43,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:50:16,494 WARN L191 SmtUtils]: Spent 33.02 s on a formula simplification. DAG size of input: 92 DAG size of output: 92 [2019-11-20 00:50:16,494 INFO L343 Elim1Store]: treesize reduction 22, result has 92.6 percent of original size [2019-11-20 00:50:16,494 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 00:50:16,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:16,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:16,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:16,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:16,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:16,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:16,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:16,503 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:50:16,888 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 40 [2019-11-20 00:50:16,888 INFO L567 ElimStorePlain]: treesize reduction 14071, result has 0.6 percent of original size [2019-11-20 00:50:16,888 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 00:50:16,889 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:121, output treesize:83 [2019-11-20 00:50:16,919 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_210|], 30=[|v_#memory_$Pointer$.base_211|]} [2019-11-20 00:50:16,934 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 00:50:16,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:50:17,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:50:17,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:50:17,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:50:17,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:50:17,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:50:17,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:50:17,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:50:33,433 WARN L191 SmtUtils]: Spent 16.42 s on a formula simplification that was a NOOP. DAG size: 79 [2019-11-20 00:50:33,433 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:50:33,434 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 00:50:33,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:50:33,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:50:33,438 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:50:33,678 WARN L191 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 42 [2019-11-20 00:50:33,679 INFO L567 ElimStorePlain]: treesize reduction 5568, result has 1.6 percent of original size [2019-11-20 00:50:33,679 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 00:50:33,679 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:115, output treesize:92 [2019-11-20 00:50:33,726 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_188|], 2=[|v_#memory_int_211|], 20=[|v_#memory_$Pointer$.base_212|]} [2019-11-20 00:50:33,742 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 00:50:33,743 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 00:50:33,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:50:33,797 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 00:50:33,798 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:50:33,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:50:33,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:50:33,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:50:33,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:50:33,966 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-20 00:50:33,966 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:50:33,966 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 00:50:33,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:33,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:34,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:34,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:34,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:34,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:34,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:34,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:34,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:34,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:34,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:34,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:34,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:34,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:34,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:34,058 INFO L496 ElimStorePlain]: Start of recursive call 4: 125 dim-0 vars, End of recursive call: 125 dim-0 vars, and 15 xjuncts. [2019-11-20 00:50:53,577 WARN L191 SmtUtils]: Spent 19.52 s on a formula simplification that was a NOOP. DAG size: 1084 [2019-11-20 00:50:53,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:50:53,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:53,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:50:53,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:53,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:50:53,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 00:50:53,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:53,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:50:53,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-11-20 00:50:53,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 00:50:53,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:53,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:53,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 00:50:53,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 00:50:53,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:53,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:53,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:53,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:53,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:50:53,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:53,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 00:50:53,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:53,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 00:50:53,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:53,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-20 00:50:53,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 00:50:53,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 00:50:53,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:53,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:53,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:53,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:53,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 00:50:53,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-20 00:50:53,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:53,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:53,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:53,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:50:53,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 250 dim-0 vars, and 1 xjuncts. [2019-11-20 00:50:53,641 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:123, output treesize:1922 [2019-11-20 00:50:55,093 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 1345 DAG size of output: 25 [2019-11-20 00:50:55,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:50:55,101 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 00:50:55,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:50:55,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:50:55,118 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 00:50:55,118 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:37 [2019-11-20 00:50:55,180 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 33 treesize of output 15 [2019-11-20 00:50:55,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:50:55,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:50:55,200 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 00:50:55,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:3 [2019-11-20 00:50:55,484 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 00:50:55,484 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:50:55,538 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 00:50:55,539 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 00:50:55,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:50:55,544 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 00:50:55,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2019-11-20 00:50:55,599 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 00:50:55,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [13983455] [2019-11-20 00:50:55,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:50:55,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-11-20 00:50:55,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348604602] [2019-11-20 00:50:55,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:50:55,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:50:55,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:50:55,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-20 00:50:55,601 INFO L87 Difference]: Start difference. First operand 3803 states and 6236 transitions. Second operand 4 states. [2019-11-20 00:50:58,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:50:58,579 INFO L93 Difference]: Finished difference Result 9035 states and 14524 transitions. [2019-11-20 00:50:58,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:50:58,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-11-20 00:50:58,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:50:58,611 INFO L225 Difference]: With dead ends: 9035 [2019-11-20 00:50:58,611 INFO L226 Difference]: Without dead ends: 5240 [2019-11-20 00:50:58,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 318 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-20 00:50:58,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5240 states. [2019-11-20 00:50:58,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5240 to 3981. [2019-11-20 00:50:58,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3981 states. [2019-11-20 00:50:58,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 6574 transitions. [2019-11-20 00:50:58,841 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 6574 transitions. Word has length 165 [2019-11-20 00:50:58,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:50:58,842 INFO L462 AbstractCegarLoop]: Abstraction has 3981 states and 6574 transitions. [2019-11-20 00:50:58,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:50:58,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 6574 transitions. [2019-11-20 00:50:58,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 00:50:58,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:50:58,851 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 00:50:59,059 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:50:59,060 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:50:59,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:50:59,060 INFO L82 PathProgramCache]: Analyzing trace with hash 515220215, now seen corresponding path program 1 times [2019-11-20 00:50:59,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:50:59,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1889641211] [2019-11-20 00:50:59,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/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 00:50:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:50:59,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 00:50:59,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:50:59,471 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_192|, |v_#memory_$Pointer$.base_216|], 4=[|v_#memory_int_216|]} [2019-11-20 00:50:59,476 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 00:50:59,477 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 00:50:59,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:50:59,488 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 00:50:59,489 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 00:50:59,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:50:59,530 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:50:59,530 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 00:50:59,531 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:07,658 WARN L191 SmtUtils]: Spent 8.13 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 00:51:07,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:07,659 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:51:07,659 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-20 00:51:07,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 19 treesize of output 7 [2019-11-20 00:51:07,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:07,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:07,671 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 00:51:07,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-20 00:51:07,697 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 00:51:07,697 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:51:07,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 00:51:07,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1889641211] [2019-11-20 00:51:07,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:51:07,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 00:51:07,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815169994] [2019-11-20 00:51:07,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 00:51:07,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:51:07,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 00:51:07,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:51:07,741 INFO L87 Difference]: Start difference. First operand 3981 states and 6574 transitions. Second operand 6 states. [2019-11-20 00:51:17,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:51:17,108 INFO L93 Difference]: Finished difference Result 9968 states and 16010 transitions. [2019-11-20 00:51:17,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:51:17,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2019-11-20 00:51:17,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:51:17,142 INFO L225 Difference]: With dead ends: 9968 [2019-11-20 00:51:17,142 INFO L226 Difference]: Without dead ends: 6443 [2019-11-20 00:51:17,147 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 00:51:17,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6443 states. [2019-11-20 00:51:17,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6443 to 4163. [2019-11-20 00:51:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4163 states. [2019-11-20 00:51:17,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4163 states to 4163 states and 6839 transitions. [2019-11-20 00:51:17,401 INFO L78 Accepts]: Start accepts. Automaton has 4163 states and 6839 transitions. Word has length 178 [2019-11-20 00:51:17,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:51:17,402 INFO L462 AbstractCegarLoop]: Abstraction has 4163 states and 6839 transitions. [2019-11-20 00:51:17,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 00:51:17,402 INFO L276 IsEmpty]: Start isEmpty. Operand 4163 states and 6839 transitions. [2019-11-20 00:51:17,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 00:51:17,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:51:17,411 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 00:51:17,616 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:51:17,616 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:51:17,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:17,616 INFO L82 PathProgramCache]: Analyzing trace with hash 95867119, now seen corresponding path program 2 times [2019-11-20 00:51:17,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:51:17,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [556426421] [2019-11-20 00:51:17,617 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/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 00:51:18,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 00:51:18,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:51:18,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:51:18,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:51:18,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:51:18,349 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 00:51:18,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:18,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:18,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:51:18,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 00:51:18,375 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:18,375 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 00:51:18,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:18,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:18,380 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 00:51:18,380 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 00:51:18,404 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 00:51:18,404 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:51:18,425 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 00:51:18,427 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:18,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:18,428 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:51:18,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:18,429 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 00:51:18,429 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-20 00:51:18,442 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 00:51:18,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [556426421] [2019-11-20 00:51:18,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:51:18,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 00:51:18,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268846320] [2019-11-20 00:51:18,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:51:18,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:51:18,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:51:18,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:51:18,444 INFO L87 Difference]: Start difference. First operand 4163 states and 6839 transitions. Second operand 4 states. [2019-11-20 00:51:21,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:51:21,125 INFO L93 Difference]: Finished difference Result 7664 states and 12227 transitions. [2019-11-20 00:51:21,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:51:21,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-20 00:51:21,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:51:21,136 INFO L225 Difference]: With dead ends: 7664 [2019-11-20 00:51:21,137 INFO L226 Difference]: Without dead ends: 5413 [2019-11-20 00:51:21,140 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 00:51:21,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5413 states. [2019-11-20 00:51:21,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5413 to 4163. [2019-11-20 00:51:21,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4163 states. [2019-11-20 00:51:21,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4163 states to 4163 states and 6777 transitions. [2019-11-20 00:51:21,314 INFO L78 Accepts]: Start accepts. Automaton has 4163 states and 6777 transitions. Word has length 178 [2019-11-20 00:51:21,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:51:21,314 INFO L462 AbstractCegarLoop]: Abstraction has 4163 states and 6777 transitions. [2019-11-20 00:51:21,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:51:21,314 INFO L276 IsEmpty]: Start isEmpty. Operand 4163 states and 6777 transitions. [2019-11-20 00:51:21,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 00:51:21,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:51:21,324 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 00:51:21,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:51:21,529 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:51:21,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:21,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1520973597, now seen corresponding path program 1 times [2019-11-20 00:51:21,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:51:21,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1084538672] [2019-11-20 00:51:21,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/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 00:51:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:51:21,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 00:51:21,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:51:21,946 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_240|, |v_#memory_$Pointer$.offset_216|], 4=[|v_#memory_int_241|]} [2019-11-20 00:51:21,948 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 00:51:21,948 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 00:51:21,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:21,958 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 00:51:21,959 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 00:51:21,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:22,000 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:22,001 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 00:51:22,001 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:30,153 WARN L191 SmtUtils]: Spent 8.15 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 00:51:30,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:30,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:51:30,154 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-20 00:51:30,162 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 00:51:30,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:30,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:30,164 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 00:51:30,164 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-20 00:51:30,193 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-20 00:51:30,193 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:51:30,236 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-20 00:51:30,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1084538672] [2019-11-20 00:51:30,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:51:30,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 00:51:30,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706345366] [2019-11-20 00:51:30,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 00:51:30,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:51:30,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 00:51:30,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:51:30,238 INFO L87 Difference]: Start difference. First operand 4163 states and 6777 transitions. Second operand 6 states. [2019-11-20 00:51:39,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:51:39,032 INFO L93 Difference]: Finished difference Result 10999 states and 17505 transitions. [2019-11-20 00:51:39,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:51:39,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2019-11-20 00:51:39,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:51:39,053 INFO L225 Difference]: With dead ends: 10999 [2019-11-20 00:51:39,053 INFO L226 Difference]: Without dead ends: 6855 [2019-11-20 00:51:39,057 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 00:51:39,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6855 states. [2019-11-20 00:51:39,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6855 to 4857. [2019-11-20 00:51:39,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4857 states. [2019-11-20 00:51:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4857 states to 4857 states and 7971 transitions. [2019-11-20 00:51:39,252 INFO L78 Accepts]: Start accepts. Automaton has 4857 states and 7971 transitions. Word has length 178 [2019-11-20 00:51:39,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:51:39,252 INFO L462 AbstractCegarLoop]: Abstraction has 4857 states and 7971 transitions. [2019-11-20 00:51:39,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 00:51:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 4857 states and 7971 transitions. [2019-11-20 00:51:39,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-11-20 00:51:39,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:51:39,261 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 00:51:39,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:51:39,465 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:51:39,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:39,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1100379907, now seen corresponding path program 2 times [2019-11-20 00:51:39,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:51:39,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2052377929] [2019-11-20 00:51:39,467 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/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 00:51:40,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 00:51:40,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:51:40,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 00:51:40,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:51:40,186 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 00:51:40,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:40,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:40,201 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:51:40,201 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-20 00:51:40,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:51:40,223 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-20 00:51:40,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:40,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:40,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:51:40,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 00:51:40,260 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:40,260 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 00:51:40,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:40,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:40,263 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 00:51:40,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 00:51:40,299 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 114 proven. 2 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-11-20 00:51:40,300 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:51:40,356 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-11-20 00:51:40,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2052377929] [2019-11-20 00:51:40,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:51:40,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-20 00:51:40,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096645655] [2019-11-20 00:51:40,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:51:40,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:51:40,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:51:40,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:51:40,359 INFO L87 Difference]: Start difference. First operand 4857 states and 7971 transitions. Second operand 4 states. [2019-11-20 00:51:43,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:51:43,567 INFO L93 Difference]: Finished difference Result 8699 states and 13908 transitions. [2019-11-20 00:51:43,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:51:43,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-11-20 00:51:43,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:51:43,578 INFO L225 Difference]: With dead ends: 8699 [2019-11-20 00:51:43,578 INFO L226 Difference]: Without dead ends: 6101 [2019-11-20 00:51:43,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 347 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-20 00:51:43,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6101 states. [2019-11-20 00:51:43,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6101 to 4857. [2019-11-20 00:51:43,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4857 states. [2019-11-20 00:51:43,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4857 states to 4857 states and 7893 transitions. [2019-11-20 00:51:43,786 INFO L78 Accepts]: Start accepts. Automaton has 4857 states and 7893 transitions. Word has length 178 [2019-11-20 00:51:43,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:51:43,787 INFO L462 AbstractCegarLoop]: Abstraction has 4857 states and 7893 transitions. [2019-11-20 00:51:43,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:51:43,787 INFO L276 IsEmpty]: Start isEmpty. Operand 4857 states and 7893 transitions. [2019-11-20 00:51:43,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 00:51:43,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:51:43,795 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 00:51:44,001 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:51:44,001 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:51:44,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:51:44,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1395777946, now seen corresponding path program 1 times [2019-11-20 00:51:44,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:51:44,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [894940575] [2019-11-20 00:51:44,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/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 00:51:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:51:44,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 00:51:44,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:51:44,453 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_256|, |v_#memory_$Pointer$.offset_232|], 4=[|v_#memory_int_259|]} [2019-11-20 00:51:44,456 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 00:51:44,457 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 00:51:44,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:44,475 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 00:51:44,476 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 00:51:44,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:44,547 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:44,548 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 00:51:44,548 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:52,695 WARN L191 SmtUtils]: Spent 8.15 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 00:51:52,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:52,695 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:51:52,695 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-20 00:51:52,703 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 00:51:52,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:51:52,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:51:52,705 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 00:51:52,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-20 00:51:52,727 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 00:51:52,727 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:51:52,761 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 00:51:52,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [894940575] [2019-11-20 00:51:52,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:51:52,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 00:51:52,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079525873] [2019-11-20 00:51:52,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 00:51:52,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:51:52,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 00:51:52,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:51:52,762 INFO L87 Difference]: Start difference. First operand 4857 states and 7893 transitions. Second operand 6 states. [2019-11-20 00:52:01,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:52:01,048 INFO L93 Difference]: Finished difference Result 12429 states and 19772 transitions. [2019-11-20 00:52:01,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:52:01,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2019-11-20 00:52:01,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:52:01,061 INFO L225 Difference]: With dead ends: 12429 [2019-11-20 00:52:01,062 INFO L226 Difference]: Without dead ends: 7591 [2019-11-20 00:52:01,068 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 00:52:01,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7591 states. [2019-11-20 00:52:01,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7591 to 5209. [2019-11-20 00:52:01,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5209 states. [2019-11-20 00:52:01,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5209 states to 5209 states and 8401 transitions. [2019-11-20 00:52:01,279 INFO L78 Accepts]: Start accepts. Automaton has 5209 states and 8401 transitions. Word has length 179 [2019-11-20 00:52:01,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:52:01,279 INFO L462 AbstractCegarLoop]: Abstraction has 5209 states and 8401 transitions. [2019-11-20 00:52:01,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 00:52:01,280 INFO L276 IsEmpty]: Start isEmpty. Operand 5209 states and 8401 transitions. [2019-11-20 00:52:01,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-20 00:52:01,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:52:01,288 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 00:52:01,493 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:52:01,493 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:52:01,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:52:01,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1163672378, now seen corresponding path program 2 times [2019-11-20 00:52:01,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:52:01,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [60923011] [2019-11-20 00:52:01,494 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/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 00:52:02,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 00:52:02,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:52:02,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 00:52:02,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:52:02,318 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 00:52:02,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:02,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:02,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:52:02,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-20 00:52:02,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:02,350 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-20 00:52:02,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:02,362 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:02,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:52:02,363 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-20 00:52:02,388 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:02,388 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 00:52:02,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:02,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:02,391 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 00:52:02,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 00:52:02,435 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 119 proven. 2 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-11-20 00:52:02,435 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:52:02,513 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-11-20 00:52:02,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [60923011] [2019-11-20 00:52:02,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:52:02,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-20 00:52:02,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545334523] [2019-11-20 00:52:02,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:52:02,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:52:02,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:52:02,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:52:02,515 INFO L87 Difference]: Start difference. First operand 5209 states and 8401 transitions. Second operand 4 states. [2019-11-20 00:52:06,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:52:06,262 INFO L93 Difference]: Finished difference Result 9227 states and 14547 transitions. [2019-11-20 00:52:06,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:52:06,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-11-20 00:52:06,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:52:06,274 INFO L225 Difference]: With dead ends: 9227 [2019-11-20 00:52:06,274 INFO L226 Difference]: Without dead ends: 6453 [2019-11-20 00:52:06,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 349 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-20 00:52:06,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6453 states. [2019-11-20 00:52:06,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6453 to 5209. [2019-11-20 00:52:06,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5209 states. [2019-11-20 00:52:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5209 states to 5209 states and 8307 transitions. [2019-11-20 00:52:06,526 INFO L78 Accepts]: Start accepts. Automaton has 5209 states and 8307 transitions. Word has length 179 [2019-11-20 00:52:06,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:52:06,526 INFO L462 AbstractCegarLoop]: Abstraction has 5209 states and 8307 transitions. [2019-11-20 00:52:06,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:52:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 5209 states and 8307 transitions. [2019-11-20 00:52:06,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-20 00:52:06,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:52:06,532 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] [2019-11-20 00:52:06,735 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:52:06,735 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:52:06,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:52:06,736 INFO L82 PathProgramCache]: Analyzing trace with hash 755609064, now seen corresponding path program 1 times [2019-11-20 00:52:06,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:52:06,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1266114551] [2019-11-20 00:52:06,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/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 00:52:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:52:07,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 00:52:07,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:52:07,192 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_252|, |v_#memory_$Pointer$.base_276|], 4=[|v_#memory_int_281|]} [2019-11-20 00:52:07,194 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 00:52:07,194 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 00:52:07,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:07,205 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 00:52:07,206 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 00:52:07,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:07,254 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:07,254 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 00:52:07,255 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:15,398 WARN L191 SmtUtils]: Spent 8.14 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 00:52:15,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:15,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:52:15,399 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-20 00:52:15,406 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 00:52:15,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:15,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:15,408 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 00:52:15,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-20 00:52:15,435 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-20 00:52:15,435 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:52:15,505 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-20 00:52:15,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1266114551] [2019-11-20 00:52:15,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:52:15,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 00:52:15,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638659513] [2019-11-20 00:52:15,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 00:52:15,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:52:15,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 00:52:15,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:52:15,507 INFO L87 Difference]: Start difference. First operand 5209 states and 8307 transitions. Second operand 6 states. [2019-11-20 00:52:21,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:52:21,046 INFO L93 Difference]: Finished difference Result 13251 states and 20725 transitions. [2019-11-20 00:52:21,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:52:21,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-11-20 00:52:21,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:52:21,053 INFO L225 Difference]: With dead ends: 13251 [2019-11-20 00:52:21,053 INFO L226 Difference]: Without dead ends: 8061 [2019-11-20 00:52:21,057 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 00:52:21,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8061 states. [2019-11-20 00:52:21,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8061 to 5995. [2019-11-20 00:52:21,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5995 states. [2019-11-20 00:52:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5995 states to 5995 states and 9561 transitions. [2019-11-20 00:52:21,221 INFO L78 Accepts]: Start accepts. Automaton has 5995 states and 9561 transitions. Word has length 180 [2019-11-20 00:52:21,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:52:21,221 INFO L462 AbstractCegarLoop]: Abstraction has 5995 states and 9561 transitions. [2019-11-20 00:52:21,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 00:52:21,222 INFO L276 IsEmpty]: Start isEmpty. Operand 5995 states and 9561 transitions. [2019-11-20 00:52:21,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-20 00:52:21,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:52:21,228 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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 00:52:21,428 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:52:21,429 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:52:21,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:52:21,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1249305674, now seen corresponding path program 1 times [2019-11-20 00:52:21,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:52:21,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [334832901] [2019-11-20 00:52:21,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/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 00:52:21,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:52:21,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 00:52:21,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:52:21,844 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_283|, |v_#memory_$Pointer$.offset_259|], 4=[|v_#memory_int_288|]} [2019-11-20 00:52:21,899 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 00:52:21,900 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 00:52:21,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:21,909 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 00:52:21,910 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 00:52:21,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:21,967 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:21,967 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 00:52:21,967 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:30,085 WARN L191 SmtUtils]: Spent 8.12 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 00:52:30,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:30,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:52:30,086 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-20 00:52:30,095 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 00:52:30,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:30,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:30,097 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 00:52:30,097 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-20 00:52:30,119 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-20 00:52:30,119 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:52:30,157 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-20 00:52:30,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [334832901] [2019-11-20 00:52:30,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:52:30,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 00:52:30,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473695431] [2019-11-20 00:52:30,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 00:52:30,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:52:30,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 00:52:30,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:52:30,159 INFO L87 Difference]: Start difference. First operand 5995 states and 9561 transitions. Second operand 6 states. [2019-11-20 00:52:39,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:52:39,571 INFO L93 Difference]: Finished difference Result 13576 states and 21232 transitions. [2019-11-20 00:52:39,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:52:39,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2019-11-20 00:52:39,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:52:39,579 INFO L225 Difference]: With dead ends: 13576 [2019-11-20 00:52:39,579 INFO L226 Difference]: Without dead ends: 8241 [2019-11-20 00:52:39,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 356 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 00:52:39,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8241 states. [2019-11-20 00:52:39,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8241 to 6004. [2019-11-20 00:52:39,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6004 states. [2019-11-20 00:52:39,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6004 states to 6004 states and 9477 transitions. [2019-11-20 00:52:39,770 INFO L78 Accepts]: Start accepts. Automaton has 6004 states and 9477 transitions. Word has length 181 [2019-11-20 00:52:39,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:52:39,771 INFO L462 AbstractCegarLoop]: Abstraction has 6004 states and 9477 transitions. [2019-11-20 00:52:39,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 00:52:39,771 INFO L276 IsEmpty]: Start isEmpty. Operand 6004 states and 9477 transitions. [2019-11-20 00:52:39,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-20 00:52:39,777 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:52:39,778 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 00:52:39,978 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:52:39,978 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:52:39,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:52:39,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1190289486, now seen corresponding path program 1 times [2019-11-20 00:52:39,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:52:39,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1152280160] [2019-11-20 00:52:39,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/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 00:52:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:52:40,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 00:52:40,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:52:40,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:40,601 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 00:52:40,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:40,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:40,612 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 00:52:40,612 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 00:52:40,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:40,625 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:40,625 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 00:52:40,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:40,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:40,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:52:40,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 00:52:40,636 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 00:52:40,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:40,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:40,639 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 00:52:40,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 00:52:40,662 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 00:52:40,662 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:52:40,728 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 00:52:40,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1152280160] [2019-11-20 00:52:40,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:52:40,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 00:52:40,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625136446] [2019-11-20 00:52:40,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 00:52:40,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:52:40,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 00:52:40,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:52:40,730 INFO L87 Difference]: Start difference. First operand 6004 states and 9477 transitions. Second operand 6 states. [2019-11-20 00:52:47,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:52:47,801 INFO L93 Difference]: Finished difference Result 10479 states and 16227 transitions. [2019-11-20 00:52:47,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:52:47,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2019-11-20 00:52:47,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:52:47,808 INFO L225 Difference]: With dead ends: 10479 [2019-11-20 00:52:47,808 INFO L226 Difference]: Without dead ends: 7303 [2019-11-20 00:52:47,812 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 00:52:47,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7303 states. [2019-11-20 00:52:47,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7303 to 6004. [2019-11-20 00:52:47,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6004 states. [2019-11-20 00:52:47,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6004 states to 6004 states and 9365 transitions. [2019-11-20 00:52:47,997 INFO L78 Accepts]: Start accepts. Automaton has 6004 states and 9365 transitions. Word has length 181 [2019-11-20 00:52:47,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:52:47,997 INFO L462 AbstractCegarLoop]: Abstraction has 6004 states and 9365 transitions. [2019-11-20 00:52:47,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 00:52:47,997 INFO L276 IsEmpty]: Start isEmpty. Operand 6004 states and 9365 transitions. [2019-11-20 00:52:48,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-20 00:52:48,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:52:48,004 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 00:52:48,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:52:48,204 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:52:48,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:52:48,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1325648245, now seen corresponding path program 1 times [2019-11-20 00:52:48,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:52:48,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1142861728] [2019-11-20 00:52:48,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/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 00:52:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:52:48,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 00:52:48,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:52:48,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:48,918 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 00:52:48,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:48,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:48,928 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 00:52:48,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-20 00:52:48,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:48,942 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:48,942 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 00:52:48,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:48,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:48,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:52:48,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-20 00:52:48,952 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 00:52:48,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:48,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:48,954 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 00:52:48,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-20 00:52:48,985 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 00:52:48,986 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:52:49,048 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 00:52:49,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1142861728] [2019-11-20 00:52:49,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:52:49,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 00:52:49,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53732829] [2019-11-20 00:52:49,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 00:52:49,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:52:49,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 00:52:49,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:52:49,050 INFO L87 Difference]: Start difference. First operand 6004 states and 9365 transitions. Second operand 6 states. [2019-11-20 00:52:54,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:52:54,178 INFO L93 Difference]: Finished difference Result 10379 states and 15924 transitions. [2019-11-20 00:52:54,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:52:54,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 182 [2019-11-20 00:52:54,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:52:54,185 INFO L225 Difference]: With dead ends: 10379 [2019-11-20 00:52:54,185 INFO L226 Difference]: Without dead ends: 7203 [2019-11-20 00:52:54,189 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 00:52:54,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7203 states. [2019-11-20 00:52:54,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7203 to 6004. [2019-11-20 00:52:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6004 states. [2019-11-20 00:52:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6004 states to 6004 states and 9253 transitions. [2019-11-20 00:52:54,456 INFO L78 Accepts]: Start accepts. Automaton has 6004 states and 9253 transitions. Word has length 182 [2019-11-20 00:52:54,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:52:54,456 INFO L462 AbstractCegarLoop]: Abstraction has 6004 states and 9253 transitions. [2019-11-20 00:52:54,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 00:52:54,457 INFO L276 IsEmpty]: Start isEmpty. Operand 6004 states and 9253 transitions. [2019-11-20 00:52:54,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-20 00:52:54,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:52:54,462 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:52:54,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:52:54,663 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:52:54,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:52:54,663 INFO L82 PathProgramCache]: Analyzing trace with hash -846659623, now seen corresponding path program 1 times [2019-11-20 00:52:54,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:52:54,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1985196583] [2019-11-20 00:52:54,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:52:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:52:57,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:52:57,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:52:57,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:52:57,756 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 00:52:57,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:57,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:57,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:52:57,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 00:52:57,806 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:57,806 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 00:52:57,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:57,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:57,816 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 00:52:57,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 00:52:57,882 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 204 proven. 2 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 00:52:57,882 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:52:57,906 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 00:52:57,908 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:52:57,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:57,909 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:52:57,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:52:57,910 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 00:52:57,910 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-20 00:52:57,931 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 00:52:57,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1985196583] [2019-11-20 00:52:57,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:52:57,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 00:52:57,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392786293] [2019-11-20 00:52:57,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:52:57,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:52:57,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:52:57,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:52:57,933 INFO L87 Difference]: Start difference. First operand 6004 states and 9253 transitions. Second operand 4 states. [2019-11-20 00:53:00,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:53:00,898 INFO L93 Difference]: Finished difference Result 13901 states and 21223 transitions. [2019-11-20 00:53:00,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:53:00,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-11-20 00:53:00,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:53:00,906 INFO L225 Difference]: With dead ends: 13901 [2019-11-20 00:53:00,906 INFO L226 Difference]: Without dead ends: 7916 [2019-11-20 00:53:00,912 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 375 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 00:53:00,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7916 states. [2019-11-20 00:53:01,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7916 to 6472. [2019-11-20 00:53:01,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6472 states. [2019-11-20 00:53:01,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6472 states to 6472 states and 9869 transitions. [2019-11-20 00:53:01,129 INFO L78 Accepts]: Start accepts. Automaton has 6472 states and 9869 transitions. Word has length 191 [2019-11-20 00:53:01,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:53:01,129 INFO L462 AbstractCegarLoop]: Abstraction has 6472 states and 9869 transitions. [2019-11-20 00:53:01,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:53:01,129 INFO L276 IsEmpty]: Start isEmpty. Operand 6472 states and 9869 transitions. [2019-11-20 00:53:01,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-20 00:53:01,136 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:53:01,136 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:53:01,337 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:53:01,337 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:53:01,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:53:01,337 INFO L82 PathProgramCache]: Analyzing trace with hash -69051324, now seen corresponding path program 1 times [2019-11-20 00:53:01,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:53:01,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1103859116] [2019-11-20 00:53:01,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:53:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:53:04,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:53:04,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:53:04,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:53:04,560 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 00:53:04,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:53:04,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:53:04,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:53:04,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 00:53:04,592 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:53:04,593 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 00:53:04,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:53:04,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:53:04,595 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 00:53:04,595 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 00:53:04,733 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 207 proven. 1 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 00:53:04,733 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:53:04,770 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 00:53:04,775 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:53:04,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:53:04,777 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:53:04,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:53:04,778 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 00:53:04,778 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-20 00:53:04,805 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 00:53:04,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1103859116] [2019-11-20 00:53:04,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:53:04,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-20 00:53:04,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999765854] [2019-11-20 00:53:04,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:53:04,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:53:04,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:53:04,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:53:04,807 INFO L87 Difference]: Start difference. First operand 6472 states and 9869 transitions. Second operand 4 states. [2019-11-20 00:53:07,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:53:07,763 INFO L93 Difference]: Finished difference Result 14063 states and 21249 transitions. [2019-11-20 00:53:07,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:53:07,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-20 00:53:07,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:53:07,779 INFO L225 Difference]: With dead ends: 14063 [2019-11-20 00:53:07,779 INFO L226 Difference]: Without dead ends: 7610 [2019-11-20 00:53:07,784 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 377 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 00:53:07,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7610 states. [2019-11-20 00:53:08,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7610 to 6472. [2019-11-20 00:53:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6472 states. [2019-11-20 00:53:08,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6472 states to 6472 states and 9783 transitions. [2019-11-20 00:53:08,093 INFO L78 Accepts]: Start accepts. Automaton has 6472 states and 9783 transitions. Word has length 192 [2019-11-20 00:53:08,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:53:08,094 INFO L462 AbstractCegarLoop]: Abstraction has 6472 states and 9783 transitions. [2019-11-20 00:53:08,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:53:08,094 INFO L276 IsEmpty]: Start isEmpty. Operand 6472 states and 9783 transitions. [2019-11-20 00:53:08,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-20 00:53:08,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:53:08,099 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 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 00:53:08,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:53:08,300 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:53:08,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:53:08,300 INFO L82 PathProgramCache]: Analyzing trace with hash -791919411, now seen corresponding path program 1 times [2019-11-20 00:53:08,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:53:08,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [200233694] [2019-11-20 00:53:08,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:53:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:53:13,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:53:13,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:53:13,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:53:13,542 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 00:53:13,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:53:13,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:53:13,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:53:13,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 00:53:13,570 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:53:13,570 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 00:53:13,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:53:13,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:53:13,572 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 00:53:13,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 00:53:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 00:53:13,619 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:53:13,637 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 00:53:13,639 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:53:13,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:53:13,640 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:53:13,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:53:13,640 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 00:53:13,640 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-20 00:53:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 00:53:13,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [200233694] [2019-11-20 00:53:13,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:53:13,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-20 00:53:13,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66845795] [2019-11-20 00:53:13,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 00:53:13,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:53:13,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 00:53:13,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:53:13,667 INFO L87 Difference]: Start difference. First operand 6472 states and 9783 transitions. Second operand 7 states. [2019-11-20 00:53:23,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:53:23,739 INFO L93 Difference]: Finished difference Result 15721 states and 23417 transitions. [2019-11-20 00:53:23,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 00:53:23,740 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2019-11-20 00:53:23,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:53:23,747 INFO L225 Difference]: With dead ends: 15721 [2019-11-20 00:53:23,747 INFO L226 Difference]: Without dead ends: 9268 [2019-11-20 00:53:23,752 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 378 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 00:53:23,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9268 states. [2019-11-20 00:53:23,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9268 to 7138. [2019-11-20 00:53:23,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7138 states. [2019-11-20 00:53:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7138 states to 7138 states and 10741 transitions. [2019-11-20 00:53:23,984 INFO L78 Accepts]: Start accepts. Automaton has 7138 states and 10741 transitions. Word has length 192 [2019-11-20 00:53:23,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:53:23,984 INFO L462 AbstractCegarLoop]: Abstraction has 7138 states and 10741 transitions. [2019-11-20 00:53:23,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 00:53:23,984 INFO L276 IsEmpty]: Start isEmpty. Operand 7138 states and 10741 transitions. [2019-11-20 00:53:23,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-20 00:53:23,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:53:23,988 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 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 00:53:24,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:53:24,189 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:53:24,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:53:24,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1406420013, now seen corresponding path program 1 times [2019-11-20 00:53:24,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:53:24,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [897701440] [2019-11-20 00:53:24,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:53:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:53:28,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 00:53:28,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:53:28,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 00:53:28,636 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 00:53:28,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:53:28,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:53:28,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:53:28,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-20 00:53:28,672 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:53:28,673 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 00:53:28,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 00:53:28,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:53:28,674 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 00:53:28,675 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-20 00:53:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 00:53:28,725 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 00:53:28,744 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 00:53:28,745 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 00:53:28,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:53:28,746 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 00:53:28,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 00:53:28,747 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 00:53:28,747 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-20 00:53:28,840 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-20 00:53:28,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [897701440] [2019-11-20 00:53:28,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:53:28,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-20 00:53:28,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105524970] [2019-11-20 00:53:28,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 00:53:28,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 00:53:28,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 00:53:28,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:53:28,842 INFO L87 Difference]: Start difference. First operand 7138 states and 10741 transitions. Second operand 7 states. [2019-11-20 00:53:37,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:53:37,771 INFO L93 Difference]: Finished difference Result 16213 states and 24075 transitions. [2019-11-20 00:53:37,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 00:53:37,774 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 193 [2019-11-20 00:53:37,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:53:37,781 INFO L225 Difference]: With dead ends: 16213 [2019-11-20 00:53:37,781 INFO L226 Difference]: Without dead ends: 9094 [2019-11-20 00:53:37,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 380 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 00:53:37,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9094 states. [2019-11-20 00:53:38,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9094 to 7138. [2019-11-20 00:53:38,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7138 states. [2019-11-20 00:53:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7138 states to 7138 states and 10673 transitions. [2019-11-20 00:53:38,090 INFO L78 Accepts]: Start accepts. Automaton has 7138 states and 10673 transitions. Word has length 193 [2019-11-20 00:53:38,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:53:38,090 INFO L462 AbstractCegarLoop]: Abstraction has 7138 states and 10673 transitions. [2019-11-20 00:53:38,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 00:53:38,091 INFO L276 IsEmpty]: Start isEmpty. Operand 7138 states and 10673 transitions. [2019-11-20 00:53:38,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-20 00:53:38,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:53:38,097 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 00:53:38,310 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:53:38,311 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:53:38,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:53:38,311 INFO L82 PathProgramCache]: Analyzing trace with hash 990290520, now seen corresponding path program 1 times [2019-11-20 00:53:38,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 00:53:38,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1795671877] [2019-11-20 00:53:38,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:53:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:53:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:53:44,944 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-20 00:53:44,944 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 00:53:45,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 00:53:45,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:53:45 BoogieIcfgContainer [2019-11-20 00:53:45,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 00:53:45,379 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:53:45,379 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:53:45,379 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:53:45,380 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:44:07" (3/4) ... [2019-11-20 00:53:45,383 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 00:53:45,556 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_faae8d45-3f39-4719-8c25-587366c272db/bin/uautomizer/witness.graphml [2019-11-20 00:53:45,556 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:53:45,557 INFO L168 Benchmark]: Toolchain (without parser) took 583232.01 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 513.3 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -98.3 MB). Peak memory consumption was 415.0 MB. Max. memory is 11.5 GB. [2019-11-20 00:53:45,558 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:53:45,558 INFO L168 Benchmark]: CACSL2BoogieTranslator took 822.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2019-11-20 00:53:45,559 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-20 00:53:45,559 INFO L168 Benchmark]: Boogie Preprocessor took 85.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-20 00:53:45,560 INFO L168 Benchmark]: RCFGBuilder took 4468.29 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 00:53:45,560 INFO L168 Benchmark]: TraceAbstraction took 577565.44 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 359.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -63.1 MB). Peak memory consumption was 296.0 MB. Max. memory is 11.5 GB. [2019-11-20 00:53:45,561 INFO L168 Benchmark]: Witness Printer took 177.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2019-11-20 00:53:45,569 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 822.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 108.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4468.29 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 577565.44 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 359.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -63.1 MB). Peak memory consumption was 296.0 MB. Max. memory is 11.5 GB. * Witness Printer took 177.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1727]: 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={1376879679: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={1376879679: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={1376879679:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={1376879679:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1376879679:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679: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={1376879679: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={1376879679:0}] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={1376879679:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={1376879679:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1376879679:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679: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={1376879679:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={1376879679:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={1376879679:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={1376879679:0}] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={1376879679:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={1376879679:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1376879679:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1229] COND TRUE s->state == 8656 [L1579] EXPR s->session [L1579] EXPR s->s3 [L1579] EXPR (s->s3)->tmp.new_cipher [L1579] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1580] COND FALSE !(! tmp___9) [L1586] ret = __VERIFIER_nondet_int() [L1587] COND TRUE blastFlag == 2 [L1588] blastFlag = 3 VAL [init=1, SSLv3_server_data={1376879679:0}] [L1592] COND FALSE !(ret <= 0) [L1597] s->state = 8672 [L1598] s->init_num = 0 VAL [init=1, SSLv3_server_data={1376879679:0}] [L1599] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={1376879679:0}] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={1376879679:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={1376879679:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1376879679:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1235] COND TRUE s->state == 8672 [L1608] ret = __VERIFIER_nondet_int() [L1609] COND TRUE blastFlag == 3 [L1610] blastFlag = 4 VAL [init=1, SSLv3_server_data={1376879679:0}] [L1614] COND FALSE !(ret <= 0) [L1619] s->state = 8448 [L1620] s->hit VAL [init=1, SSLv3_server_data={1376879679:0}] [L1620] COND TRUE s->hit [L1621] EXPR s->s3 [L1621] (s->s3)->tmp.next_state = 8640 [L1625] s->init_num = 0 VAL [init=1, SSLv3_server_data={1376879679:0}] [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={1376879679:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={1376879679:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1376879679:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={1376879679:0}] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1686] EXPR s->s3 [L1686] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={1376879679:0}] [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={1376879679:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1376879679:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={1376879679:0}] [L1223] COND TRUE s->state == 8640 [L1559] ret = __VERIFIER_nondet_int() [L1560] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={1376879679:0}] [L1727] __VERIFIER_error() VAL [init=1, SSLv3_server_data={1376879679:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 577.4s, OverallIterations: 23, TraceHistogramMax: 7, AutomataDifference: 321.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4224 SDtfs, 5835 SDslu, 9878 SDs, 0 SdLazy, 9343 SolverSat, 1427 SolverUnsat, 90 SolverUnknown, 0 SolverNotchecked, 304.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7130 GetRequests, 6979 SyntacticMatches, 13 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7138occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 22 MinimizatonAttempts, 30937 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.3s SsaConstructionTime, 29.5s SatisfiabilityAnalysisTime, 210.6s InterpolantComputationTime, 3761 NumberOfCodeBlocks, 3761 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 7092 ConstructedInterpolants, 285 QuantifiedInterpolants, 6900257 SizeOfPredicates, 132 NumberOfNonLiveVariables, 8427 ConjunctsInSsa, 162 ConjunctsInUnsatCore, 44 InterpolantComputations, 34 PerfectInterpolantSequences, 9568/9932 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...