./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.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_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 1e9943d2199c95030d170f0541cc4df722deb62f ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 1e9943d2199c95030d170f0541cc4df722deb62f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 10:57:29,848 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:57:29,850 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:57:29,865 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:57:29,866 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:57:29,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:57:29,869 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:57:29,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:57:29,883 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:57:29,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:57:29,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:57:29,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:57:29,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:57:29,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:57:29,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:57:29,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:57:29,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:57:29,898 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:57:29,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:57:29,905 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:57:29,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:57:29,912 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:57:29,915 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:57:29,916 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:57:29,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:57:29,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:57:29,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:57:29,922 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:57:29,922 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:57:29,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:57:29,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:57:29,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:57:29,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:57:29,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:57:29,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:57:29,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:57:29,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:57:29,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:57:29,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:57:29,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:57:29,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:57:29,931 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 10:57:29,959 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:57:29,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:57:29,962 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:57:29,962 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:57:29,962 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:57:29,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:57:29,963 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:57:29,963 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 10:57:29,963 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:57:29,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:57:29,965 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:57:29,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:57:29,965 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:57:29,965 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:57:29,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:57:29,966 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:57:29,966 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:57:29,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:57:29,967 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:57:29,967 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:57:29,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 10:57:29,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:57:29,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:57:29,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:57:29,968 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:57:29,968 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 10:57:29,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 10:57:29,969 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:57:29,969 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_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 -> 1e9943d2199c95030d170f0541cc4df722deb62f [2019-11-20 10:57:30,149 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:57:30,164 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:57:30,167 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:57:30,169 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:57:30,169 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:57:30,170 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2019-11-20 10:57:30,235 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/bin/uautomizer/data/587ffe197/fedd3ef8ea82421e90ae53f3fa06bf6a/FLAG77673e9f4 [2019-11-20 10:57:30,708 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:57:30,709 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2019-11-20 10:57:30,721 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/bin/uautomizer/data/587ffe197/fedd3ef8ea82421e90ae53f3fa06bf6a/FLAG77673e9f4 [2019-11-20 10:57:31,107 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/bin/uautomizer/data/587ffe197/fedd3ef8ea82421e90ae53f3fa06bf6a [2019-11-20 10:57:31,109 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:57:31,110 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:57:31,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:57:31,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:57:31,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:57:31,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:57:31" (1/1) ... [2019-11-20 10:57:31,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c38c408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:31, skipping insertion in model container [2019-11-20 10:57:31,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:57:31" (1/1) ... [2019-11-20 10:57:31,126 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:57:31,168 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:57:31,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:57:31,567 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:57:31,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:57:31,654 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:57:31,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:31 WrapperNode [2019-11-20 10:57:31,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:57:31,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:57:31,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:57:31,657 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:57:31,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:31" (1/1) ... [2019-11-20 10:57:31,676 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:31" (1/1) ... [2019-11-20 10:57:31,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:57:31,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:57:31,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:57:31,734 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:57:31,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:31" (1/1) ... [2019-11-20 10:57:31,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:31" (1/1) ... [2019-11-20 10:57:31,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:31" (1/1) ... [2019-11-20 10:57:31,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:31" (1/1) ... [2019-11-20 10:57:31,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:31" (1/1) ... [2019-11-20 10:57:31,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:31" (1/1) ... [2019-11-20 10:57:31,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:31" (1/1) ... [2019-11-20 10:57:31,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:57:31,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:57:31,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:57:31,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:57:31,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:31,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:57:31,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:57:32,082 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 10:57:32,649 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-20 10:57:32,653 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-20 10:57:32,658 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:57:32,658 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 10:57:32,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:57:32 BoogieIcfgContainer [2019-11-20 10:57:32,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:57:32,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 10:57:32,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 10:57:32,663 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 10:57:32,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:57:31" (1/3) ... [2019-11-20 10:57:32,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d799da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:57:32, skipping insertion in model container [2019-11-20 10:57:32,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:31" (2/3) ... [2019-11-20 10:57:32,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d799da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:57:32, skipping insertion in model container [2019-11-20 10:57:32,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:57:32" (3/3) ... [2019-11-20 10:57:32,667 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-1a.c [2019-11-20 10:57:32,676 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 10:57:32,683 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 10:57:32,694 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 10:57:32,715 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 10:57:32,715 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 10:57:32,716 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 10:57:32,716 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:57:32,716 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:57:32,716 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 10:57:32,716 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:57:32,716 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 10:57:32,735 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-11-20 10:57:32,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 10:57:32,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:32,742 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] [2019-11-20 10:57:32,742 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:32,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:32,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-11-20 10:57:32,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:57:32,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798261599] [2019-11-20 10:57:32,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:57:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:32,928 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 10:57:32,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798261599] [2019-11-20 10:57:32,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:32,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 10:57:32,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137648595] [2019-11-20 10:57:32,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:57:32,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:57:32,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:57:32,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:57:32,954 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2019-11-20 10:57:33,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:33,201 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2019-11-20 10:57:33,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:57:33,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-20 10:57:33,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:33,216 INFO L225 Difference]: With dead ends: 245 [2019-11-20 10:57:33,217 INFO L226 Difference]: Without dead ends: 111 [2019-11-20 10:57:33,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 10:57:33,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-20 10:57:33,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-20 10:57:33,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-20 10:57:33,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-11-20 10:57:33,269 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-11-20 10:57:33,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:33,269 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-11-20 10:57:33,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:57:33,270 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-11-20 10:57:33,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 10:57:33,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:33,273 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] [2019-11-20 10:57:33,273 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:33,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:33,273 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-11-20 10:57:33,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:57:33,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943253338] [2019-11-20 10:57:33,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:57:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:33,371 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 10:57:33,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943253338] [2019-11-20 10:57:33,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:33,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:57:33,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222529009] [2019-11-20 10:57:33,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:57:33,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:57:33,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:57:33,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:57:33,375 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-11-20 10:57:33,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:33,557 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-11-20 10:57:33,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:57:33,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-20 10:57:33,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:33,560 INFO L225 Difference]: With dead ends: 232 [2019-11-20 10:57:33,560 INFO L226 Difference]: Without dead ends: 130 [2019-11-20 10:57:33,562 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 10:57:33,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-20 10:57:33,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-11-20 10:57:33,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-20 10:57:33,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-11-20 10:57:33,575 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-11-20 10:57:33,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:33,575 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-11-20 10:57:33,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:57:33,576 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-11-20 10:57:33,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 10:57:33,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:33,578 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 10:57:33,578 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:33,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:33,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2019-11-20 10:57:33,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:57:33,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135649215] [2019-11-20 10:57:33,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:57:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:33,659 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 10:57:33,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135649215] [2019-11-20 10:57:33,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:33,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:57:33,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375322789] [2019-11-20 10:57:33,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:57:33,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:57:33,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:57:33,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:57:33,662 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-11-20 10:57:33,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:33,856 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2019-11-20 10:57:33,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:57:33,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-20 10:57:33,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:33,861 INFO L225 Difference]: With dead ends: 264 [2019-11-20 10:57:33,861 INFO L226 Difference]: Without dead ends: 147 [2019-11-20 10:57:33,862 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 10:57:33,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-20 10:57:33,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-11-20 10:57:33,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-20 10:57:33,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-11-20 10:57:33,883 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-11-20 10:57:33,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:33,892 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-11-20 10:57:33,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:57:33,892 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-11-20 10:57:33,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 10:57:33,895 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:33,895 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 10:57:33,895 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:33,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:33,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2019-11-20 10:57:33,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:57:33,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502907708] [2019-11-20 10:57:33,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:57:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:34,023 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 10:57:34,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502907708] [2019-11-20 10:57:34,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:34,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:57:34,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895991973] [2019-11-20 10:57:34,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:57:34,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:57:34,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:57:34,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:57:34,030 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-11-20 10:57:34,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:34,059 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-11-20 10:57:34,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:57:34,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-20 10:57:34,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:34,063 INFO L225 Difference]: With dead ends: 298 [2019-11-20 10:57:34,063 INFO L226 Difference]: Without dead ends: 164 [2019-11-20 10:57:34,064 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 10:57:34,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-20 10:57:34,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-11-20 10:57:34,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-20 10:57:34,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2019-11-20 10:57:34,092 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2019-11-20 10:57:34,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:34,094 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2019-11-20 10:57:34,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:57:34,095 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2019-11-20 10:57:34,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 10:57:34,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:34,105 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 10:57:34,106 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:34,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:34,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2019-11-20 10:57:34,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:57:34,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922985978] [2019-11-20 10:57:34,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:57:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:34,217 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 10:57:34,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922985978] [2019-11-20 10:57:34,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:34,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:57:34,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741565799] [2019-11-20 10:57:34,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:57:34,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:57:34,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:57:34,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:57:34,220 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 3 states. [2019-11-20 10:57:34,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:34,444 INFO L93 Difference]: Finished difference Result 369 states and 549 transitions. [2019-11-20 10:57:34,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:57:34,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-20 10:57:34,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:34,447 INFO L225 Difference]: With dead ends: 369 [2019-11-20 10:57:34,447 INFO L226 Difference]: Without dead ends: 213 [2019-11-20 10:57:34,448 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 10:57:34,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-11-20 10:57:34,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2019-11-20 10:57:34,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-20 10:57:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 287 transitions. [2019-11-20 10:57:34,461 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 287 transitions. Word has length 66 [2019-11-20 10:57:34,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:34,462 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 287 transitions. [2019-11-20 10:57:34,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:57:34,462 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 287 transitions. [2019-11-20 10:57:34,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 10:57:34,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:34,464 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 10:57:34,464 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:34,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:34,464 INFO L82 PathProgramCache]: Analyzing trace with hash 507084268, now seen corresponding path program 1 times [2019-11-20 10:57:34,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:57:34,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989636666] [2019-11-20 10:57:34,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:57:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:34,528 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 10:57:34,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989636666] [2019-11-20 10:57:34,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:34,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:57:34,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470406885] [2019-11-20 10:57:34,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:57:34,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:57:34,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:57:34,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:57:34,531 INFO L87 Difference]: Start difference. First operand 205 states and 287 transitions. Second operand 3 states. [2019-11-20 10:57:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:34,708 INFO L93 Difference]: Finished difference Result 424 states and 601 transitions. [2019-11-20 10:57:34,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:57:34,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-20 10:57:34,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:34,711 INFO L225 Difference]: With dead ends: 424 [2019-11-20 10:57:34,711 INFO L226 Difference]: Without dead ends: 228 [2019-11-20 10:57:34,712 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 10:57:34,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-11-20 10:57:34,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2019-11-20 10:57:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-20 10:57:34,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 311 transitions. [2019-11-20 10:57:34,749 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 311 transitions. Word has length 66 [2019-11-20 10:57:34,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:34,750 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 311 transitions. [2019-11-20 10:57:34,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:57:34,750 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 311 transitions. [2019-11-20 10:57:34,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-20 10:57:34,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:34,751 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 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] [2019-11-20 10:57:34,752 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:34,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:34,752 INFO L82 PathProgramCache]: Analyzing trace with hash -374488382, now seen corresponding path program 1 times [2019-11-20 10:57:34,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:57:34,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338197304] [2019-11-20 10:57:34,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:57:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:34,844 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-20 10:57:34,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338197304] [2019-11-20 10:57:34,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:34,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:57:34,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535586109] [2019-11-20 10:57:34,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:57:34,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:57:34,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:57:34,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:57:34,846 INFO L87 Difference]: Start difference. First operand 224 states and 311 transitions. Second operand 3 states. [2019-11-20 10:57:35,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:35,012 INFO L93 Difference]: Finished difference Result 463 states and 651 transitions. [2019-11-20 10:57:35,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:57:35,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-20 10:57:35,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:35,014 INFO L225 Difference]: With dead ends: 463 [2019-11-20 10:57:35,014 INFO L226 Difference]: Without dead ends: 248 [2019-11-20 10:57:35,015 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 10:57:35,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-20 10:57:35,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 245. [2019-11-20 10:57:35,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-20 10:57:35,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 337 transitions. [2019-11-20 10:57:35,024 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 337 transitions. Word has length 82 [2019-11-20 10:57:35,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:35,024 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 337 transitions. [2019-11-20 10:57:35,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:57:35,025 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 337 transitions. [2019-11-20 10:57:35,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 10:57:35,026 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:35,026 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 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] [2019-11-20 10:57:35,026 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:35,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:35,027 INFO L82 PathProgramCache]: Analyzing trace with hash -272398982, now seen corresponding path program 1 times [2019-11-20 10:57:35,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:57:35,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364754480] [2019-11-20 10:57:35,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:57:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:35,085 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-20 10:57:35,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364754480] [2019-11-20 10:57:35,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:35,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:57:35,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882887879] [2019-11-20 10:57:35,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:57:35,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:57:35,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:57:35,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:57:35,087 INFO L87 Difference]: Start difference. First operand 245 states and 337 transitions. Second operand 3 states. [2019-11-20 10:57:35,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:35,136 INFO L93 Difference]: Finished difference Result 694 states and 957 transitions. [2019-11-20 10:57:35,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:57:35,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-20 10:57:35,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:35,142 INFO L225 Difference]: With dead ends: 694 [2019-11-20 10:57:35,142 INFO L226 Difference]: Without dead ends: 458 [2019-11-20 10:57:35,142 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 10:57:35,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-11-20 10:57:35,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2019-11-20 10:57:35,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-11-20 10:57:35,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 630 transitions. [2019-11-20 10:57:35,162 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 630 transitions. Word has length 102 [2019-11-20 10:57:35,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:35,163 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 630 transitions. [2019-11-20 10:57:35,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:57:35,163 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 630 transitions. [2019-11-20 10:57:35,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-20 10:57:35,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:35,166 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 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] [2019-11-20 10:57:35,166 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:35,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:35,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1688750428, now seen corresponding path program 1 times [2019-11-20 10:57:35,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:57:35,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297953524] [2019-11-20 10:57:35,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:57:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:35,229 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-20 10:57:35,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297953524] [2019-11-20 10:57:35,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:35,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:57:35,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92999480] [2019-11-20 10:57:35,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:57:35,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:57:35,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:57:35,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:57:35,231 INFO L87 Difference]: Start difference. First operand 458 states and 630 transitions. Second operand 3 states. [2019-11-20 10:57:35,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:35,275 INFO L93 Difference]: Finished difference Result 673 states and 927 transitions. [2019-11-20 10:57:35,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:57:35,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-20 10:57:35,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:35,280 INFO L225 Difference]: With dead ends: 673 [2019-11-20 10:57:35,280 INFO L226 Difference]: Without dead ends: 671 [2019-11-20 10:57:35,281 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 10:57:35,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-11-20 10:57:35,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2019-11-20 10:57:35,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-11-20 10:57:35,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 925 transitions. [2019-11-20 10:57:35,299 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 925 transitions. Word has length 104 [2019-11-20 10:57:35,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:35,300 INFO L462 AbstractCegarLoop]: Abstraction has 671 states and 925 transitions. [2019-11-20 10:57:35,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:57:35,300 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 925 transitions. [2019-11-20 10:57:35,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-20 10:57:35,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:35,303 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 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] [2019-11-20 10:57:35,303 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:35,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:35,304 INFO L82 PathProgramCache]: Analyzing trace with hash 439361019, now seen corresponding path program 1 times [2019-11-20 10:57:35,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:57:35,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401951558] [2019-11-20 10:57:35,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:57:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:35,365 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-20 10:57:35,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401951558] [2019-11-20 10:57:35,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:35,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:57:35,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782375264] [2019-11-20 10:57:35,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:57:35,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:57:35,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:57:35,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:57:35,367 INFO L87 Difference]: Start difference. First operand 671 states and 925 transitions. Second operand 3 states. [2019-11-20 10:57:35,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:35,559 INFO L93 Difference]: Finished difference Result 1483 states and 2101 transitions. [2019-11-20 10:57:35,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:57:35,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-20 10:57:35,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:35,565 INFO L225 Difference]: With dead ends: 1483 [2019-11-20 10:57:35,565 INFO L226 Difference]: Without dead ends: 818 [2019-11-20 10:57:35,566 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 10:57:35,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-11-20 10:57:35,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 788. [2019-11-20 10:57:35,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-11-20 10:57:35,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1114 transitions. [2019-11-20 10:57:35,592 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1114 transitions. Word has length 172 [2019-11-20 10:57:35,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:35,592 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1114 transitions. [2019-11-20 10:57:35,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:57:35,592 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1114 transitions. [2019-11-20 10:57:35,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-20 10:57:35,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:35,596 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:57:35,596 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:35,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:35,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1597857147, now seen corresponding path program 2 times [2019-11-20 10:57:35,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:57:35,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117587106] [2019-11-20 10:57:35,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:57:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:35,664 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-20 10:57:35,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117587106] [2019-11-20 10:57:35,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:35,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:57:35,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130861274] [2019-11-20 10:57:35,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:57:35,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:57:35,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:57:35,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:57:35,667 INFO L87 Difference]: Start difference. First operand 788 states and 1114 transitions. Second operand 3 states. [2019-11-20 10:57:35,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:35,879 INFO L93 Difference]: Finished difference Result 1845 states and 2682 transitions. [2019-11-20 10:57:35,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:57:35,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-20 10:57:35,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:35,886 INFO L225 Difference]: With dead ends: 1845 [2019-11-20 10:57:35,886 INFO L226 Difference]: Without dead ends: 1015 [2019-11-20 10:57:35,888 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 10:57:35,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-11-20 10:57:35,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 977. [2019-11-20 10:57:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-11-20 10:57:35,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1366 transitions. [2019-11-20 10:57:35,916 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1366 transitions. Word has length 184 [2019-11-20 10:57:35,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:35,917 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1366 transitions. [2019-11-20 10:57:35,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:57:35,917 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1366 transitions. [2019-11-20 10:57:35,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-20 10:57:35,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:35,921 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:57:35,921 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:35,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:35,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1444142562, now seen corresponding path program 1 times [2019-11-20 10:57:35,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:57:35,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941717711] [2019-11-20 10:57:35,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:57:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:36,056 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-11-20 10:57:36,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941717711] [2019-11-20 10:57:36,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:36,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:57:36,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101051759] [2019-11-20 10:57:36,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:57:36,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:57:36,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:57:36,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:57:36,058 INFO L87 Difference]: Start difference. First operand 977 states and 1366 transitions. Second operand 3 states. [2019-11-20 10:57:36,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:36,094 INFO L93 Difference]: Finished difference Result 2279 states and 3183 transitions. [2019-11-20 10:57:36,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:57:36,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-11-20 10:57:36,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:36,102 INFO L225 Difference]: With dead ends: 2279 [2019-11-20 10:57:36,102 INFO L226 Difference]: Without dead ends: 1311 [2019-11-20 10:57:36,104 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 10:57:36,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2019-11-20 10:57:36,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1311. [2019-11-20 10:57:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1311 states. [2019-11-20 10:57:36,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 1827 transitions. [2019-11-20 10:57:36,141 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 1827 transitions. Word has length 193 [2019-11-20 10:57:36,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:36,142 INFO L462 AbstractCegarLoop]: Abstraction has 1311 states and 1827 transitions. [2019-11-20 10:57:36,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:57:36,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 1827 transitions. [2019-11-20 10:57:36,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-20 10:57:36,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:36,147 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:57:36,147 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:36,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:36,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1661550404, now seen corresponding path program 1 times [2019-11-20 10:57:36,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:57:36,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488256041] [2019-11-20 10:57:36,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:57:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:36,239 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-20 10:57:36,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488256041] [2019-11-20 10:57:36,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:36,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:57:36,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628638879] [2019-11-20 10:57:36,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:57:36,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:57:36,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:57:36,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:57:36,242 INFO L87 Difference]: Start difference. First operand 1311 states and 1827 transitions. Second operand 3 states. [2019-11-20 10:57:36,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:36,317 INFO L93 Difference]: Finished difference Result 3667 states and 5151 transitions. [2019-11-20 10:57:36,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:57:36,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-11-20 10:57:36,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:36,332 INFO L225 Difference]: With dead ends: 3667 [2019-11-20 10:57:36,333 INFO L226 Difference]: Without dead ends: 2365 [2019-11-20 10:57:36,335 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 10:57:36,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2019-11-20 10:57:36,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2363. [2019-11-20 10:57:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2363 states. [2019-11-20 10:57:36,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3324 transitions. [2019-11-20 10:57:36,407 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3324 transitions. Word has length 195 [2019-11-20 10:57:36,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:36,408 INFO L462 AbstractCegarLoop]: Abstraction has 2363 states and 3324 transitions. [2019-11-20 10:57:36,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:57:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3324 transitions. [2019-11-20 10:57:36,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-20 10:57:36,414 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:36,415 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:57:36,415 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:36,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:36,415 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2019-11-20 10:57:36,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:57:36,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898730797] [2019-11-20 10:57:36,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:57:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:57:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:57:36,645 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:57:36,645 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 10:57:36,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:57:36 BoogieIcfgContainer [2019-11-20 10:57:36,765 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 10:57:36,765 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 10:57:36,766 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 10:57:36,766 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 10:57:36,766 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:57:32" (3/4) ... [2019-11-20 10:57:36,770 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 10:57:36,770 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 10:57:36,772 INFO L168 Benchmark]: Toolchain (without parser) took 5660.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.3 MB). Free memory was 950.1 MB in the beginning and 941.3 MB in the end (delta: 8.8 MB). Peak memory consumption was 210.1 MB. Max. memory is 11.5 GB. [2019-11-20 10:57:36,773 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:57:36,773 INFO L168 Benchmark]: CACSL2BoogieTranslator took 544.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -194.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-20 10:57:36,774 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.94 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-20 10:57:36,774 INFO L168 Benchmark]: Boogie Preprocessor took 56.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:57:36,778 INFO L168 Benchmark]: RCFGBuilder took 869.30 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: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2019-11-20 10:57:36,778 INFO L168 Benchmark]: TraceAbstraction took 4104.72 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.7 MB). Free memory was 1.1 GB in the beginning and 941.3 MB in the end (delta: 146.8 MB). Peak memory consumption was 193.5 MB. Max. memory is 11.5 GB. [2019-11-20 10:57:36,781 INFO L168 Benchmark]: Witness Printer took 4.74 ms. Allocated memory is still 1.2 GB. Free memory is still 941.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:57:36,785 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 544.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -194.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.94 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 869.30 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: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4104.72 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.7 MB). Free memory was 1.1 GB in the beginning and 941.3 MB in the end (delta: 146.8 MB). Peak memory consumption was 193.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.74 ms. Allocated memory is still 1.2 GB. Free memory is still 941.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 608]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseXor at line 356. Possible FailurePath: [L617] int __retres1 ; [L9] int s__info_callback = __VERIFIER_nondet_int(); [L10] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L11] int s__state ; [L12] int s__new_session ; [L13] int s__server ; [L14] unsigned int s__version = __VERIFIER_nondet_uint(); [L15] int s__type ; [L16] int s__init_num ; [L17] int s__bbio = __VERIFIER_nondet_int(); [L18] int s__wbio = __VERIFIER_nondet_int(); [L19] int s__hit = __VERIFIER_nondet_int(); [L20] int s__rwstate ; [L21] int s__init_buf___0 ; [L22] int s__debug = __VERIFIER_nondet_int(); [L23] int s__shutdown ; [L24] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L25] unsigned int s__ctx__stats__sess_connect_renegotiate = __VERIFIER_nondet_uint(); [L26] unsigned int s__ctx__stats__sess_connect ; [L27] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L28] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L29] int s__s3__change_cipher_spec ; [L30] int s__s3__flags ; [L31] int s__s3__delay_buf_pop_ret ; [L32] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L33] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L34] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L35] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L36] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L37] int s__s3__tmp__next_state___0 ; [L38] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L39] int s__session__cipher ; [L40] int s__session__compress_meth ; [L41] int buf ; [L42] unsigned long tmp ; [L43] unsigned long l ; [L44] int num1 ; [L45] int cb ; [L46] int ret ; [L47] int new_state ; [L48] int state ; [L49] int skip ; [L50] int tmp___0 ; [L51] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L52] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L53] int tmp___3 = __VERIFIER_nondet_int(); [L54] int tmp___4 = __VERIFIER_nondet_int(); [L55] int tmp___5 = __VERIFIER_nondet_int(); [L56] int tmp___6 = __VERIFIER_nondet_int(); [L57] int tmp___7 = __VERIFIER_nondet_int(); [L58] int tmp___8 = __VERIFIER_nondet_int(); [L59] int tmp___9 = __VERIFIER_nondet_int(); [L60] int blastFlag ; [L61] int ag_X ; [L62] int ag_Y ; [L63] int __retres59 ; [L66] s__state = 12292 [L67] blastFlag = 0 [L68] tmp = __VERIFIER_nondet_int() [L69] cb = 0 [L70] ret = -1 [L71] skip = 0 [L72] tmp___0 = 0 [L73] COND TRUE s__info_callback != 0 [L74] cb = s__info_callback [L82] s__in_handshake = s__in_handshake + 1 [L83] COND FALSE !(tmp___1 - 12288) [L93] COND TRUE 1 [L95] state = s__state [L96] COND TRUE s__state == 12292 [L199] s__new_session = 1 [L200] s__state = 4096 [L201] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 [L206] s__server = 0 [L207] COND TRUE cb != 0 [L212] COND FALSE !(s__version - 65280 != 768) [L218] s__type = 4096 [L219] COND FALSE !(s__init_buf___0 == 0) [L237] COND FALSE !(! tmp___4) [L243] COND FALSE !(! tmp___5) [L249] s__state = 4368 [L250] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L251] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND TRUE blastFlag == 0 [L258] blastFlag = 1 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND TRUE blastFlag == 1 [L283] blastFlag = 2 [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND TRUE blastFlag == 2 [L306] blastFlag = 3 [L310] COND FALSE !(ret <= 0) [L316] ag_Y = 61087 [L317] s__state = 4416 [L318] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L322] ret = __VERIFIER_nondet_int() [L323] COND TRUE blastFlag == 3 [L324] blastFlag = 4 [L328] COND FALSE !(ret <= 0) [L333] s__state = 4432 [L334] ag_X = (unsigned short)65535 [L335] s__init_num = 0 [L336] COND FALSE !(! tmp___6) [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L345] ret = __VERIFIER_nondet_int() [L346] COND FALSE !(blastFlag == 5) [L351] COND FALSE !(ret <= 0) [L356] s__state = ag_X ^ ag_Y [L357] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND TRUE s__state == 4368 [L255] s__shutdown = 0 [L256] ret = __VERIFIER_nondet_int() [L257] COND FALSE !(blastFlag == 0) [L260] COND TRUE blastFlag == 4 [L261] blastFlag = 5 [L266] COND FALSE !(ret <= 0) [L271] s__state = 4384 [L272] s__init_num = 0 [L273] COND TRUE s__bbio != s__wbio [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND TRUE s__state == 4384 [L281] ret = __VERIFIER_nondet_int() [L282] COND FALSE !(blastFlag == 1) [L287] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 4400 [L297] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND TRUE s__state == 4400 [L301] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L304] ret = __VERIFIER_nondet_int() [L305] COND FALSE !(blastFlag == 2) [L310] COND FALSE !(ret <= 0) [L316] ag_Y = 61087 [L317] s__state = 4416 [L318] s__init_num = 0 [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND TRUE s__state == 4416 [L322] ret = __VERIFIER_nondet_int() [L323] COND FALSE !(blastFlag == 3) [L328] COND FALSE !(ret <= 0) [L333] s__state = 4432 [L334] ag_X = (unsigned short)65535 [L335] s__init_num = 0 [L336] COND FALSE !(! tmp___6) [L566] COND FALSE !(! s__s3__tmp__reuse_message) [L595] skip = 0 [L93] COND TRUE 1 [L95] state = s__state [L96] COND FALSE !(s__state == 12292) [L99] COND FALSE !(s__state == 16384) [L102] COND FALSE !(s__state == 4096) [L105] COND FALSE !(s__state == 20480) [L108] COND FALSE !(s__state == 4099) [L111] COND FALSE !(s__state == 4368) [L114] COND FALSE !(s__state == 4369) [L117] COND FALSE !(s__state == 4384) [L120] COND FALSE !(s__state == 4385) [L123] COND FALSE !(s__state == 4400) [L126] COND FALSE !(s__state == 4401) [L129] COND FALSE !(s__state == 4416) [L132] COND FALSE !(s__state == 4417) [L135] COND TRUE s__state == 4432 [L345] ret = __VERIFIER_nondet_int() [L346] COND TRUE blastFlag == 5 [L608] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. Result: UNSAFE, OverallTime: 4.0s, OverallIterations: 14, TraceHistogramMax: 11, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2411 SDtfs, 803 SDslu, 1336 SDs, 0 SdLazy, 884 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2363occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 93 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1532 NumberOfCodeBlocks, 1532 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1324 ConstructedInterpolants, 0 QuantifiedInterpolants, 420496 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2562/2562 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 10:57:38,715 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:57:38,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:57:38,728 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:57:38,728 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:57:38,729 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:57:38,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:57:38,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:57:38,735 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:57:38,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:57:38,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:57:38,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:57:38,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:57:38,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:57:38,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:57:38,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:57:38,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:57:38,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:57:38,746 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:57:38,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:57:38,750 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:57:38,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:57:38,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:57:38,759 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:57:38,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:57:38,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:57:38,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:57:38,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:57:38,767 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:57:38,768 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:57:38,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:57:38,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:57:38,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:57:38,774 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:57:38,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:57:38,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:57:38,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:57:38,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:57:38,776 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:57:38,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:57:38,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:57:38,779 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 10:57:38,793 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:57:38,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:57:38,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:57:38,794 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:57:38,794 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:57:38,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:57:38,795 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:57:38,795 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:57:38,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:57:38,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:57:38,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:57:38,796 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:57:38,796 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 10:57:38,796 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 10:57:38,797 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:57:38,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:57:38,797 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:57:38,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:57:38,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:57:38,798 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:57:38,798 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:57:38,798 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 10:57:38,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:57:38,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:57:38,799 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:57:38,799 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:57:38,799 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 10:57:38,799 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 10:57:38,800 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:57:38,800 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 10:57:38,800 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_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 -> 1e9943d2199c95030d170f0541cc4df722deb62f [2019-11-20 10:57:39,081 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:57:39,092 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:57:39,095 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:57:39,097 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:57:39,097 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:57:39,098 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/bin/uautomizer/../../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2019-11-20 10:57:39,153 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/bin/uautomizer/data/b8eef533b/fa0018c0e9424eab9ef50b7163fff0d6/FLAG30143105e [2019-11-20 10:57:39,580 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:57:39,581 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2019-11-20 10:57:39,593 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/bin/uautomizer/data/b8eef533b/fa0018c0e9424eab9ef50b7163fff0d6/FLAG30143105e [2019-11-20 10:57:39,900 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/bin/uautomizer/data/b8eef533b/fa0018c0e9424eab9ef50b7163fff0d6 [2019-11-20 10:57:39,903 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:57:39,904 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:57:39,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:57:39,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:57:39,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:57:39,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:57:39" (1/1) ... [2019-11-20 10:57:39,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ea8e81d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:39, skipping insertion in model container [2019-11-20 10:57:39,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:57:39" (1/1) ... [2019-11-20 10:57:39,921 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:57:39,984 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:57:40,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:57:40,282 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:57:40,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:57:40,456 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:57:40,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:40 WrapperNode [2019-11-20 10:57:40,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:57:40,458 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:57:40,458 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:57:40,458 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:57:40,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:40" (1/1) ... [2019-11-20 10:57:40,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:40" (1/1) ... [2019-11-20 10:57:40,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:57:40,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:57:40,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:57:40,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:57:40,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:40" (1/1) ... [2019-11-20 10:57:40,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:40" (1/1) ... [2019-11-20 10:57:40,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:40" (1/1) ... [2019-11-20 10:57:40,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:40" (1/1) ... [2019-11-20 10:57:40,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:40" (1/1) ... [2019-11-20 10:57:40,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:40" (1/1) ... [2019-11-20 10:57:40,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:40" (1/1) ... [2019-11-20 10:57:40,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:57:40,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:57:40,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:57:40,556 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:57:40,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:40,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:57:40,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:57:40,734 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-20 10:57:41,356 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-20 10:57:41,357 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-20 10:57:41,359 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:57:41,359 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 10:57:41,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:57:41 BoogieIcfgContainer [2019-11-20 10:57:41,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:57:41,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 10:57:41,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 10:57:41,365 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 10:57:41,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:57:39" (1/3) ... [2019-11-20 10:57:41,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5809fc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:57:41, skipping insertion in model container [2019-11-20 10:57:41,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:40" (2/3) ... [2019-11-20 10:57:41,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5809fc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:57:41, skipping insertion in model container [2019-11-20 10:57:41,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:57:41" (3/3) ... [2019-11-20 10:57:41,370 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-1a.c [2019-11-20 10:57:41,377 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 10:57:41,382 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 10:57:41,391 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 10:57:41,412 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 10:57:41,413 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 10:57:41,413 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 10:57:41,413 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:57:41,413 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:57:41,414 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 10:57:41,414 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:57:41,414 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 10:57:41,432 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-11-20 10:57:41,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 10:57:41,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:41,441 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] [2019-11-20 10:57:41,441 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:41,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:41,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-11-20 10:57:41,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:57:41,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1955837390] [2019-11-20 10:57:41,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:41,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:57:41,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:57:41,620 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 10:57:41,621 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:57:41,636 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 10:57:41,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1955837390] [2019-11-20 10:57:41,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:41,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 10:57:41,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528409361] [2019-11-20 10:57:41,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:57:41,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:57:41,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:57:41,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:57:41,665 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2019-11-20 10:57:41,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:41,934 INFO L93 Difference]: Finished difference Result 245 states and 420 transitions. [2019-11-20 10:57:41,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:57:41,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-20 10:57:41,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:41,947 INFO L225 Difference]: With dead ends: 245 [2019-11-20 10:57:41,948 INFO L226 Difference]: Without dead ends: 111 [2019-11-20 10:57:41,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 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 10:57:41,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-20 10:57:41,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-20 10:57:42,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-20 10:57:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-11-20 10:57:42,009 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-11-20 10:57:42,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:42,010 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-11-20 10:57:42,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:57:42,010 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-11-20 10:57:42,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 10:57:42,012 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:42,013 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] [2019-11-20 10:57:42,214 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:57:42,216 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:42,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:42,217 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-11-20 10:57:42,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:57:42,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1500471172] [2019-11-20 10:57:42,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:42,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:57:42,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:57:42,335 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 10:57:42,335 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:57:42,341 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 10:57:42,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1500471172] [2019-11-20 10:57:42,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:42,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 10:57:42,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010595454] [2019-11-20 10:57:42,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:57:42,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:57:42,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:57:42,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:57:42,345 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-11-20 10:57:42,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:42,569 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2019-11-20 10:57:42,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:57:42,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-20 10:57:42,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:42,572 INFO L225 Difference]: With dead ends: 232 [2019-11-20 10:57:42,572 INFO L226 Difference]: Without dead ends: 130 [2019-11-20 10:57:42,574 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 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 10:57:42,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-20 10:57:42,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-11-20 10:57:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-20 10:57:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-11-20 10:57:42,588 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-11-20 10:57:42,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:42,588 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-11-20 10:57:42,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:57:42,589 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-11-20 10:57:42,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 10:57:42,591 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:42,591 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 10:57:42,801 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:57:42,802 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:42,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:42,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1711238340, now seen corresponding path program 1 times [2019-11-20 10:57:42,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:57:42,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [648196924] [2019-11-20 10:57:42,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:42,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:57:42,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:57:42,922 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 10:57:42,922 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:57:42,931 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 10:57:42,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [648196924] [2019-11-20 10:57:42,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:42,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 10:57:42,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189444428] [2019-11-20 10:57:42,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:57:42,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:57:42,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:57:42,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:57:42,946 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-11-20 10:57:43,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:43,137 INFO L93 Difference]: Finished difference Result 264 states and 399 transitions. [2019-11-20 10:57:43,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:57:43,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-20 10:57:43,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:43,140 INFO L225 Difference]: With dead ends: 264 [2019-11-20 10:57:43,140 INFO L226 Difference]: Without dead ends: 147 [2019-11-20 10:57:43,141 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 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 10:57:43,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-20 10:57:43,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2019-11-20 10:57:43,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-20 10:57:43,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-11-20 10:57:43,153 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-11-20 10:57:43,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:43,154 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-11-20 10:57:43,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:57:43,154 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-11-20 10:57:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 10:57:43,158 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:43,158 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 10:57:43,361 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:57:43,361 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:43,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:43,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1841896084, now seen corresponding path program 1 times [2019-11-20 10:57:43,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:57:43,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [947944744] [2019-11-20 10:57:43,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:43,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:57:43,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:57:43,488 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 10:57:43,489 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:57:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-20 10:57:43,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [947944744] [2019-11-20 10:57:43,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:43,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 10:57:43,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939336759] [2019-11-20 10:57:43,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:57:43,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:57:43,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:57:43,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:57:43,503 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-11-20 10:57:43,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:43,533 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2019-11-20 10:57:43,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:57:43,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-20 10:57:43,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:43,535 INFO L225 Difference]: With dead ends: 298 [2019-11-20 10:57:43,535 INFO L226 Difference]: Without dead ends: 164 [2019-11-20 10:57:43,536 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 129 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 10:57:43,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-20 10:57:43,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-11-20 10:57:43,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-20 10:57:43,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2019-11-20 10:57:43,554 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 66 [2019-11-20 10:57:43,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:43,555 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2019-11-20 10:57:43,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:57:43,556 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2019-11-20 10:57:43,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 10:57:43,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:43,559 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 10:57:43,761 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:57:43,762 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:43,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:43,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1982444694, now seen corresponding path program 1 times [2019-11-20 10:57:43,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:57:43,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1859242848] [2019-11-20 10:57:43,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:43,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:57:43,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:57:43,895 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 10:57:43,895 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:57:43,915 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 10:57:43,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1859242848] [2019-11-20 10:57:43,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:43,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 10:57:43,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323443746] [2019-11-20 10:57:43,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:57:43,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:57:43,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:57:43,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:57:43,917 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand 4 states. [2019-11-20 10:57:43,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:43,993 INFO L93 Difference]: Finished difference Result 581 states and 851 transitions. [2019-11-20 10:57:43,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:57:43,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-20 10:57:43,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:44,000 INFO L225 Difference]: With dead ends: 581 [2019-11-20 10:57:44,000 INFO L226 Difference]: Without dead ends: 426 [2019-11-20 10:57:44,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 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 10:57:44,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-11-20 10:57:44,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2019-11-20 10:57:44,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-11-20 10:57:44,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 620 transitions. [2019-11-20 10:57:44,045 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 620 transitions. Word has length 66 [2019-11-20 10:57:44,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:44,047 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 620 transitions. [2019-11-20 10:57:44,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:57:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 620 transitions. [2019-11-20 10:57:44,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-20 10:57:44,056 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:44,056 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-20 10:57:44,267 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:57:44,267 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:44,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:44,268 INFO L82 PathProgramCache]: Analyzing trace with hash -942138300, now seen corresponding path program 1 times [2019-11-20 10:57:44,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:57:44,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [724461612] [2019-11-20 10:57:44,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:44,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:57:44,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:57:44,393 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:57:44,394 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:57:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-20 10:57:44,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [724461612] [2019-11-20 10:57:44,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:44,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 10:57:44,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591740597] [2019-11-20 10:57:44,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:57:44,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:57:44,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:57:44,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:57:44,422 INFO L87 Difference]: Start difference. First operand 426 states and 620 transitions. Second operand 3 states. [2019-11-20 10:57:44,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:44,466 INFO L93 Difference]: Finished difference Result 869 states and 1261 transitions. [2019-11-20 10:57:44,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:57:44,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-20 10:57:44,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:44,470 INFO L225 Difference]: With dead ends: 869 [2019-11-20 10:57:44,470 INFO L226 Difference]: Without dead ends: 452 [2019-11-20 10:57:44,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 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 10:57:44,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-20 10:57:44,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2019-11-20 10:57:44,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-11-20 10:57:44,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 653 transitions. [2019-11-20 10:57:44,488 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 653 transitions. Word has length 67 [2019-11-20 10:57:44,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:44,488 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 653 transitions. [2019-11-20 10:57:44,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:57:44,488 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 653 transitions. [2019-11-20 10:57:44,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 10:57:44,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:44,491 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-11-20 10:57:44,693 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:57:44,701 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:44,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:44,701 INFO L82 PathProgramCache]: Analyzing trace with hash -2029292557, now seen corresponding path program 1 times [2019-11-20 10:57:44,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:57:44,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [21869111] [2019-11-20 10:57:44,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:44,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:57:44,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:57:44,835 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-20 10:57:44,836 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:57:44,858 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-20 10:57:44,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [21869111] [2019-11-20 10:57:44,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:44,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 10:57:44,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98453256] [2019-11-20 10:57:44,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:57:44,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:57:44,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:57:44,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:57:44,861 INFO L87 Difference]: Start difference. First operand 452 states and 653 transitions. Second operand 4 states. [2019-11-20 10:57:45,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:45,162 INFO L93 Difference]: Finished difference Result 1066 states and 1615 transitions. [2019-11-20 10:57:45,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:57:45,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-20 10:57:45,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:45,168 INFO L225 Difference]: With dead ends: 1066 [2019-11-20 10:57:45,168 INFO L226 Difference]: Without dead ends: 649 [2019-11-20 10:57:45,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 228 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 10:57:45,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-20 10:57:45,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 629. [2019-11-20 10:57:45,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-11-20 10:57:45,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 887 transitions. [2019-11-20 10:57:45,202 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 887 transitions. Word has length 116 [2019-11-20 10:57:45,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:45,203 INFO L462 AbstractCegarLoop]: Abstraction has 629 states and 887 transitions. [2019-11-20 10:57:45,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:57:45,204 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 887 transitions. [2019-11-20 10:57:45,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 10:57:45,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:45,207 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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] [2019-11-20 10:57:45,409 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:57:45,409 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:45,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:45,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1450806153, now seen corresponding path program 1 times [2019-11-20 10:57:45,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:57:45,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1513108460] [2019-11-20 10:57:45,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:45,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:57:45,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:57:45,537 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-11-20 10:57:45,537 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:57:45,551 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-11-20 10:57:45,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1513108460] [2019-11-20 10:57:45,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:45,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 10:57:45,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810403705] [2019-11-20 10:57:45,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:57:45,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:57:45,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:57:45,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:57:45,553 INFO L87 Difference]: Start difference. First operand 629 states and 887 transitions. Second operand 3 states. [2019-11-20 10:57:45,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:45,719 INFO L93 Difference]: Finished difference Result 1291 states and 1846 transitions. [2019-11-20 10:57:45,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:57:45,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-20 10:57:45,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:45,724 INFO L225 Difference]: With dead ends: 1291 [2019-11-20 10:57:45,724 INFO L226 Difference]: Without dead ends: 697 [2019-11-20 10:57:45,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 229 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 10:57:45,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-11-20 10:57:45,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 686. [2019-11-20 10:57:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-11-20 10:57:45,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 959 transitions. [2019-11-20 10:57:45,748 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 959 transitions. Word has length 116 [2019-11-20 10:57:45,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:45,749 INFO L462 AbstractCegarLoop]: Abstraction has 686 states and 959 transitions. [2019-11-20 10:57:45,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:57:45,749 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 959 transitions. [2019-11-20 10:57:45,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-20 10:57:45,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:45,752 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 5, 5, 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] [2019-11-20 10:57:45,956 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:57:45,956 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:45,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:45,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1686782797, now seen corresponding path program 1 times [2019-11-20 10:57:45,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:57:45,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2005281852] [2019-11-20 10:57:45,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:46,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:57:46,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:57:46,114 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 10:57:46,114 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:57:46,141 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-20 10:57:46,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2005281852] [2019-11-20 10:57:46,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:46,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 10:57:46,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208526956] [2019-11-20 10:57:46,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:57:46,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:57:46,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:57:46,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:57:46,144 INFO L87 Difference]: Start difference. First operand 686 states and 959 transitions. Second operand 3 states. [2019-11-20 10:57:46,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:46,180 INFO L93 Difference]: Finished difference Result 1565 states and 2188 transitions. [2019-11-20 10:57:46,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:57:46,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-11-20 10:57:46,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:46,188 INFO L225 Difference]: With dead ends: 1565 [2019-11-20 10:57:46,188 INFO L226 Difference]: Without dead ends: 914 [2019-11-20 10:57:46,189 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 261 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 10:57:46,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-11-20 10:57:46,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 914. [2019-11-20 10:57:46,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-11-20 10:57:46,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1272 transitions. [2019-11-20 10:57:46,225 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1272 transitions. Word has length 132 [2019-11-20 10:57:46,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:46,226 INFO L462 AbstractCegarLoop]: Abstraction has 914 states and 1272 transitions. [2019-11-20 10:57:46,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:57:46,226 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1272 transitions. [2019-11-20 10:57:46,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-20 10:57:46,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:46,229 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 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] [2019-11-20 10:57:46,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:57:46,432 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:46,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:46,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1283173259, now seen corresponding path program 1 times [2019-11-20 10:57:46,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:57:46,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1171738453] [2019-11-20 10:57:46,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:46,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:57:46,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:57:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-11-20 10:57:46,589 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:57:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2019-11-20 10:57:46,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1171738453] [2019-11-20 10:57:46,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:46,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 10:57:46,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522008309] [2019-11-20 10:57:46,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:57:46,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:57:46,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:57:46,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:57:46,616 INFO L87 Difference]: Start difference. First operand 914 states and 1272 transitions. Second operand 3 states. [2019-11-20 10:57:46,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:46,828 INFO L93 Difference]: Finished difference Result 1847 states and 2596 transitions. [2019-11-20 10:57:46,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:57:46,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2019-11-20 10:57:46,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:46,834 INFO L225 Difference]: With dead ends: 1847 [2019-11-20 10:57:46,835 INFO L226 Difference]: Without dead ends: 989 [2019-11-20 10:57:46,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 265 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 10:57:46,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-11-20 10:57:46,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 977. [2019-11-20 10:57:46,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-11-20 10:57:46,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1350 transitions. [2019-11-20 10:57:46,872 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1350 transitions. Word has length 134 [2019-11-20 10:57:46,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:46,873 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1350 transitions. [2019-11-20 10:57:46,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:57:46,873 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1350 transitions. [2019-11-20 10:57:46,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-20 10:57:46,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:46,877 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:57:47,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:57:47,081 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:47,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:47,081 INFO L82 PathProgramCache]: Analyzing trace with hash 204159321, now seen corresponding path program 1 times [2019-11-20 10:57:47,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:57:47,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1330533650] [2019-11-20 10:57:47,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:47,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:57:47,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:57:47,248 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-20 10:57:47,248 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:57:47,280 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-11-20 10:57:47,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1330533650] [2019-11-20 10:57:47,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:47,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 10:57:47,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937913134] [2019-11-20 10:57:47,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:57:47,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:57:47,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:57:47,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:57:47,282 INFO L87 Difference]: Start difference. First operand 977 states and 1350 transitions. Second operand 3 states. [2019-11-20 10:57:47,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:47,347 INFO L93 Difference]: Finished difference Result 2432 states and 3404 transitions. [2019-11-20 10:57:47,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:57:47,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-11-20 10:57:47,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:47,358 INFO L225 Difference]: With dead ends: 2432 [2019-11-20 10:57:47,358 INFO L226 Difference]: Without dead ends: 1511 [2019-11-20 10:57:47,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 345 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 10:57:47,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2019-11-20 10:57:47,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1509. [2019-11-20 10:57:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1509 states. [2019-11-20 10:57:47,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2114 transitions. [2019-11-20 10:57:47,415 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2114 transitions. Word has length 174 [2019-11-20 10:57:47,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:47,416 INFO L462 AbstractCegarLoop]: Abstraction has 1509 states and 2114 transitions. [2019-11-20 10:57:47,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:57:47,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2114 transitions. [2019-11-20 10:57:47,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-20 10:57:47,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:47,422 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:57:47,624 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:57:47,624 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:47,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:47,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2009597655, now seen corresponding path program 1 times [2019-11-20 10:57:47,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:57:47,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1710798791] [2019-11-20 10:57:47,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:47,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:57:47,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:57:47,807 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-11-20 10:57:47,807 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:57:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-11-20 10:57:47,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1710798791] [2019-11-20 10:57:47,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:47,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 10:57:47,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180523628] [2019-11-20 10:57:47,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:57:47,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:57:47,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:57:47,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:57:47,844 INFO L87 Difference]: Start difference. First operand 1509 states and 2114 transitions. Second operand 3 states. [2019-11-20 10:57:47,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:47,898 INFO L93 Difference]: Finished difference Result 2354 states and 3283 transitions. [2019-11-20 10:57:47,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:57:47,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-11-20 10:57:47,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:47,908 INFO L225 Difference]: With dead ends: 2354 [2019-11-20 10:57:47,908 INFO L226 Difference]: Without dead ends: 1513 [2019-11-20 10:57:47,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 345 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 10:57:47,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2019-11-20 10:57:47,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1511. [2019-11-20 10:57:47,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1511 states. [2019-11-20 10:57:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2107 transitions. [2019-11-20 10:57:47,967 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2107 transitions. Word has length 174 [2019-11-20 10:57:47,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:47,967 INFO L462 AbstractCegarLoop]: Abstraction has 1511 states and 2107 transitions. [2019-11-20 10:57:47,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:57:47,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2107 transitions. [2019-11-20 10:57:47,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-11-20 10:57:47,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:47,972 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 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] [2019-11-20 10:57:48,175 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:57:48,175 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:48,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:48,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1462336803, now seen corresponding path program 1 times [2019-11-20 10:57:48,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:57:48,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [544966381] [2019-11-20 10:57:48,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:48,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:57:48,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:57:48,345 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-20 10:57:48,346 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:57:48,397 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-11-20 10:57:48,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [544966381] [2019-11-20 10:57:48,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:48,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 10:57:48,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715055209] [2019-11-20 10:57:48,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:57:48,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:57:48,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:57:48,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:57:48,400 INFO L87 Difference]: Start difference. First operand 1511 states and 2107 transitions. Second operand 4 states. [2019-11-20 10:57:48,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:48,736 INFO L93 Difference]: Finished difference Result 3056 states and 4299 transitions. [2019-11-20 10:57:48,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:57:48,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-11-20 10:57:48,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:48,746 INFO L225 Difference]: With dead ends: 3056 [2019-11-20 10:57:48,746 INFO L226 Difference]: Without dead ends: 1603 [2019-11-20 10:57:48,749 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 344 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 10:57:48,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2019-11-20 10:57:48,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1557. [2019-11-20 10:57:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2019-11-20 10:57:48,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2119 transitions. [2019-11-20 10:57:48,810 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2119 transitions. Word has length 174 [2019-11-20 10:57:48,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:48,811 INFO L462 AbstractCegarLoop]: Abstraction has 1557 states and 2119 transitions. [2019-11-20 10:57:48,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:57:48,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2119 transitions. [2019-11-20 10:57:48,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-20 10:57:48,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:48,816 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:57:49,017 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:57:49,018 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:49,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:49,018 INFO L82 PathProgramCache]: Analyzing trace with hash -403372922, now seen corresponding path program 1 times [2019-11-20 10:57:49,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:57:49,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1227062818] [2019-11-20 10:57:49,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:49,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 10:57:49,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:57:49,330 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 458 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-11-20 10:57:49,330 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:57:49,422 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 442 proven. 36 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-11-20 10:57:49,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1227062818] [2019-11-20 10:57:49,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:57:49,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-20 10:57:49,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815122401] [2019-11-20 10:57:49,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 10:57:49,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:57:49,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 10:57:49,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:57:49,425 INFO L87 Difference]: Start difference. First operand 1557 states and 2119 transitions. Second operand 8 states. [2019-11-20 10:57:50,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:50,525 INFO L93 Difference]: Finished difference Result 3568 states and 4898 transitions. [2019-11-20 10:57:50,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 10:57:50,526 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 195 [2019-11-20 10:57:50,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:50,539 INFO L225 Difference]: With dead ends: 3568 [2019-11-20 10:57:50,540 INFO L226 Difference]: Without dead ends: 2069 [2019-11-20 10:57:50,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-20 10:57:50,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2069 states. [2019-11-20 10:57:50,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2069 to 1891. [2019-11-20 10:57:50,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1891 states. [2019-11-20 10:57:50,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2555 transitions. [2019-11-20 10:57:50,621 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2555 transitions. Word has length 195 [2019-11-20 10:57:50,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:50,622 INFO L462 AbstractCegarLoop]: Abstraction has 1891 states and 2555 transitions. [2019-11-20 10:57:50,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 10:57:50,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2555 transitions. [2019-11-20 10:57:50,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-20 10:57:50,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:50,629 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:57:50,833 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:57:50,833 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:50,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:50,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1241778267, now seen corresponding path program 1 times [2019-11-20 10:57:50,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:57:50,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [465199983] [2019-11-20 10:57:50,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:51,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:57:51,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:57:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 463 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-11-20 10:57:51,053 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:57:51,103 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 463 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-11-20 10:57:51,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [465199983] [2019-11-20 10:57:51,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:51,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 10:57:51,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669101191] [2019-11-20 10:57:51,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:57:51,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:57:51,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:57:51,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:57:51,136 INFO L87 Difference]: Start difference. First operand 1891 states and 2555 transitions. Second operand 4 states. [2019-11-20 10:57:51,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:51,402 INFO L93 Difference]: Finished difference Result 3965 states and 5428 transitions. [2019-11-20 10:57:51,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:57:51,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 220 [2019-11-20 10:57:51,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:51,414 INFO L225 Difference]: With dead ends: 3965 [2019-11-20 10:57:51,414 INFO L226 Difference]: Without dead ends: 2132 [2019-11-20 10:57:51,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 436 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 10:57:51,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2019-11-20 10:57:51,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 2087. [2019-11-20 10:57:51,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2087 states. [2019-11-20 10:57:51,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2087 states to 2087 states and 2779 transitions. [2019-11-20 10:57:51,491 INFO L78 Accepts]: Start accepts. Automaton has 2087 states and 2779 transitions. Word has length 220 [2019-11-20 10:57:51,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:51,492 INFO L462 AbstractCegarLoop]: Abstraction has 2087 states and 2779 transitions. [2019-11-20 10:57:51,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:57:51,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 2779 transitions. [2019-11-20 10:57:51,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-20 10:57:51,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:51,499 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 10:57:51,702 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:57:51,702 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:51,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:51,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1291955765, now seen corresponding path program 1 times [2019-11-20 10:57:51,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:57:51,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1193839669] [2019-11-20 10:57:51,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:51,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:57:51,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:57:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-20 10:57:51,898 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:57:51,943 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-20 10:57:51,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1193839669] [2019-11-20 10:57:51,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:51,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 10:57:51,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734499897] [2019-11-20 10:57:51,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:57:51,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:57:51,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:57:51,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:57:51,946 INFO L87 Difference]: Start difference. First operand 2087 states and 2779 transitions. Second operand 4 states. [2019-11-20 10:57:52,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:52,269 INFO L93 Difference]: Finished difference Result 4354 states and 5895 transitions. [2019-11-20 10:57:52,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:57:52,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-11-20 10:57:52,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:52,284 INFO L225 Difference]: With dead ends: 4354 [2019-11-20 10:57:52,284 INFO L226 Difference]: Without dead ends: 2325 [2019-11-20 10:57:52,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 458 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 10:57:52,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2019-11-20 10:57:52,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 2304. [2019-11-20 10:57:52,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2304 states. [2019-11-20 10:57:52,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 3024 transitions. [2019-11-20 10:57:52,373 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 3024 transitions. Word has length 231 [2019-11-20 10:57:52,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:52,373 INFO L462 AbstractCegarLoop]: Abstraction has 2304 states and 3024 transitions. [2019-11-20 10:57:52,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:57:52,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 3024 transitions. [2019-11-20 10:57:52,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-11-20 10:57:52,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:52,381 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:57:52,584 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:57:52,584 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:52,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:52,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1875116247, now seen corresponding path program 1 times [2019-11-20 10:57:52,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:57:52,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1151063311] [2019-11-20 10:57:52,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:52,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:57:52,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:57:52,804 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-11-20 10:57:52,805 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:57:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-11-20 10:57:52,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1151063311] [2019-11-20 10:57:52,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:52,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 10:57:52,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915615316] [2019-11-20 10:57:52,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:57:52,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:57:52,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:57:52,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:57:52,917 INFO L87 Difference]: Start difference. First operand 2304 states and 3024 transitions. Second operand 4 states. [2019-11-20 10:57:53,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:53,242 INFO L93 Difference]: Finished difference Result 4872 states and 6497 transitions. [2019-11-20 10:57:53,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:57:53,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2019-11-20 10:57:53,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:53,259 INFO L225 Difference]: With dead ends: 4872 [2019-11-20 10:57:53,259 INFO L226 Difference]: Without dead ends: 2626 [2019-11-20 10:57:53,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 518 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 10:57:53,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states. [2019-11-20 10:57:53,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2556. [2019-11-20 10:57:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2556 states. [2019-11-20 10:57:53,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 3304 transitions. [2019-11-20 10:57:53,356 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 3304 transitions. Word has length 261 [2019-11-20 10:57:53,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:53,356 INFO L462 AbstractCegarLoop]: Abstraction has 2556 states and 3304 transitions. [2019-11-20 10:57:53,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:57:53,357 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 3304 transitions. [2019-11-20 10:57:53,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-11-20 10:57:53,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:53,364 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:57:53,567 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:57:53,567 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:53,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:53,568 INFO L82 PathProgramCache]: Analyzing trace with hash -362194243, now seen corresponding path program 1 times [2019-11-20 10:57:53,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:57:53,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1503148754] [2019-11-20 10:57:53,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:53,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:57:53,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:57:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 635 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-11-20 10:57:53,801 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:57:53,862 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 635 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-11-20 10:57:53,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1503148754] [2019-11-20 10:57:53,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:53,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 10:57:53,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696707905] [2019-11-20 10:57:53,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:57:53,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:57:53,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:57:53,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:57:53,864 INFO L87 Difference]: Start difference. First operand 2556 states and 3304 transitions. Second operand 4 states. [2019-11-20 10:57:54,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:54,034 INFO L93 Difference]: Finished difference Result 9819 states and 12722 transitions. [2019-11-20 10:57:54,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:57:54,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 262 [2019-11-20 10:57:54,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:54,088 INFO L225 Difference]: With dead ends: 9819 [2019-11-20 10:57:54,089 INFO L226 Difference]: Without dead ends: 7321 [2019-11-20 10:57:54,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 520 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 10:57:54,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7321 states. [2019-11-20 10:57:54,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7321 to 7317. [2019-11-20 10:57:54,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7317 states. [2019-11-20 10:57:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7317 states to 7317 states and 9471 transitions. [2019-11-20 10:57:54,335 INFO L78 Accepts]: Start accepts. Automaton has 7317 states and 9471 transitions. Word has length 262 [2019-11-20 10:57:54,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:54,336 INFO L462 AbstractCegarLoop]: Abstraction has 7317 states and 9471 transitions. [2019-11-20 10:57:54,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:57:54,336 INFO L276 IsEmpty]: Start isEmpty. Operand 7317 states and 9471 transitions. [2019-11-20 10:57:54,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-11-20 10:57:54,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:54,351 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:57:54,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:57:54,553 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:54,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:54,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1596519917, now seen corresponding path program 1 times [2019-11-20 10:57:54,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:57:54,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1687350438] [2019-11-20 10:57:54,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:54,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:57:54,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:57:54,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2019-11-20 10:57:54,818 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:57:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2019-11-20 10:57:54,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1687350438] [2019-11-20 10:57:54,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:54,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 10:57:54,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922416594] [2019-11-20 10:57:54,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:57:54,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:57:54,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:57:54,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:57:54,874 INFO L87 Difference]: Start difference. First operand 7317 states and 9471 transitions. Second operand 4 states. [2019-11-20 10:57:55,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:55,228 INFO L93 Difference]: Finished difference Result 15017 states and 19517 transitions. [2019-11-20 10:57:55,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:57:55,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 286 [2019-11-20 10:57:55,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:55,253 INFO L225 Difference]: With dead ends: 15017 [2019-11-20 10:57:55,253 INFO L226 Difference]: Without dead ends: 7758 [2019-11-20 10:57:55,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 568 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 10:57:55,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7758 states. [2019-11-20 10:57:55,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7758 to 7548. [2019-11-20 10:57:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7548 states. [2019-11-20 10:57:55,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7548 states to 7548 states and 9716 transitions. [2019-11-20 10:57:55,462 INFO L78 Accepts]: Start accepts. Automaton has 7548 states and 9716 transitions. Word has length 286 [2019-11-20 10:57:55,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:55,463 INFO L462 AbstractCegarLoop]: Abstraction has 7548 states and 9716 transitions. [2019-11-20 10:57:55,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:57:55,463 INFO L276 IsEmpty]: Start isEmpty. Operand 7548 states and 9716 transitions. [2019-11-20 10:57:55,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-11-20 10:57:55,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:55,477 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 10:57:55,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:57:55,679 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:55,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:55,679 INFO L82 PathProgramCache]: Analyzing trace with hash -49494058, now seen corresponding path program 1 times [2019-11-20 10:57:55,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:57:55,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1589109474] [2019-11-20 10:57:55,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:55,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:57:55,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:57:55,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1207 backedges. 667 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-11-20 10:57:55,925 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:57:56,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1207 backedges. 667 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-11-20 10:57:56,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1589109474] [2019-11-20 10:57:56,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:56,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 10:57:56,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184127756] [2019-11-20 10:57:56,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:57:56,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:57:56,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:57:56,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:57:56,040 INFO L87 Difference]: Start difference. First operand 7548 states and 9716 transitions. Second operand 4 states. [2019-11-20 10:57:56,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:56,418 INFO L93 Difference]: Finished difference Result 16025 states and 20952 transitions. [2019-11-20 10:57:56,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:57:56,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 298 [2019-11-20 10:57:56,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:56,432 INFO L225 Difference]: With dead ends: 16025 [2019-11-20 10:57:56,433 INFO L226 Difference]: Without dead ends: 8535 [2019-11-20 10:57:56,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 592 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 10:57:56,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8535 states. [2019-11-20 10:57:56,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8535 to 8325. [2019-11-20 10:57:56,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8325 states. [2019-11-20 10:57:56,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8325 states to 8325 states and 10577 transitions. [2019-11-20 10:57:56,647 INFO L78 Accepts]: Start accepts. Automaton has 8325 states and 10577 transitions. Word has length 298 [2019-11-20 10:57:56,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:56,648 INFO L462 AbstractCegarLoop]: Abstraction has 8325 states and 10577 transitions. [2019-11-20 10:57:56,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:57:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 8325 states and 10577 transitions. [2019-11-20 10:57:56,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-20 10:57:56,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:56,661 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 14, 12, 12, 10, 10, 8, 8, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:57:56,863 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:57:56,863 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:56,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:56,863 INFO L82 PathProgramCache]: Analyzing trace with hash -549291359, now seen corresponding path program 1 times [2019-11-20 10:57:56,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:57:56,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1890273780] [2019-11-20 10:57:56,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:56,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:57:56,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:57:57,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1448 backedges. 759 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-20 10:57:57,069 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:57:57,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1448 backedges. 759 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-20 10:57:57,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1890273780] [2019-11-20 10:57:57,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:57:57,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 10:57:57,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561826430] [2019-11-20 10:57:57,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:57:57,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:57:57,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:57:57,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:57:57,201 INFO L87 Difference]: Start difference. First operand 8325 states and 10577 transitions. Second operand 4 states. [2019-11-20 10:57:57,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:57,585 INFO L93 Difference]: Finished difference Result 17636 states and 22773 transitions. [2019-11-20 10:57:57,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:57:57,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 335 [2019-11-20 10:57:57,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:57,603 INFO L225 Difference]: With dead ends: 17636 [2019-11-20 10:57:57,603 INFO L226 Difference]: Without dead ends: 9369 [2019-11-20 10:57:57,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 666 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 10:57:57,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9369 states. [2019-11-20 10:57:57,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9369 to 9180. [2019-11-20 10:57:57,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9180 states. [2019-11-20 10:57:57,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9180 states to 9180 states and 11516 transitions. [2019-11-20 10:57:57,843 INFO L78 Accepts]: Start accepts. Automaton has 9180 states and 11516 transitions. Word has length 335 [2019-11-20 10:57:57,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:57,844 INFO L462 AbstractCegarLoop]: Abstraction has 9180 states and 11516 transitions. [2019-11-20 10:57:57,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:57:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 9180 states and 11516 transitions. [2019-11-20 10:57:57,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-11-20 10:57:57,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:57,856 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:57:58,058 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:57:58,058 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:58,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:58,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1440496778, now seen corresponding path program 1 times [2019-11-20 10:57:58,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:57:58,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [856978010] [2019-11-20 10:57:58,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:58,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 10:57:58,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:57:58,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 905 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-20 10:57:58,278 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:57:58,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 905 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-20 10:57:58,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [856978010] [2019-11-20 10:57:58,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:57:58,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-20 10:57:58,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314749975] [2019-11-20 10:57:58,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:57:58,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:57:58,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:57:58,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:57:58,397 INFO L87 Difference]: Start difference. First operand 9180 states and 11516 transitions. Second operand 6 states. [2019-11-20 10:57:59,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:57:59,333 INFO L93 Difference]: Finished difference Result 19024 states and 23829 transitions. [2019-11-20 10:57:59,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 10:57:59,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 358 [2019-11-20 10:57:59,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:57:59,345 INFO L225 Difference]: With dead ends: 19024 [2019-11-20 10:57:59,346 INFO L226 Difference]: Without dead ends: 6577 [2019-11-20 10:57:59,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 714 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:57:59,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6577 states. [2019-11-20 10:57:59,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6577 to 6343. [2019-11-20 10:57:59,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6343 states. [2019-11-20 10:57:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6343 states to 6343 states and 7946 transitions. [2019-11-20 10:57:59,496 INFO L78 Accepts]: Start accepts. Automaton has 6343 states and 7946 transitions. Word has length 358 [2019-11-20 10:57:59,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:57:59,496 INFO L462 AbstractCegarLoop]: Abstraction has 6343 states and 7946 transitions. [2019-11-20 10:57:59,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:57:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 6343 states and 7946 transitions. [2019-11-20 10:57:59,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2019-11-20 10:57:59,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:57:59,505 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 18, 17, 15, 15, 15, 14, 13, 13, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:57:59,706 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:57:59,706 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:57:59,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:57:59,706 INFO L82 PathProgramCache]: Analyzing trace with hash -875382811, now seen corresponding path program 1 times [2019-11-20 10:57:59,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:57:59,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1651950356] [2019-11-20 10:57:59,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/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 10:57:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:57:59,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:57:59,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:58:00,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3223 backedges. 1538 proven. 0 refuted. 0 times theorem prover too weak. 1685 trivial. 0 not checked. [2019-11-20 10:58:00,077 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:58:00,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3223 backedges. 1538 proven. 0 refuted. 0 times theorem prover too weak. 1685 trivial. 0 not checked. [2019-11-20 10:58:00,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1651950356] [2019-11-20 10:58:00,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:58:00,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 10:58:00,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885734658] [2019-11-20 10:58:00,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:58:00,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:58:00,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:58:00,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:58:00,281 INFO L87 Difference]: Start difference. First operand 6343 states and 7946 transitions. Second operand 4 states. [2019-11-20 10:58:00,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:58:00,528 INFO L93 Difference]: Finished difference Result 12996 states and 16509 transitions. [2019-11-20 10:58:00,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:58:00,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 543 [2019-11-20 10:58:00,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:58:00,535 INFO L225 Difference]: With dead ends: 12996 [2019-11-20 10:58:00,536 INFO L226 Difference]: Without dead ends: 6079 [2019-11-20 10:58:00,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1084 GetRequests, 1082 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 10:58:00,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6079 states. [2019-11-20 10:58:00,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6079 to 6043. [2019-11-20 10:58:00,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6043 states. [2019-11-20 10:58:00,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6043 states to 6043 states and 7526 transitions. [2019-11-20 10:58:00,687 INFO L78 Accepts]: Start accepts. Automaton has 6043 states and 7526 transitions. Word has length 543 [2019-11-20 10:58:00,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:58:00,688 INFO L462 AbstractCegarLoop]: Abstraction has 6043 states and 7526 transitions. [2019-11-20 10:58:00,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:58:00,688 INFO L276 IsEmpty]: Start isEmpty. Operand 6043 states and 7526 transitions. [2019-11-20 10:58:00,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2019-11-20 10:58:00,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:58:00,698 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 20, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:58:00,901 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:58:00,901 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:58:00,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:58:00,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1765106863, now seen corresponding path program 1 times [2019-11-20 10:58:00,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:58:00,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2099026050] [2019-11-20 10:58:00,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/bin/uautomizer/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:58:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:58:01,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 10:58:01,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:58:01,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4151 backedges. 2135 proven. 14 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2019-11-20 10:58:01,442 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:58:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4151 backedges. 2135 proven. 14 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2019-11-20 10:58:01,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2099026050] [2019-11-20 10:58:01,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 10:58:01,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-20 10:58:01,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415991524] [2019-11-20 10:58:01,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:58:01,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:58:01,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:58:01,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:58:01,677 INFO L87 Difference]: Start difference. First operand 6043 states and 7526 transitions. Second operand 6 states. [2019-11-20 10:58:01,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:58:01,894 INFO L93 Difference]: Finished difference Result 6256 states and 7796 transitions. [2019-11-20 10:58:01,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 10:58:01,894 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 618 [2019-11-20 10:58:01,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:58:01,895 INFO L225 Difference]: With dead ends: 6256 [2019-11-20 10:58:01,895 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 10:58:01,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1238 GetRequests, 1232 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:58:01,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 10:58:01,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 10:58:01,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 10:58:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 10:58:01,901 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 618 [2019-11-20 10:58:01,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:58:01,902 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 10:58:01,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:58:01,902 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 10:58:01,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 10:58:02,105 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 10:58:02,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 10:58:02,316 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 90 [2019-11-20 10:58:02,719 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 124 [2019-11-20 10:58:03,198 WARN L191 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2019-11-20 10:58:03,793 WARN L191 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-11-20 10:58:03,895 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-20 10:58:04,193 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-11-20 10:58:04,469 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 33 [2019-11-20 10:58:04,718 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-11-20 10:58:05,461 WARN L191 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 59 [2019-11-20 10:58:05,562 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-20 10:58:07,068 WARN L191 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 118 DAG size of output: 109 [2019-11-20 10:58:07,289 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 52 [2019-11-20 10:58:07,498 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-11-20 10:58:07,501 INFO L447 ceAbstractionStarter]: At program point L597(lines 92 598) the Hoare annotation is: true [2019-11-20 10:58:07,501 INFO L444 ceAbstractionStarter]: For program point L168(lines 168 541) no Hoare annotation was computed. [2019-11-20 10:58:07,501 INFO L444 ceAbstractionStarter]: For program point L135(lines 135 552) no Hoare annotation was computed. [2019-11-20 10:58:07,501 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 563) no Hoare annotation was computed. [2019-11-20 10:58:07,501 INFO L444 ceAbstractionStarter]: For program point L367(lines 367 371) no Hoare annotation was computed. [2019-11-20 10:58:07,501 INFO L444 ceAbstractionStarter]: For program point L367-2(lines 367 371) no Hoare annotation was computed. [2019-11-20 10:58:07,501 INFO L444 ceAbstractionStarter]: For program point L301-1(lines 301 315) no Hoare annotation was computed. [2019-11-20 10:58:07,501 INFO L440 ceAbstractionStarter]: At program point L202(lines 99 564) the Hoare annotation is: (and (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32))) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32))) (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32)))) [2019-11-20 10:58:07,502 INFO L440 ceAbstractionStarter]: At program point L169(lines 165 542) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse4 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse6 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse7 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse8 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse9 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse10 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32)))) (.cse1 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse2 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse7 .cse8 .cse9 .cse10)) (and .cse0 (and .cse3 .cse4 .cse5 .cse6 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse7 .cse8 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse9 .cse10) .cse1 .cse2))) [2019-11-20 10:58:07,502 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 594) no Hoare annotation was computed. [2019-11-20 10:58:07,502 INFO L444 ceAbstractionStarter]: For program point L567(lines 567 591) no Hoare annotation was computed. [2019-11-20 10:58:07,502 INFO L444 ceAbstractionStarter]: For program point L501-1(lines 197 529) no Hoare annotation was computed. [2019-11-20 10:58:07,502 INFO L444 ceAbstractionStarter]: For program point L336(lines 336 341) no Hoare annotation was computed. [2019-11-20 10:58:07,502 INFO L444 ceAbstractionStarter]: For program point L171(lines 171 540) no Hoare annotation was computed. [2019-11-20 10:58:07,502 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 551) no Hoare annotation was computed. [2019-11-20 10:58:07,502 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 562) no Hoare annotation was computed. [2019-11-20 10:58:07,502 INFO L444 ceAbstractionStarter]: For program point L601(lines 601 605) no Hoare annotation was computed. [2019-11-20 10:58:07,503 INFO L444 ceAbstractionStarter]: For program point L568(lines 568 577) no Hoare annotation was computed. [2019-11-20 10:58:07,503 INFO L444 ceAbstractionStarter]: For program point L601-2(lines 601 605) no Hoare annotation was computed. [2019-11-20 10:58:07,503 INFO L444 ceAbstractionStarter]: For program point L568-2(lines 567 589) no Hoare annotation was computed. [2019-11-20 10:58:07,503 INFO L440 ceAbstractionStarter]: At program point L139(lines 135 552) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse6 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse8 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse9 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse7 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse10 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse6 .cse8 .cse9 .cse0 .cse2 .cse5 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse7 .cse10))) [2019-11-20 10:58:07,503 INFO L444 ceAbstractionStarter]: For program point L73(lines 73 81) no Hoare annotation was computed. [2019-11-20 10:58:07,503 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 309) no Hoare annotation was computed. [2019-11-20 10:58:07,503 INFO L444 ceAbstractionStarter]: For program point L305-2(lines 303 315) no Hoare annotation was computed. [2019-11-20 10:58:07,503 INFO L444 ceAbstractionStarter]: For program point L570(lines 570 574) no Hoare annotation was computed. [2019-11-20 10:58:07,503 INFO L444 ceAbstractionStarter]: For program point L438(lines 438 443) no Hoare annotation was computed. [2019-11-20 10:58:07,504 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 277) no Hoare annotation was computed. [2019-11-20 10:58:07,504 INFO L444 ceAbstractionStarter]: For program point L207(lines 207 211) no Hoare annotation was computed. [2019-11-20 10:58:07,504 INFO L444 ceAbstractionStarter]: For program point L174(lines 174 539) no Hoare annotation was computed. [2019-11-20 10:58:07,504 INFO L444 ceAbstractionStarter]: For program point L141(lines 141 550) no Hoare annotation was computed. [2019-11-20 10:58:07,504 INFO L444 ceAbstractionStarter]: For program point L207-2(lines 197 529) no Hoare annotation was computed. [2019-11-20 10:58:07,504 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 561) no Hoare annotation was computed. [2019-11-20 10:58:07,504 INFO L444 ceAbstractionStarter]: For program point L472(lines 472 476) no Hoare annotation was computed. [2019-11-20 10:58:07,504 INFO L440 ceAbstractionStarter]: At program point L175(lines 171 540) the Hoare annotation is: (let ((.cse5 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse7 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse4 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse11 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (.cse6 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse8 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32)))) (.cse9 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse10 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse5 .cse6 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse7 .cse8) .cse9 .cse10) (and .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10) (and (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse1 (and .cse3 (not .cse2) .cse4 .cse11 .cse6 .cse8) .cse9 .cse10)))) [2019-11-20 10:58:07,505 INFO L444 ceAbstractionStarter]: For program point L76(lines 76 80) no Hoare annotation was computed. [2019-11-20 10:58:07,505 INFO L444 ceAbstractionStarter]: For program point L76-2(lines 73 81) no Hoare annotation was computed. [2019-11-20 10:58:07,505 INFO L444 ceAbstractionStarter]: For program point L506-1(lines 506 510) no Hoare annotation was computed. [2019-11-20 10:58:07,505 INFO L444 ceAbstractionStarter]: For program point L407(lines 407 411) no Hoare annotation was computed. [2019-11-20 10:58:07,505 INFO L444 ceAbstractionStarter]: For program point L243(lines 243 248) no Hoare annotation was computed. [2019-11-20 10:58:07,505 INFO L444 ceAbstractionStarter]: For program point L177(lines 177 538) no Hoare annotation was computed. [2019-11-20 10:58:07,505 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 549) no Hoare annotation was computed. [2019-11-20 10:58:07,505 INFO L444 ceAbstractionStarter]: For program point L111(lines 111 560) no Hoare annotation was computed. [2019-11-20 10:58:07,505 INFO L440 ceAbstractionStarter]: At program point L145(lines 141 550) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse6 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse7 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse9 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse8 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse10 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse6 .cse7 .cse9 .cse0 .cse2 .cse5 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse8 .cse10))) [2019-11-20 10:58:07,506 INFO L444 ceAbstractionStarter]: For program point L477(lines 477 481) no Hoare annotation was computed. [2019-11-20 10:58:07,506 INFO L444 ceAbstractionStarter]: For program point L477-2(lines 477 481) no Hoare annotation was computed. [2019-11-20 10:58:07,506 INFO L444 ceAbstractionStarter]: For program point L180(lines 180 537) no Hoare annotation was computed. [2019-11-20 10:58:07,506 INFO L444 ceAbstractionStarter]: For program point L147(lines 147 548) no Hoare annotation was computed. [2019-11-20 10:58:07,506 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 559) no Hoare annotation was computed. [2019-11-20 10:58:07,506 INFO L444 ceAbstractionStarter]: For program point L379(lines 379 383) no Hoare annotation was computed. [2019-11-20 10:58:07,506 INFO L444 ceAbstractionStarter]: For program point L346(lines 346 350) no Hoare annotation was computed. [2019-11-20 10:58:07,506 INFO L440 ceAbstractionStarter]: At program point L181(lines 177 538) the Hoare annotation is: (let ((.cse5 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse2 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse6 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse7 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse8 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse9 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse10 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32)))) (.cse11 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11) (and (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0)) .cse4 (and .cse0 (and .cse2 .cse3 (not .cse1) .cse5 .cse7 .cse8 .cse10) .cse11)) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse6 .cse7 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse8 .cse9 .cse10) .cse11))) [2019-11-20 10:58:07,507 INFO L440 ceAbstractionStarter]: At program point L115(lines 111 560) the Hoare annotation is: (and (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32))) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32))) (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32)))) [2019-11-20 10:58:07,507 INFO L440 ceAbstractionStarter]: At program point L347(lines 65 614) the Hoare annotation is: false [2019-11-20 10:58:07,507 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 91) no Hoare annotation was computed. [2019-11-20 10:58:07,507 INFO L447 ceAbstractionStarter]: At program point L612(lines 65 614) the Hoare annotation is: true [2019-11-20 10:58:07,507 INFO L444 ceAbstractionStarter]: For program point L579(lines 579 585) no Hoare annotation was computed. [2019-11-20 10:58:07,507 INFO L444 ceAbstractionStarter]: For program point L513(lines 513 517) no Hoare annotation was computed. [2019-11-20 10:58:07,507 INFO L444 ceAbstractionStarter]: For program point L513-2(lines 513 517) no Hoare annotation was computed. [2019-11-20 10:58:07,507 INFO L444 ceAbstractionStarter]: For program point L282(lines 282 286) no Hoare annotation was computed. [2019-11-20 10:58:07,507 INFO L444 ceAbstractionStarter]: For program point L282-2(lines 197 529) no Hoare annotation was computed. [2019-11-20 10:58:07,507 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 536) no Hoare annotation was computed. [2019-11-20 10:58:07,507 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 547) no Hoare annotation was computed. [2019-11-20 10:58:07,507 INFO L444 ceAbstractionStarter]: For program point L117(lines 117 558) no Hoare annotation was computed. [2019-11-20 10:58:07,507 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 88) no Hoare annotation was computed. [2019-11-20 10:58:07,507 INFO L447 ceAbstractionStarter]: At program point L613(lines 8 615) the Hoare annotation is: true [2019-11-20 10:58:07,508 INFO L444 ceAbstractionStarter]: For program point L448(lines 448 452) no Hoare annotation was computed. [2019-11-20 10:58:07,508 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 10:58:07,508 INFO L444 ceAbstractionStarter]: For program point L351(lines 351 355) no Hoare annotation was computed. [2019-11-20 10:58:07,508 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 236) no Hoare annotation was computed. [2019-11-20 10:58:07,508 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 535) no Hoare annotation was computed. [2019-11-20 10:58:07,508 INFO L444 ceAbstractionStarter]: For program point L153(lines 153 546) no Hoare annotation was computed. [2019-11-20 10:58:07,508 INFO L444 ceAbstractionStarter]: For program point L219-2(lines 197 529) no Hoare annotation was computed. [2019-11-20 10:58:07,508 INFO L444 ceAbstractionStarter]: For program point L120(lines 120 557) no Hoare annotation was computed. [2019-11-20 10:58:07,508 INFO L440 ceAbstractionStarter]: At program point L187(lines 183 536) the Hoare annotation is: (let ((.cse12 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (let ((.cse2 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse9 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse0 (and .cse12 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0))) (.cse10 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse13 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse5 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse6 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse11 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse7 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse8 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32))))) (or (and (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (let ((.cse1 (not .cse9))) (or (and .cse0 .cse1 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse2 .cse0 .cse3 .cse4 .cse1 .cse5 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) .cse6 .cse7 .cse8)))) (and .cse9 .cse10 .cse4 .cse5 .cse11 .cse7 .cse2 .cse3 (and .cse12 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0))) .cse13 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse6 .cse8) (and .cse2 .cse9 .cse0 .cse10 .cse3 .cse4 .cse13 .cse5 .cse6 .cse11 .cse7 .cse8)))) [2019-11-20 10:58:07,508 INFO L440 ceAbstractionStarter]: At program point L121(lines 117 558) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse1 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse9 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse7 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse8 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse10 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse6 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse11 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32))))) (or (and .cse0 .cse1 .cse2 .cse3 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse10 .cse11) (and .cse7 (not (= (_ bv4401 32) ULTIMATE.start_ssl3_connect_~s__state~0)) .cse8 .cse2 .cse3 .cse4 .cse10 (= (_ bv1 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse6 .cse11))) [2019-11-20 10:58:07,508 INFO L444 ceAbstractionStarter]: For program point L485-1(lines 485 497) no Hoare annotation was computed. [2019-11-20 10:58:07,509 INFO L444 ceAbstractionStarter]: For program point L419(lines 419 423) no Hoare annotation was computed. [2019-11-20 10:58:07,509 INFO L444 ceAbstractionStarter]: For program point L221(lines 221 226) no Hoare annotation was computed. [2019-11-20 10:58:07,509 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 534) no Hoare annotation was computed. [2019-11-20 10:58:07,509 INFO L444 ceAbstractionStarter]: For program point L156(lines 156 545) no Hoare annotation was computed. [2019-11-20 10:58:07,509 INFO L444 ceAbstractionStarter]: For program point L123(lines 123 556) no Hoare annotation was computed. [2019-11-20 10:58:07,509 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 524) no Hoare annotation was computed. [2019-11-20 10:58:07,509 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 10:58:07,513 INFO L440 ceAbstractionStarter]: At program point L190(lines 189 534) the Hoare annotation is: (let ((.cse3 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse1 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse2 (= (_ bv4352 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse4 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse5 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 (not .cse0) .cse3 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 (_ bv4294967293 32)) (_ bv0 32))) (and .cse0 .cse1 .cse2 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse4 .cse5 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32))))) [2019-11-20 10:58:07,513 INFO L440 ceAbstractionStarter]: At program point L157(lines 147 548) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse6 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse7 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse8 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse9 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse10 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32))))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse5 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse6) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (and .cse2 .cse3 .cse4 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse5 .cse6) .cse7 .cse8 .cse9 .cse10))) [2019-11-20 10:58:07,513 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 493) no Hoare annotation was computed. [2019-11-20 10:58:07,514 INFO L444 ceAbstractionStarter]: For program point L455(lines 455 466) no Hoare annotation was computed. [2019-11-20 10:58:07,514 INFO L444 ceAbstractionStarter]: For program point L455-1(lines 455 466) no Hoare annotation was computed. [2019-11-20 10:58:07,514 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 327) no Hoare annotation was computed. [2019-11-20 10:58:07,514 INFO L444 ceAbstractionStarter]: For program point L257(lines 257 265) no Hoare annotation was computed. [2019-11-20 10:58:07,514 INFO L444 ceAbstractionStarter]: For program point L323-2(lines 197 529) no Hoare annotation was computed. [2019-11-20 10:58:07,514 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 394) no Hoare annotation was computed. [2019-11-20 10:58:07,515 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 533) no Hoare annotation was computed. [2019-11-20 10:58:07,515 INFO L444 ceAbstractionStarter]: For program point L159(lines 159 544) no Hoare annotation was computed. [2019-11-20 10:58:07,515 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 555) no Hoare annotation was computed. [2019-11-20 10:58:07,515 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 65 614) no Hoare annotation was computed. [2019-11-20 10:58:07,515 INFO L444 ceAbstractionStarter]: For program point L457(lines 457 463) no Hoare annotation was computed. [2019-11-20 10:58:07,515 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 296) no Hoare annotation was computed. [2019-11-20 10:58:07,515 INFO L444 ceAbstractionStarter]: For program point L292-2(lines 292 296) no Hoare annotation was computed. [2019-11-20 10:58:07,516 INFO L447 ceAbstractionStarter]: At program point L193(lines 192 533) the Hoare annotation is: true [2019-11-20 10:58:07,516 INFO L440 ceAbstractionStarter]: At program point L127(lines 123 556) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse6 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse2 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse7 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32))))) (or (and .cse0 .cse1 .cse2 .cse3 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse4 .cse5 .cse6 .cse7) (and .cse1 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse3 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse4 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0) .cse6 .cse0 .cse2 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0) (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse5 .cse7))) [2019-11-20 10:58:07,516 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-20 10:58:07,516 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 10:58:07,516 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 264) no Hoare annotation was computed. [2019-11-20 10:58:07,516 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 232) no Hoare annotation was computed. [2019-11-20 10:58:07,517 INFO L444 ceAbstractionStarter]: For program point L260-2(lines 197 529) no Hoare annotation was computed. [2019-11-20 10:58:07,517 INFO L447 ceAbstractionStarter]: At program point L624(lines 616 626) the Hoare annotation is: true [2019-11-20 10:58:07,517 INFO L444 ceAbstractionStarter]: For program point L162(lines 162 543) no Hoare annotation was computed. [2019-11-20 10:58:07,517 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 554) no Hoare annotation was computed. [2019-11-20 10:58:07,517 INFO L444 ceAbstractionStarter]: For program point L96(lines 96 565) no Hoare annotation was computed. [2019-11-20 10:58:07,517 INFO L444 ceAbstractionStarter]: For program point L427(lines 427 431) no Hoare annotation was computed. [2019-11-20 10:58:07,517 INFO L444 ceAbstractionStarter]: For program point L427-2(lines 197 529) no Hoare annotation was computed. [2019-11-20 10:58:07,518 INFO L447 ceAbstractionStarter]: At program point L196(lines 195 532) the Hoare annotation is: true [2019-11-20 10:58:07,518 INFO L440 ceAbstractionStarter]: At program point L163(lines 159 544) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse5 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse6 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse7 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse8 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse9 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32)))) (.cse2 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse3 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse10 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0)))) (or (and .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse7 .cse8 .cse9) .cse10) (and .cse0 .cse1 (and .cse4 .cse5 .cse6 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse7 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse8 .cse9) .cse2 .cse3 .cse10))) [2019-11-20 10:58:07,518 INFO L440 ceAbstractionStarter]: At program point L97(lines 96 565) the Hoare annotation is: (and (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32)) (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) [2019-11-20 10:58:07,518 INFO L444 ceAbstractionStarter]: For program point L362(lines 362 366) no Hoare annotation was computed. [2019-11-20 10:58:07,518 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 608) no Hoare annotation was computed. [2019-11-20 10:58:07,519 INFO L444 ceAbstractionStarter]: For program point L396(lines 396 401) no Hoare annotation was computed. [2019-11-20 10:58:07,519 INFO L444 ceAbstractionStarter]: For program point L396-2(lines 396 401) no Hoare annotation was computed. [2019-11-20 10:58:07,519 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 542) no Hoare annotation was computed. [2019-11-20 10:58:07,519 INFO L444 ceAbstractionStarter]: For program point L132(lines 132 553) no Hoare annotation was computed. [2019-11-20 10:58:07,519 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 564) no Hoare annotation was computed. [2019-11-20 10:58:07,519 INFO L440 ceAbstractionStarter]: At program point L133(lines 129 554) the Hoare annotation is: (let ((.cse0 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse1 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse2 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse3 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse4 (not (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse5 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse6 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse7 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse8 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse9 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) .cse5 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32)) .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse5 .cse6 .cse7 .cse8 .cse9))) [2019-11-20 10:58:07,520 INFO L440 ceAbstractionStarter]: At program point L530(lines 93 596) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_connect_~s__hit~0 (_ bv0 32))) (.cse14 (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (let ((.cse20 (= (_ bv4496 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse8 (not (= (_ bv4369 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse9 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294950912 32)) (_ bv0 32)))) (.cse11 (not .cse14)) (.cse5 (not (= (_ bv4099 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse7 (not (= (_ bv4096 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (.cse10 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294946816 32)) (_ bv0 32)))) (.cse12 (not (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294955004 32)) (_ bv0 32)))) (.cse22 (= (_ bv4480 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse16 (= (_ bv4512 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse19 (= (bvadd ULTIMATE.start_ssl3_connect_~s__state~0 (_ bv4294967293 32)) (_ bv0 32))) (.cse13 (not .cse0)) (.cse18 (not (= (_ bv4368 32) ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0))) (.cse4 (= (_ bv4448 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse21 (= (_ bv4528 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse15 (not (= (_ bv5 32) ULTIMATE.start_ssl3_connect_~blastFlag~0))) (.cse17 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 (_ bv4294967040 32)) (_ bv0 32))) (.cse23 (= (_ bv4464 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse25 (= (_ bv4416 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (= (_ bv2 32) ULTIMATE.start_ssl3_connect_~blastFlag~0)) (.cse2 (= (_ bv65535 32) ULTIMATE.start_ssl3_connect_~ag_X~0)) (.cse3 (= (_ bv61087 32) ULTIMATE.start_ssl3_connect_~ag_Y~0)) (.cse24 (= (_ bv4432 32) ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6 .cse7 .cse8 .cse1 .cse9 .cse2 .cse3 .cse10 .cse11 .cse12) (and (= (_ bv4352 32) ULTIMATE.start_ssl3_connect_~s__state~0) .cse13 .cse1 (= (bvadd ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 (_ bv4294967293 32)) (_ bv0 32))) (and (= (_ bv0 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) .cse14) (and .cse0 .cse15 .cse16 .cse3 .cse2 .cse17) (and .cse13 .cse18 .cse3 .cse19 .cse2 .cse17) (and .cse0 .cse20 .cse1 .cse2 .cse3) (and (= (_ bv1 32) ULTIMATE.start_ssl3_connect_~blastFlag~0) (= (_ bv4384 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse21 .cse13 .cse1) (and .cse0 .cse15 .cse3 .cse22 .cse2 .cse17) (and .cse0 .cse15 .cse3 .cse21 .cse2 .cse17) (and .cse0 .cse15 .cse3 .cse20 .cse2 .cse17) (and .cse0 .cse6 .cse8 .cse15 .cse9 .cse3 .cse11 .cse5 .cse7 .cse2 .cse17 .cse10 .cse12) (and .cse0 .cse22 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse16 .cse3) (and .cse13 .cse1 .cse16) (and .cse13 (= (_ bv4560 32) ULTIMATE.start_ssl3_connect_~s__state~0) .cse1) (and .cse19 .cse13 .cse1 .cse18) (and .cse0 .cse15 .cse2 .cse17 .cse3 .cse4) (and .cse0 .cse15 .cse3 .cse2 .cse23 .cse17) (and .cse21 .cse1 .cse2 .cse3) (and .cse0 .cse15 .cse3 .cse2 .cse17 .cse24) (and .cse0 .cse15 .cse3 .cse25 .cse17) (and .cse0 .cse1 .cse2 .cse23 .cse3) (and .cse0 .cse1 (= (_ bv4400 32) ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse25 .cse1 .cse3) (and .cse0 .cse1 .cse2 .cse3 .cse24)))) [2019-11-20 10:58:07,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:58:07 BoogieIcfgContainer [2019-11-20 10:58:07,563 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 10:58:07,563 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 10:58:07,563 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 10:58:07,563 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 10:58:07,564 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:57:41" (3/4) ... [2019-11-20 10:58:07,567 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 10:58:07,590 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-20 10:58:07,591 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 10:58:07,685 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f9d6b7a7-2e87-4f85-8f4c-5c99a6f66686/bin/uautomizer/witness.graphml [2019-11-20 10:58:07,685 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 10:58:07,686 INFO L168 Benchmark]: Toolchain (without parser) took 27782.68 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.0 GB). Free memory was 956.4 MB in the beginning and 1.6 GB in the end (delta: -616.3 MB). Peak memory consumption was 419.7 MB. Max. memory is 11.5 GB. [2019-11-20 10:58:07,687 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:58:07,687 INFO L168 Benchmark]: CACSL2BoogieTranslator took 552.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -192.1 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:58:07,687 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-20 10:58:07,688 INFO L168 Benchmark]: Boogie Preprocessor took 37.49 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 10:58:07,688 INFO L168 Benchmark]: RCFGBuilder took 806.18 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: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:58:07,688 INFO L168 Benchmark]: TraceAbstraction took 26199.84 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 877.1 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -503.6 MB). Peak memory consumption was 907.2 MB. Max. memory is 11.5 GB. [2019-11-20 10:58:07,689 INFO L168 Benchmark]: Witness Printer took 121.97 ms. Allocated memory is still 2.1 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-20 10:58:07,691 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 552.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -192.1 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 806.18 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: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26199.84 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 877.1 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -503.6 MB). Peak memory consumption was 907.2 MB. Max. memory is 11.5 GB. * Witness Printer took 121.97 ms. Allocated memory is still 2.1 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 608]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (((((!(4099bv32 == s__state) && !(4096bv32 == s__state)) && (((((((s__hit == 0bv32 && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) || ((((!(4099bv32 == s__state) && !(4096bv32 == s__state)) && ((((((s__hit == 0bv32 && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state))) || (!(4401bv32 == s__state) && (((!(4099bv32 == s__state) && !(4096bv32 == s__state)) && ((((!(4369bv32 == s__state) && !(s__hit == 0bv32)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) || ((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((!(4401bv32 == s__state) && ((((!(4400bv32 == s__state) && 2bv32 == blastFlag) && !(s__hit == 0bv32)) && 4560bv32 == s__state) || (((((((((!(4099bv32 == s__state) && !(4400bv32 == s__state) && 2bv32 == blastFlag) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(s__hit == 0bv32)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(4368bv32 == s__s3__tmp__next_state___0)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)))) || ((((((((((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && !(4369bv32 == s__state)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && !(4400bv32 == s__state) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32))) || (((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4400bv32 == s__state) && 2bv32 == blastFlag) && 4560bv32 == s__s3__tmp__next_state___0) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: (((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) || ((((((((((((s__hit == 0bv32 && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((((((!(4099bv32 == s__state) && !(4096bv32 == s__state)) && (((((s__hit == 0bv32 && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) || ((((((!(4099bv32 == s__state) && !(4096bv32 == s__state)) && ((((s__hit == 0bv32 && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((((!(4099bv32 == s__state) && !(4401bv32 == s__state)) && !(4096bv32 == s__state)) && 0bv32 == blastFlag) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32) - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 189]: Loop Invariant Derived loop invariant: ((((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && 4352bv32 == s__state) && 2bv32 == blastFlag) && 61087bv32 == ag_Y) && 65535bv32 == ag_X) || (((4352bv32 == s__state && !(s__hit == 0bv32)) && 2bv32 == blastFlag) && ~bvadd64(s__s3__tmp__next_state___0, 4294967293bv32) == 0bv32)) || ((((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && 4352bv32 == s__state) && !(5bv32 == blastFlag)) && 61087bv32 == ag_Y) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: (((!(4099bv32 == s__state) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && (((((((s__hit == 0bv32 && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) || (((!(4099bv32 == s__state) && ((((((((s__hit == 0bv32 && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: ((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) || ((((((((((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && !(4369bv32 == s__state)) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((((((!(4099bv32 == s__state) && !(4401bv32 == s__state)) && 0bv32 == blastFlag) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((!(4099bv32 == s__state) && ((((((((s__hit == 0bv32 && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(4368bv32 == s__state)) || ((!(4401bv32 == s__state) && !(4400bv32 == s__state)) && (!(4099bv32 == s__state) && (((((!(4096bv32 == s__state) && !(4369bv32 == s__state)) && !(s__hit == 0bv32)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(4368bv32 == s__state))) || ((!(4099bv32 == s__state) && (((((((((s__hit == 0bv32 && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(4368bv32 == s__state)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) || ((((((((((((s__hit == 0bv32 && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ~bvadd64(s__state, 4294955004bv32) == 0bv32 && 0bv32 == blastFlag - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((s__hit == 0bv32 && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y) && 4448bv32 == s__state) || (((((((((((!(4099bv32 == s__state) && s__hit == 0bv32) && 4560bv32 == s__s3__tmp__next_state___0) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 65535bv32 == ag_X) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32))) || (((4352bv32 == s__state && !(s__hit == 0bv32)) && 2bv32 == blastFlag) && ~bvadd64(s__s3__tmp__next_state___0, 4294967293bv32) == 0bv32)) || (0bv32 == blastFlag && 4368bv32 == s__state)) || (((((s__hit == 0bv32 && !(5bv32 == blastFlag)) && 4512bv32 == s__state) && 61087bv32 == ag_Y) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32)) || (((((!(s__hit == 0bv32) && !(4368bv32 == s__s3__tmp__next_state___0)) && 61087bv32 == ag_Y) && ~bvadd64(s__state, 4294967293bv32) == 0bv32) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32)) || ((((s__hit == 0bv32 && 4496bv32 == s__state) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y)) || (1bv32 == blastFlag && 4384bv32 == s__state)) || ((4528bv32 == s__state && !(s__hit == 0bv32)) && 2bv32 == blastFlag)) || (((((s__hit == 0bv32 && !(5bv32 == blastFlag)) && 61087bv32 == ag_Y) && 4480bv32 == s__state) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32)) || (((((s__hit == 0bv32 && !(5bv32 == blastFlag)) && 61087bv32 == ag_Y) && 4528bv32 == s__state) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32)) || (((((s__hit == 0bv32 && !(5bv32 == blastFlag)) && 61087bv32 == ag_Y) && 4496bv32 == s__state) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32)) || ((((((((((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && !(4369bv32 == s__state)) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32))) || ((((s__hit == 0bv32 && 4480bv32 == s__state) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y)) || (((2bv32 == blastFlag && 65535bv32 == ag_X) && 4512bv32 == s__state) && 61087bv32 == ag_Y)) || ((!(s__hit == 0bv32) && 2bv32 == blastFlag) && 4512bv32 == s__state)) || ((!(s__hit == 0bv32) && 4560bv32 == s__state) && 2bv32 == blastFlag)) || (((~bvadd64(s__state, 4294967293bv32) == 0bv32 && !(s__hit == 0bv32)) && 2bv32 == blastFlag) && !(4368bv32 == s__s3__tmp__next_state___0))) || (((((s__hit == 0bv32 && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y) && 4448bv32 == s__state)) || (((((s__hit == 0bv32 && !(5bv32 == blastFlag)) && 61087bv32 == ag_Y) && 65535bv32 == ag_X) && 4464bv32 == s__state) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32)) || (((4528bv32 == s__state && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y)) || (((((s__hit == 0bv32 && !(5bv32 == blastFlag)) && 61087bv32 == ag_Y) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 4432bv32 == s__state)) || ((((s__hit == 0bv32 && !(5bv32 == blastFlag)) && 61087bv32 == ag_Y) && 4416bv32 == s__state) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32)) || ((((s__hit == 0bv32 && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 4464bv32 == s__state) && 61087bv32 == ag_Y)) || ((s__hit == 0bv32 && 2bv32 == blastFlag) && 4400bv32 == s__state)) || (((s__hit == 0bv32 && 4416bv32 == s__state) && 2bv32 == blastFlag) && 61087bv32 == ag_Y)) || ((((s__hit == 0bv32 && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y) && 4432bv32 == s__state) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 159]: Loop Invariant Derived loop invariant: (((((!(4099bv32 == s__state) && !(4096bv32 == s__state)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && (((((s__hit == 0bv32 && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && 65535bv32 == ag_X) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(4368bv32 == s__state)) || (((((!(4099bv32 == s__state) && !(4096bv32 == s__state)) && ((((((s__hit == 0bv32 && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && 61087bv32 == ag_Y) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(4368bv32 == s__state)) - InvariantResult [Line: 8]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((((((((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && 2bv32 == blastFlag) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) || (((((((((((((s__hit == 0bv32 && 4560bv32 == s__s3__tmp__next_state___0) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(5bv32 == blastFlag)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && 61087bv32 == ag_Y) && !(4368bv32 == s__state)) && !(4099bv32 == s__state)) && !(4096bv32 == s__state)) && 65535bv32 == ag_X) && ~bvadd64(s__s3__tmp__new_cipher__algorithms, 4294967040bv32) == 0bv32) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32))) || (((((((((!(4099bv32 == s__state) && !(4401bv32 == s__state)) && !(4096bv32 == s__state)) && !(4369bv32 == s__state)) && !(4400bv32 == s__state)) && !(~bvadd64(s__state, 4294950912bv32) == 0bv32)) && !(~bvadd64(s__state, 4294946816bv32) == 0bv32)) && 1bv32 == blastFlag) && !(4368bv32 == s__state)) && !(~bvadd64(s__state, 4294955004bv32) == 0bv32)) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. Result: SAFE, OverallTime: 26.1s, OverallIterations: 24, TraceHistogramMax: 22, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.3s, HoareTripleCheckerStatistics: 4322 SDtfs, 3404 SDslu, 3841 SDs, 0 SdLazy, 3752 SolverSat, 645 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9836 GetRequests, 9781 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9180occurred 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: 1.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 1298 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 23 PreInvPairs, 263 NumberOfFragments, 2104 HoareAnnotationTreeSize, 23 FomulaSimplifications, 10070 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 23 FomulaSimplificationsInter, 5527 FormulaSimplificationTreeSizeReductionInter, 4.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 4933 NumberOfCodeBlocks, 4933 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 9818 ConstructedInterpolants, 0 QuantifiedInterpolants, 3880007 SizeOfPredicates, 20 NumberOfNonLiveVariables, 6480 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 48 InterpolantComputations, 42 PerfectInterpolantSequences, 38264/38368 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 correct! Received shutdown request...