./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/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 a85198d3f93b8c751f2c6e712deab62f97c1022f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_7a71b520-29fa-4a2c-8ead-7c410af69be7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/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 a85198d3f93b8c751f2c6e712deab62f97c1022f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:39:50,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:39:50,098 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:39:50,106 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:39:50,106 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:39:50,107 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:39:50,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:39:50,109 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:39:50,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:39:50,111 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:39:50,112 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:39:50,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:39:50,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:39:50,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:39:50,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:39:50,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:39:50,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:39:50,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:39:50,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:39:50,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:39:50,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:39:50,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:39:50,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:39:50,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:39:50,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:39:50,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:39:50,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:39:50,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:39:50,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:39:50,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:39:50,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:39:50,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:39:50,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:39:50,127 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:39:50,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:39:50,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:39:50,128 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:39:50,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:39:50,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:39:50,129 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:39:50,130 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:39:50,130 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:39:50,140 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:39:50,140 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:39:50,140 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:39:50,141 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:39:50,141 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:39:50,141 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:39:50,141 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:39:50,141 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:39:50,141 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:39:50,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:39:50,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:39:50,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:39:50,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:39:50,142 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:39:50,142 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:39:50,142 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:39:50,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:39:50,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:39:50,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:39:50,142 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:39:50,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:39:50,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:39:50,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:39:50,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:39:50,143 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:39:50,143 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:39:50,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:39:50,143 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:39:50,143 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:39:50,143 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_7a71b520-29fa-4a2c-8ead-7c410af69be7/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 -> a85198d3f93b8c751f2c6e712deab62f97c1022f [2019-12-07 12:39:50,246 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:39:50,256 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:39:50,259 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:39:50,260 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:39:50,261 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:39:50,261 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-12-07 12:39:50,299 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/bin/uautomizer/data/4f1425d7e/ee5559293293453faedb258661f8bbc9/FLAGab8aa3b1f [2019-12-07 12:39:50,806 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:39:50,806 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-12-07 12:39:50,819 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/bin/uautomizer/data/4f1425d7e/ee5559293293453faedb258661f8bbc9/FLAGab8aa3b1f [2019-12-07 12:39:51,331 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/bin/uautomizer/data/4f1425d7e/ee5559293293453faedb258661f8bbc9 [2019-12-07 12:39:51,333 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:39:51,334 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:39:51,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:39:51,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:39:51,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:39:51,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:39:51" (1/1) ... [2019-12-07 12:39:51,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f2342a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:51, skipping insertion in model container [2019-12-07 12:39:51,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:39:51" (1/1) ... [2019-12-07 12:39:51,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:39:51,384 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:39:51,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:39:51,692 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:39:51,776 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:39:51,794 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:39:51,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:51 WrapperNode [2019-12-07 12:39:51,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:39:51,795 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:39:51,795 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:39:51,795 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:39:51,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:51" (1/1) ... [2019-12-07 12:39:51,822 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:51" (1/1) ... [2019-12-07 12:39:51,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:39:51,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:39:51,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:39:51,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:39:51,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:51" (1/1) ... [2019-12-07 12:39:51,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:51" (1/1) ... [2019-12-07 12:39:51,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:51" (1/1) ... [2019-12-07 12:39:51,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:51" (1/1) ... [2019-12-07 12:39:51,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:51" (1/1) ... [2019-12-07 12:39:51,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:51" (1/1) ... [2019-12-07 12:39:51,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:51" (1/1) ... [2019-12-07 12:39:51,930 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:39:51,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:39:51,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:39:51,930 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:39:51,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/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-12-07 12:39:51,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 12:39:51,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:39:51,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:39:51,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 12:39:51,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 12:39:51,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 12:39:51,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:39:51,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:39:52,133 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:39:52,606 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 12:39:52,606 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 12:39:52,607 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:39:52,607 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 12:39:52,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:39:52 BoogieIcfgContainer [2019-12-07 12:39:52,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:39:52,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:39:52,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:39:52,611 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:39:52,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:39:51" (1/3) ... [2019-12-07 12:39:52,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7110e4da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:39:52, skipping insertion in model container [2019-12-07 12:39:52,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:39:51" (2/3) ... [2019-12-07 12:39:52,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7110e4da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:39:52, skipping insertion in model container [2019-12-07 12:39:52,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:39:52" (3/3) ... [2019-12-07 12:39:52,613 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2019-12-07 12:39:52,619 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:39:52,624 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 12:39:52,632 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 12:39:52,647 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:39:52,648 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:39:52,648 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:39:52,648 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:39:52,648 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:39:52,648 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:39:52,648 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:39:52,648 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:39:52,661 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-12-07 12:39:52,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 12:39:52,667 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:52,667 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:52,667 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:52,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:52,671 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-12-07 12:39:52,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:52,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920415317] [2019-12-07 12:39:52,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:52,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920415317] [2019-12-07 12:39:52,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:52,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:52,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512061499] [2019-12-07 12:39:52,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:52,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:52,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:52,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:52,907 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-12-07 12:39:53,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:53,209 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2019-12-07 12:39:53,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:53,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 12:39:53,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:53,219 INFO L225 Difference]: With dead ends: 313 [2019-12-07 12:39:53,219 INFO L226 Difference]: Without dead ends: 158 [2019-12-07 12:39:53,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:53,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-12-07 12:39:53,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-12-07 12:39:53,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 12:39:53,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2019-12-07 12:39:53,254 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2019-12-07 12:39:53,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:53,254 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2019-12-07 12:39:53,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:53,254 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2019-12-07 12:39:53,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 12:39:53,256 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:53,257 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:53,257 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:53,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:53,257 INFO L82 PathProgramCache]: Analyzing trace with hash 968097209, now seen corresponding path program 1 times [2019-12-07 12:39:53,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:53,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368865205] [2019-12-07 12:39:53,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:53,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368865205] [2019-12-07 12:39:53,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:53,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:53,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624682476] [2019-12-07 12:39:53,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:53,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:53,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:53,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:53,336 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2019-12-07 12:39:53,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:53,580 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2019-12-07 12:39:53,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:53,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 12:39:53,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:53,582 INFO L225 Difference]: With dead ends: 280 [2019-12-07 12:39:53,582 INFO L226 Difference]: Without dead ends: 158 [2019-12-07 12:39:53,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:53,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-12-07 12:39:53,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-12-07 12:39:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 12:39:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2019-12-07 12:39:53,591 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2019-12-07 12:39:53,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:53,591 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2019-12-07 12:39:53,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:53,591 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2019-12-07 12:39:53,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:39:53,593 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:53,593 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:53,593 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:53,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:53,594 INFO L82 PathProgramCache]: Analyzing trace with hash -461266997, now seen corresponding path program 1 times [2019-12-07 12:39:53,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:53,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209925541] [2019-12-07 12:39:53,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:53,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209925541] [2019-12-07 12:39:53,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:53,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:53,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690130037] [2019-12-07 12:39:53,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:53,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:53,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:53,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:53,660 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2019-12-07 12:39:53,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:53,870 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2019-12-07 12:39:53,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:53,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 12:39:53,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:53,872 INFO L225 Difference]: With dead ends: 279 [2019-12-07 12:39:53,872 INFO L226 Difference]: Without dead ends: 157 [2019-12-07 12:39:53,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:53,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-12-07 12:39:53,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2019-12-07 12:39:53,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 12:39:53,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2019-12-07 12:39:53,879 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2019-12-07 12:39:53,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:53,879 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2019-12-07 12:39:53,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:53,879 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2019-12-07 12:39:53,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:39:53,880 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:53,881 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:53,881 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:53,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:53,881 INFO L82 PathProgramCache]: Analyzing trace with hash 881926454, now seen corresponding path program 1 times [2019-12-07 12:39:53,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:53,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597983623] [2019-12-07 12:39:53,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:53,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597983623] [2019-12-07 12:39:53,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:53,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:53,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453501241] [2019-12-07 12:39:53,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:53,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:53,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:53,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:53,940 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2019-12-07 12:39:54,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:54,133 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2019-12-07 12:39:54,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:54,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 12:39:54,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:54,135 INFO L225 Difference]: With dead ends: 277 [2019-12-07 12:39:54,135 INFO L226 Difference]: Without dead ends: 155 [2019-12-07 12:39:54,135 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:54,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-12-07 12:39:54,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2019-12-07 12:39:54,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 12:39:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2019-12-07 12:39:54,141 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2019-12-07 12:39:54,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:54,141 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2019-12-07 12:39:54,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:54,141 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2019-12-07 12:39:54,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:39:54,142 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:54,142 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:54,142 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:54,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:54,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1831274614, now seen corresponding path program 1 times [2019-12-07 12:39:54,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:54,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410199054] [2019-12-07 12:39:54,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:54,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:54,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410199054] [2019-12-07 12:39:54,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:54,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:54,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456976222] [2019-12-07 12:39:54,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:54,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:54,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:54,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:54,184 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2019-12-07 12:39:54,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:54,359 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2019-12-07 12:39:54,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:54,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 12:39:54,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:54,361 INFO L225 Difference]: With dead ends: 276 [2019-12-07 12:39:54,361 INFO L226 Difference]: Without dead ends: 154 [2019-12-07 12:39:54,362 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:54,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-07 12:39:54,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-12-07 12:39:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 12:39:54,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2019-12-07 12:39:54,368 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2019-12-07 12:39:54,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:54,368 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2019-12-07 12:39:54,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:54,368 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2019-12-07 12:39:54,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:39:54,369 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:54,369 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:54,369 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:54,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:54,369 INFO L82 PathProgramCache]: Analyzing trace with hash 376743775, now seen corresponding path program 1 times [2019-12-07 12:39:54,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:54,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279909037] [2019-12-07 12:39:54,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:54,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:54,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279909037] [2019-12-07 12:39:54,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:54,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:54,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346039828] [2019-12-07 12:39:54,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:54,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:54,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:54,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:54,419 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2019-12-07 12:39:54,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:54,613 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2019-12-07 12:39:54,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:54,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 12:39:54,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:54,614 INFO L225 Difference]: With dead ends: 276 [2019-12-07 12:39:54,614 INFO L226 Difference]: Without dead ends: 154 [2019-12-07 12:39:54,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:54,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-07 12:39:54,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-12-07 12:39:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 12:39:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2019-12-07 12:39:54,620 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2019-12-07 12:39:54,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:54,620 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2019-12-07 12:39:54,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:54,621 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2019-12-07 12:39:54,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 12:39:54,621 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:54,622 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:54,622 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:54,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:54,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1718254146, now seen corresponding path program 1 times [2019-12-07 12:39:54,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:54,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819953694] [2019-12-07 12:39:54,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:54,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819953694] [2019-12-07 12:39:54,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:54,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:54,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715743097] [2019-12-07 12:39:54,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:54,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:54,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:54,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:54,668 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2019-12-07 12:39:54,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:54,843 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2019-12-07 12:39:54,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:54,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-07 12:39:54,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:54,844 INFO L225 Difference]: With dead ends: 276 [2019-12-07 12:39:54,844 INFO L226 Difference]: Without dead ends: 154 [2019-12-07 12:39:54,844 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:54,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-07 12:39:54,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-12-07 12:39:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 12:39:54,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2019-12-07 12:39:54,848 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2019-12-07 12:39:54,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:54,848 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2019-12-07 12:39:54,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:54,848 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2019-12-07 12:39:54,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 12:39:54,849 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:54,849 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:54,849 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:54,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:54,849 INFO L82 PathProgramCache]: Analyzing trace with hash 316605892, now seen corresponding path program 1 times [2019-12-07 12:39:54,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:54,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777063179] [2019-12-07 12:39:54,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:54,884 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:54,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777063179] [2019-12-07 12:39:54,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:54,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:54,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477319537] [2019-12-07 12:39:54,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:54,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:54,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:54,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:54,886 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2019-12-07 12:39:55,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:55,072 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2019-12-07 12:39:55,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:55,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-07 12:39:55,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:55,073 INFO L225 Difference]: With dead ends: 276 [2019-12-07 12:39:55,074 INFO L226 Difference]: Without dead ends: 154 [2019-12-07 12:39:55,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:55,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-07 12:39:55,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-12-07 12:39:55,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 12:39:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2019-12-07 12:39:55,077 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2019-12-07 12:39:55,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:55,077 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2019-12-07 12:39:55,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:55,077 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2019-12-07 12:39:55,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 12:39:55,078 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:55,078 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:55,078 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:55,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:55,078 INFO L82 PathProgramCache]: Analyzing trace with hash -223613817, now seen corresponding path program 1 times [2019-12-07 12:39:55,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:55,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867447127] [2019-12-07 12:39:55,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:55,109 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:55,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867447127] [2019-12-07 12:39:55,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:55,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:55,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354692822] [2019-12-07 12:39:55,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:55,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:55,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:55,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:55,111 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2019-12-07 12:39:55,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:55,268 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2019-12-07 12:39:55,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:55,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 12:39:55,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:55,269 INFO L225 Difference]: With dead ends: 266 [2019-12-07 12:39:55,269 INFO L226 Difference]: Without dead ends: 144 [2019-12-07 12:39:55,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:55,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-12-07 12:39:55,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-12-07 12:39:55,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 12:39:55,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2019-12-07 12:39:55,272 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2019-12-07 12:39:55,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:55,273 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2019-12-07 12:39:55,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:55,273 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2019-12-07 12:39:55,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 12:39:55,273 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:55,273 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:55,273 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:55,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:55,274 INFO L82 PathProgramCache]: Analyzing trace with hash 176537583, now seen corresponding path program 1 times [2019-12-07 12:39:55,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:55,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637253979] [2019-12-07 12:39:55,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:55,307 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:55,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637253979] [2019-12-07 12:39:55,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:55,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:55,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641380656] [2019-12-07 12:39:55,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:55,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:55,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:55,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:55,309 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2019-12-07 12:39:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:55,513 INFO L93 Difference]: Finished difference Result 306 states and 460 transitions. [2019-12-07 12:39:55,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:55,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 12:39:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:55,515 INFO L225 Difference]: With dead ends: 306 [2019-12-07 12:39:55,515 INFO L226 Difference]: Without dead ends: 184 [2019-12-07 12:39:55,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:55,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-12-07 12:39:55,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-12-07 12:39:55,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 12:39:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2019-12-07 12:39:55,520 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2019-12-07 12:39:55,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:55,520 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2019-12-07 12:39:55,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:55,521 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2019-12-07 12:39:55,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 12:39:55,521 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:55,521 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:55,522 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:55,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:55,522 INFO L82 PathProgramCache]: Analyzing trace with hash 551995766, now seen corresponding path program 1 times [2019-12-07 12:39:55,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:55,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685435532] [2019-12-07 12:39:55,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:55,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685435532] [2019-12-07 12:39:55,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:55,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:55,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360335326] [2019-12-07 12:39:55,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:55,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:55,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:55,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:55,564 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2019-12-07 12:39:55,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:55,802 INFO L93 Difference]: Finished difference Result 328 states and 497 transitions. [2019-12-07 12:39:55,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:55,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 12:39:55,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:55,804 INFO L225 Difference]: With dead ends: 328 [2019-12-07 12:39:55,804 INFO L226 Difference]: Without dead ends: 184 [2019-12-07 12:39:55,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:55,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-12-07 12:39:55,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-12-07 12:39:55,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 12:39:55,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2019-12-07 12:39:55,807 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2019-12-07 12:39:55,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:55,808 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2019-12-07 12:39:55,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:55,808 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2019-12-07 12:39:55,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 12:39:55,808 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:55,808 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:55,808 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:55,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:55,809 INFO L82 PathProgramCache]: Analyzing trace with hash -475509842, now seen corresponding path program 1 times [2019-12-07 12:39:55,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:55,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076672892] [2019-12-07 12:39:55,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:55,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076672892] [2019-12-07 12:39:55,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:55,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:55,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96560008] [2019-12-07 12:39:55,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:55,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:55,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:55,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:55,838 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2019-12-07 12:39:56,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:56,046 INFO L93 Difference]: Finished difference Result 327 states and 494 transitions. [2019-12-07 12:39:56,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:56,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 12:39:56,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:56,047 INFO L225 Difference]: With dead ends: 327 [2019-12-07 12:39:56,047 INFO L226 Difference]: Without dead ends: 183 [2019-12-07 12:39:56,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:56,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-12-07 12:39:56,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 163. [2019-12-07 12:39:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 12:39:56,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2019-12-07 12:39:56,051 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2019-12-07 12:39:56,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:56,051 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2019-12-07 12:39:56,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:56,051 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2019-12-07 12:39:56,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 12:39:56,052 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:56,052 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:56,052 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:56,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:56,052 INFO L82 PathProgramCache]: Analyzing trace with hash 867683609, now seen corresponding path program 1 times [2019-12-07 12:39:56,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:56,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377342879] [2019-12-07 12:39:56,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:56,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377342879] [2019-12-07 12:39:56,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:56,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:56,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520499097] [2019-12-07 12:39:56,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:56,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:56,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:56,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:56,084 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2019-12-07 12:39:56,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:56,315 INFO L93 Difference]: Finished difference Result 325 states and 490 transitions. [2019-12-07 12:39:56,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:56,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 12:39:56,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:56,316 INFO L225 Difference]: With dead ends: 325 [2019-12-07 12:39:56,316 INFO L226 Difference]: Without dead ends: 181 [2019-12-07 12:39:56,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:56,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-12-07 12:39:56,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-12-07 12:39:56,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 12:39:56,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2019-12-07 12:39:56,320 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2019-12-07 12:39:56,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:56,320 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2019-12-07 12:39:56,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2019-12-07 12:39:56,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 12:39:56,321 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:56,321 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:56,321 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:56,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:56,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1817031769, now seen corresponding path program 1 times [2019-12-07 12:39:56,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:56,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579470944] [2019-12-07 12:39:56,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:56,351 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:56,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579470944] [2019-12-07 12:39:56,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:56,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:56,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794843890] [2019-12-07 12:39:56,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:56,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:56,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:56,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:56,352 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2019-12-07 12:39:56,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:56,588 INFO L93 Difference]: Finished difference Result 324 states and 487 transitions. [2019-12-07 12:39:56,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:56,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 12:39:56,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:56,590 INFO L225 Difference]: With dead ends: 324 [2019-12-07 12:39:56,590 INFO L226 Difference]: Without dead ends: 180 [2019-12-07 12:39:56,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:56,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-12-07 12:39:56,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-12-07 12:39:56,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 12:39:56,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2019-12-07 12:39:56,596 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2019-12-07 12:39:56,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:56,596 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2019-12-07 12:39:56,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:56,596 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-12-07 12:39:56,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 12:39:56,597 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:56,597 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:56,597 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:56,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:56,598 INFO L82 PathProgramCache]: Analyzing trace with hash 362500930, now seen corresponding path program 1 times [2019-12-07 12:39:56,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:56,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448025801] [2019-12-07 12:39:56,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:56,636 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:56,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448025801] [2019-12-07 12:39:56,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:56,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:56,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465136922] [2019-12-07 12:39:56,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:56,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:56,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:56,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:56,638 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2019-12-07 12:39:56,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:56,857 INFO L93 Difference]: Finished difference Result 324 states and 485 transitions. [2019-12-07 12:39:56,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:56,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 12:39:56,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:56,858 INFO L225 Difference]: With dead ends: 324 [2019-12-07 12:39:56,858 INFO L226 Difference]: Without dead ends: 180 [2019-12-07 12:39:56,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:56,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-12-07 12:39:56,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-12-07 12:39:56,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 12:39:56,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2019-12-07 12:39:56,864 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2019-12-07 12:39:56,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:56,864 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2019-12-07 12:39:56,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:56,864 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2019-12-07 12:39:56,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 12:39:56,864 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:56,864 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:56,865 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:56,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:56,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1276725951, now seen corresponding path program 1 times [2019-12-07 12:39:56,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:56,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840377428] [2019-12-07 12:39:56,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:56,894 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:56,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840377428] [2019-12-07 12:39:56,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:56,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:56,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545133198] [2019-12-07 12:39:56,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:56,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:56,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:56,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:56,895 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2019-12-07 12:39:57,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:57,112 INFO L93 Difference]: Finished difference Result 324 states and 483 transitions. [2019-12-07 12:39:57,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:57,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-07 12:39:57,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:57,114 INFO L225 Difference]: With dead ends: 324 [2019-12-07 12:39:57,114 INFO L226 Difference]: Without dead ends: 180 [2019-12-07 12:39:57,114 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:57,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-12-07 12:39:57,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-12-07 12:39:57,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 12:39:57,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2019-12-07 12:39:57,119 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2019-12-07 12:39:57,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:57,119 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2019-12-07 12:39:57,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:57,119 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2019-12-07 12:39:57,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 12:39:57,119 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:57,120 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:57,120 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:57,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:57,120 INFO L82 PathProgramCache]: Analyzing trace with hash -485866265, now seen corresponding path program 1 times [2019-12-07 12:39:57,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:57,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980750139] [2019-12-07 12:39:57,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:57,154 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:57,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980750139] [2019-12-07 12:39:57,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:57,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:57,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129639923] [2019-12-07 12:39:57,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:57,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:57,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:57,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:57,155 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2019-12-07 12:39:57,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:57,347 INFO L93 Difference]: Finished difference Result 324 states and 481 transitions. [2019-12-07 12:39:57,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:57,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-07 12:39:57,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:57,348 INFO L225 Difference]: With dead ends: 324 [2019-12-07 12:39:57,348 INFO L226 Difference]: Without dead ends: 180 [2019-12-07 12:39:57,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:57,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-12-07 12:39:57,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-12-07 12:39:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 12:39:57,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2019-12-07 12:39:57,351 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2019-12-07 12:39:57,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:57,352 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2019-12-07 12:39:57,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:57,352 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2019-12-07 12:39:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-07 12:39:57,352 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:57,352 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:57,352 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:57,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:57,353 INFO L82 PathProgramCache]: Analyzing trace with hash 669553092, now seen corresponding path program 1 times [2019-12-07 12:39:57,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:57,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23644162] [2019-12-07 12:39:57,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:39:57,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23644162] [2019-12-07 12:39:57,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:57,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:57,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535260301] [2019-12-07 12:39:57,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:57,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:57,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:57,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:57,383 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2019-12-07 12:39:57,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:57,560 INFO L93 Difference]: Finished difference Result 314 states and 466 transitions. [2019-12-07 12:39:57,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:57,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-12-07 12:39:57,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:57,561 INFO L225 Difference]: With dead ends: 314 [2019-12-07 12:39:57,561 INFO L226 Difference]: Without dead ends: 170 [2019-12-07 12:39:57,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:57,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-12-07 12:39:57,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2019-12-07 12:39:57,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-12-07 12:39:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2019-12-07 12:39:57,564 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2019-12-07 12:39:57,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:57,565 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2019-12-07 12:39:57,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:57,565 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2019-12-07 12:39:57,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 12:39:57,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:57,565 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:57,565 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:57,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:57,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1124223160, now seen corresponding path program 1 times [2019-12-07 12:39:57,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:57,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228468391] [2019-12-07 12:39:57,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:57,609 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:39:57,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228468391] [2019-12-07 12:39:57,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:57,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:57,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69811646] [2019-12-07 12:39:57,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:57,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:57,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:57,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:57,611 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2019-12-07 12:39:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:57,896 INFO L93 Difference]: Finished difference Result 402 states and 601 transitions. [2019-12-07 12:39:57,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:57,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-12-07 12:39:57,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:57,898 INFO L225 Difference]: With dead ends: 402 [2019-12-07 12:39:57,898 INFO L226 Difference]: Without dead ends: 258 [2019-12-07 12:39:57,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:57,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-12-07 12:39:57,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 206. [2019-12-07 12:39:57,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-12-07 12:39:57,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2019-12-07 12:39:57,901 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2019-12-07 12:39:57,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:57,902 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2019-12-07 12:39:57,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:57,902 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2019-12-07 12:39:57,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 12:39:57,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:57,902 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:57,902 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:57,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:57,903 INFO L82 PathProgramCache]: Analyzing trace with hash -2021616438, now seen corresponding path program 1 times [2019-12-07 12:39:57,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:57,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230012048] [2019-12-07 12:39:57,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:39:57,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230012048] [2019-12-07 12:39:57,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:57,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:57,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156601054] [2019-12-07 12:39:57,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:57,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:57,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:57,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:57,949 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2019-12-07 12:39:58,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:58,219 INFO L93 Difference]: Finished difference Result 442 states and 685 transitions. [2019-12-07 12:39:58,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:58,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-12-07 12:39:58,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:58,220 INFO L225 Difference]: With dead ends: 442 [2019-12-07 12:39:58,220 INFO L226 Difference]: Without dead ends: 255 [2019-12-07 12:39:58,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:58,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-12-07 12:39:58,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-12-07 12:39:58,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-12-07 12:39:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2019-12-07 12:39:58,225 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2019-12-07 12:39:58,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:58,225 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2019-12-07 12:39:58,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:58,225 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2019-12-07 12:39:58,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 12:39:58,225 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:58,226 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:58,226 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:58,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:58,226 INFO L82 PathProgramCache]: Analyzing trace with hash -344765763, now seen corresponding path program 1 times [2019-12-07 12:39:58,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:58,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271290133] [2019-12-07 12:39:58,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:58,260 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:39:58,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271290133] [2019-12-07 12:39:58,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:58,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:58,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865832782] [2019-12-07 12:39:58,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:58,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:58,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:58,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:58,262 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2019-12-07 12:39:58,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:58,565 INFO L93 Difference]: Finished difference Result 493 states and 762 transitions. [2019-12-07 12:39:58,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:58,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 12:39:58,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:58,568 INFO L225 Difference]: With dead ends: 493 [2019-12-07 12:39:58,568 INFO L226 Difference]: Without dead ends: 282 [2019-12-07 12:39:58,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:58,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-12-07 12:39:58,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2019-12-07 12:39:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-12-07 12:39:58,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2019-12-07 12:39:58,573 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2019-12-07 12:39:58,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:58,573 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2019-12-07 12:39:58,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:58,573 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2019-12-07 12:39:58,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 12:39:58,574 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:58,574 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:58,574 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:58,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:58,574 INFO L82 PathProgramCache]: Analyzing trace with hash -304091013, now seen corresponding path program 1 times [2019-12-07 12:39:58,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:58,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539439513] [2019-12-07 12:39:58,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:58,612 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:39:58,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539439513] [2019-12-07 12:39:58,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:58,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:58,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372971023] [2019-12-07 12:39:58,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:58,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:58,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:58,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:58,613 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2019-12-07 12:39:58,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:58,834 INFO L93 Difference]: Finished difference Result 466 states and 724 transitions. [2019-12-07 12:39:58,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:58,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 12:39:58,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:58,836 INFO L225 Difference]: With dead ends: 466 [2019-12-07 12:39:58,836 INFO L226 Difference]: Without dead ends: 255 [2019-12-07 12:39:58,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:58,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-12-07 12:39:58,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-12-07 12:39:58,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-12-07 12:39:58,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2019-12-07 12:39:58,840 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2019-12-07 12:39:58,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:58,840 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2019-12-07 12:39:58,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:58,840 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2019-12-07 12:39:58,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 12:39:58,841 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:58,841 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:58,841 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:58,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:58,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1789653831, now seen corresponding path program 1 times [2019-12-07 12:39:58,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:58,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488530717] [2019-12-07 12:39:58,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:39:58,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488530717] [2019-12-07 12:39:58,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:58,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:58,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157873107] [2019-12-07 12:39:58,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:58,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:58,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:58,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:58,875 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2019-12-07 12:39:59,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:59,278 INFO L93 Difference]: Finished difference Result 492 states and 757 transitions. [2019-12-07 12:39:59,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:59,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 12:39:59,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:59,280 INFO L225 Difference]: With dead ends: 492 [2019-12-07 12:39:59,280 INFO L226 Difference]: Without dead ends: 281 [2019-12-07 12:39:59,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:59,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-12-07 12:39:59,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 230. [2019-12-07 12:39:59,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-12-07 12:39:59,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2019-12-07 12:39:59,285 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2019-12-07 12:39:59,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:59,286 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2019-12-07 12:39:59,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:59,286 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2019-12-07 12:39:59,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 12:39:59,286 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:59,287 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:59,287 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:59,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:59,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1162120014, now seen corresponding path program 1 times [2019-12-07 12:39:59,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:59,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477097180] [2019-12-07 12:39:59,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:39:59,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477097180] [2019-12-07 12:39:59,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:59,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:59,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099746770] [2019-12-07 12:39:59,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:59,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:59,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:59,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:59,333 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2019-12-07 12:39:59,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:59,596 INFO L93 Difference]: Finished difference Result 490 states and 753 transitions. [2019-12-07 12:39:59,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:59,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 12:39:59,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:59,598 INFO L225 Difference]: With dead ends: 490 [2019-12-07 12:39:59,598 INFO L226 Difference]: Without dead ends: 279 [2019-12-07 12:39:59,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:59,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-07 12:39:59,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2019-12-07 12:39:59,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-12-07 12:39:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2019-12-07 12:39:59,603 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2019-12-07 12:39:59,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:59,603 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2019-12-07 12:39:59,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:59,603 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2019-12-07 12:39:59,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 12:39:59,604 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:59,604 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:59,604 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:59,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:59,605 INFO L82 PathProgramCache]: Analyzing trace with hash -212771854, now seen corresponding path program 1 times [2019-12-07 12:39:59,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:59,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213198294] [2019-12-07 12:39:59,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:39:59,644 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:39:59,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213198294] [2019-12-07 12:39:59,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:39:59,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:39:59,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932815498] [2019-12-07 12:39:59,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:39:59,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:39:59,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:39:59,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:39:59,645 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2019-12-07 12:39:59,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:39:59,943 INFO L93 Difference]: Finished difference Result 489 states and 750 transitions. [2019-12-07 12:39:59,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:39:59,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 12:39:59,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:39:59,946 INFO L225 Difference]: With dead ends: 489 [2019-12-07 12:39:59,946 INFO L226 Difference]: Without dead ends: 278 [2019-12-07 12:39:59,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:39:59,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-12-07 12:39:59,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 230. [2019-12-07 12:39:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-12-07 12:39:59,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2019-12-07 12:39:59,951 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2019-12-07 12:39:59,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:39:59,951 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2019-12-07 12:39:59,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:39:59,951 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2019-12-07 12:39:59,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 12:39:59,951 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:39:59,952 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:39:59,952 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:39:59,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:39:59,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1667302693, now seen corresponding path program 1 times [2019-12-07 12:39:59,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:39:59,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482883593] [2019-12-07 12:39:59,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:39:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:40:00,016 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 12:40:00,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482883593] [2019-12-07 12:40:00,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:40:00,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:40:00,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611044228] [2019-12-07 12:40:00,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:40:00,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:40:00,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:40:00,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:40:00,018 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2019-12-07 12:40:00,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:40:00,444 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2019-12-07 12:40:00,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:40:00,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-12-07 12:40:00,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:40:00,447 INFO L225 Difference]: With dead ends: 462 [2019-12-07 12:40:00,447 INFO L226 Difference]: Without dead ends: 251 [2019-12-07 12:40:00,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:40:00,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-12-07 12:40:00,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-12-07 12:40:00,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 12:40:00,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2019-12-07 12:40:00,455 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2019-12-07 12:40:00,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:40:00,456 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2019-12-07 12:40:00,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:40:00,456 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2019-12-07 12:40:00,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 12:40:00,457 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:40:00,457 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:40:00,457 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:40:00,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:40:00,458 INFO L82 PathProgramCache]: Analyzing trace with hash 98797236, now seen corresponding path program 1 times [2019-12-07 12:40:00,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:40:00,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654659595] [2019-12-07 12:40:00,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:40:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:40:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:40:00,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654659595] [2019-12-07 12:40:00,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:40:00,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:40:00,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109853219] [2019-12-07 12:40:00,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:40:00,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:40:00,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:40:00,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:40:00,499 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2019-12-07 12:40:00,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:40:00,702 INFO L93 Difference]: Finished difference Result 503 states and 764 transitions. [2019-12-07 12:40:00,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:40:00,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 12:40:00,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:40:00,703 INFO L225 Difference]: With dead ends: 503 [2019-12-07 12:40:00,703 INFO L226 Difference]: Without dead ends: 272 [2019-12-07 12:40:00,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:40:00,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-12-07 12:40:00,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-12-07 12:40:00,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 12:40:00,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2019-12-07 12:40:00,708 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2019-12-07 12:40:00,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:40:00,708 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2019-12-07 12:40:00,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:40:00,708 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2019-12-07 12:40:00,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 12:40:00,708 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:40:00,708 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:40:00,709 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:40:00,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:40:00,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1048145396, now seen corresponding path program 1 times [2019-12-07 12:40:00,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:40:00,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806715421] [2019-12-07 12:40:00,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:40:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:40:00,740 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:40:00,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806715421] [2019-12-07 12:40:00,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:40:00,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:40:00,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194547945] [2019-12-07 12:40:00,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:40:00,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:40:00,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:40:00,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:40:00,741 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2019-12-07 12:40:00,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:40:00,962 INFO L93 Difference]: Finished difference Result 502 states and 761 transitions. [2019-12-07 12:40:00,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:40:00,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 12:40:00,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:40:00,963 INFO L225 Difference]: With dead ends: 502 [2019-12-07 12:40:00,963 INFO L226 Difference]: Without dead ends: 271 [2019-12-07 12:40:00,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:40:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-12-07 12:40:00,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-12-07 12:40:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 12:40:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2019-12-07 12:40:00,969 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2019-12-07 12:40:00,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:40:00,969 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2019-12-07 12:40:00,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:40:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2019-12-07 12:40:00,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 12:40:00,970 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:40:00,970 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:40:00,970 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:40:00,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:40:00,971 INFO L82 PathProgramCache]: Analyzing trace with hash -645348551, now seen corresponding path program 1 times [2019-12-07 12:40:00,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:40:00,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722414667] [2019-12-07 12:40:00,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:40:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:40:01,013 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:40:01,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722414667] [2019-12-07 12:40:01,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:40:01,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:40:01,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186117268] [2019-12-07 12:40:01,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:40:01,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:40:01,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:40:01,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:40:01,015 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2019-12-07 12:40:01,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:40:01,271 INFO L93 Difference]: Finished difference Result 529 states and 795 transitions. [2019-12-07 12:40:01,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:40:01,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 12:40:01,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:40:01,273 INFO L225 Difference]: With dead ends: 529 [2019-12-07 12:40:01,273 INFO L226 Difference]: Without dead ends: 298 [2019-12-07 12:40:01,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:40:01,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-12-07 12:40:01,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2019-12-07 12:40:01,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 12:40:01,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2019-12-07 12:40:01,277 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2019-12-07 12:40:01,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:40:01,277 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2019-12-07 12:40:01,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:40:01,277 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2019-12-07 12:40:01,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 12:40:01,278 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:40:01,278 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:40:01,278 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:40:01,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:40:01,278 INFO L82 PathProgramCache]: Analyzing trace with hash -211619465, now seen corresponding path program 1 times [2019-12-07 12:40:01,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:40:01,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613427591] [2019-12-07 12:40:01,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:40:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:40:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:40:01,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613427591] [2019-12-07 12:40:01,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:40:01,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:40:01,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500463901] [2019-12-07 12:40:01,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:40:01,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:40:01,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:40:01,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:40:01,316 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2019-12-07 12:40:01,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:40:01,517 INFO L93 Difference]: Finished difference Result 502 states and 757 transitions. [2019-12-07 12:40:01,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:40:01,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 12:40:01,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:40:01,519 INFO L225 Difference]: With dead ends: 502 [2019-12-07 12:40:01,519 INFO L226 Difference]: Without dead ends: 271 [2019-12-07 12:40:01,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:40:01,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-12-07 12:40:01,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-12-07 12:40:01,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 12:40:01,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2019-12-07 12:40:01,525 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2019-12-07 12:40:01,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:40:01,525 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2019-12-07 12:40:01,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:40:01,525 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2019-12-07 12:40:01,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 12:40:01,526 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:40:01,526 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:40:01,526 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:40:01,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:40:01,527 INFO L82 PathProgramCache]: Analyzing trace with hash -300903122, now seen corresponding path program 1 times [2019-12-07 12:40:01,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:40:01,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328961441] [2019-12-07 12:40:01,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:40:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:40:01,565 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:40:01,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328961441] [2019-12-07 12:40:01,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:40:01,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:40:01,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011968263] [2019-12-07 12:40:01,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:40:01,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:40:01,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:40:01,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:40:01,567 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2019-12-07 12:40:01,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:40:01,818 INFO L93 Difference]: Finished difference Result 529 states and 791 transitions. [2019-12-07 12:40:01,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:40:01,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-07 12:40:01,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:40:01,820 INFO L225 Difference]: With dead ends: 529 [2019-12-07 12:40:01,820 INFO L226 Difference]: Without dead ends: 298 [2019-12-07 12:40:01,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:40:01,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-12-07 12:40:01,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2019-12-07 12:40:01,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 12:40:01,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2019-12-07 12:40:01,824 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2019-12-07 12:40:01,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:40:01,825 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2019-12-07 12:40:01,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:40:01,825 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2019-12-07 12:40:01,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 12:40:01,825 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:40:01,825 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:40:01,825 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:40:01,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:40:01,826 INFO L82 PathProgramCache]: Analyzing trace with hash 259796656, now seen corresponding path program 1 times [2019-12-07 12:40:01,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:40:01,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533432421] [2019-12-07 12:40:01,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:40:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:40:01,877 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:40:01,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533432421] [2019-12-07 12:40:01,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:40:01,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:40:01,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750407505] [2019-12-07 12:40:01,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:40:01,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:40:01,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:40:01,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:40:01,879 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2019-12-07 12:40:02,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:40:02,092 INFO L93 Difference]: Finished difference Result 502 states and 753 transitions. [2019-12-07 12:40:02,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:40:02,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-07 12:40:02,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:40:02,094 INFO L225 Difference]: With dead ends: 502 [2019-12-07 12:40:02,094 INFO L226 Difference]: Without dead ends: 271 [2019-12-07 12:40:02,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:40:02,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-12-07 12:40:02,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-12-07 12:40:02,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 12:40:02,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2019-12-07 12:40:02,098 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2019-12-07 12:40:02,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:40:02,098 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2019-12-07 12:40:02,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:40:02,098 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2019-12-07 12:40:02,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 12:40:02,099 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:40:02,099 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:40:02,099 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:40:02,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:40:02,099 INFO L82 PathProgramCache]: Analyzing trace with hash 584269940, now seen corresponding path program 1 times [2019-12-07 12:40:02,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:40:02,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774371036] [2019-12-07 12:40:02,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:40:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:40:02,130 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:40:02,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774371036] [2019-12-07 12:40:02,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:40:02,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:40:02,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072005081] [2019-12-07 12:40:02,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:40:02,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:40:02,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:40:02,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:40:02,132 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2019-12-07 12:40:02,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:40:02,391 INFO L93 Difference]: Finished difference Result 529 states and 787 transitions. [2019-12-07 12:40:02,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:40:02,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-12-07 12:40:02,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:40:02,393 INFO L225 Difference]: With dead ends: 529 [2019-12-07 12:40:02,393 INFO L226 Difference]: Without dead ends: 298 [2019-12-07 12:40:02,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:40:02,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-12-07 12:40:02,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 250. [2019-12-07 12:40:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 12:40:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2019-12-07 12:40:02,397 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2019-12-07 12:40:02,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:40:02,397 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2019-12-07 12:40:02,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:40:02,398 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2019-12-07 12:40:02,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 12:40:02,398 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:40:02,398 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:40:02,398 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:40:02,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:40:02,399 INFO L82 PathProgramCache]: Analyzing trace with hash 786093874, now seen corresponding path program 1 times [2019-12-07 12:40:02,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:40:02,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382980735] [2019-12-07 12:40:02,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:40:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:40:02,433 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:40:02,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382980735] [2019-12-07 12:40:02,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:40:02,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:40:02,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731155640] [2019-12-07 12:40:02,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:40:02,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:40:02,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:40:02,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:40:02,434 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2019-12-07 12:40:02,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:40:02,641 INFO L93 Difference]: Finished difference Result 502 states and 749 transitions. [2019-12-07 12:40:02,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:40:02,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-12-07 12:40:02,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:40:02,642 INFO L225 Difference]: With dead ends: 502 [2019-12-07 12:40:02,642 INFO L226 Difference]: Without dead ends: 271 [2019-12-07 12:40:02,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:40:02,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-12-07 12:40:02,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-12-07 12:40:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 12:40:02,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2019-12-07 12:40:02,646 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2019-12-07 12:40:02,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:40:02,647 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2019-12-07 12:40:02,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:40:02,647 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2019-12-07 12:40:02,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 12:40:02,647 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:40:02,647 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:40:02,647 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:40:02,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:40:02,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1052130441, now seen corresponding path program 1 times [2019-12-07 12:40:02,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:40:02,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000782817] [2019-12-07 12:40:02,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:40:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:40:02,679 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:40:02,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000782817] [2019-12-07 12:40:02,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:40:02,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:40:02,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757521235] [2019-12-07 12:40:02,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:40:02,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:40:02,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:40:02,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:40:02,680 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2019-12-07 12:40:02,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:40:02,942 INFO L93 Difference]: Finished difference Result 519 states and 771 transitions. [2019-12-07 12:40:02,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:40:02,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-07 12:40:02,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:40:02,943 INFO L225 Difference]: With dead ends: 519 [2019-12-07 12:40:02,943 INFO L226 Difference]: Without dead ends: 288 [2019-12-07 12:40:02,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:40:02,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-12-07 12:40:02,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2019-12-07 12:40:02,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 12:40:02,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2019-12-07 12:40:02,948 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2019-12-07 12:40:02,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:40:02,948 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2019-12-07 12:40:02,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:40:02,948 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2019-12-07 12:40:02,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 12:40:02,949 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:40:02,949 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:40:02,949 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:40:02,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:40:02,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1281262197, now seen corresponding path program 1 times [2019-12-07 12:40:02,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:40:02,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374753733] [2019-12-07 12:40:02,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:40:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:40:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:40:02,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374753733] [2019-12-07 12:40:02,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:40:02,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:40:02,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926726536] [2019-12-07 12:40:02,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:40:02,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:40:02,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:40:02,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:40:02,985 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2019-12-07 12:40:03,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:40:03,195 INFO L93 Difference]: Finished difference Result 492 states and 733 transitions. [2019-12-07 12:40:03,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:40:03,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-07 12:40:03,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:40:03,197 INFO L225 Difference]: With dead ends: 492 [2019-12-07 12:40:03,197 INFO L226 Difference]: Without dead ends: 261 [2019-12-07 12:40:03,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:40:03,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-12-07 12:40:03,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 250. [2019-12-07 12:40:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 12:40:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2019-12-07 12:40:03,201 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2019-12-07 12:40:03,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:40:03,201 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2019-12-07 12:40:03,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:40:03,201 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2019-12-07 12:40:03,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-07 12:40:03,202 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:40:03,202 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:40:03,202 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:40:03,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:40:03,202 INFO L82 PathProgramCache]: Analyzing trace with hash -251052971, now seen corresponding path program 1 times [2019-12-07 12:40:03,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:40:03,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145205865] [2019-12-07 12:40:03,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:40:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:40:03,236 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:40:03,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145205865] [2019-12-07 12:40:03,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:40:03,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:40:03,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799792540] [2019-12-07 12:40:03,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:40:03,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:40:03,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:40:03,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:40:03,237 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2019-12-07 12:40:03,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:40:03,503 INFO L93 Difference]: Finished difference Result 519 states and 767 transitions. [2019-12-07 12:40:03,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:40:03,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-12-07 12:40:03,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:40:03,504 INFO L225 Difference]: With dead ends: 519 [2019-12-07 12:40:03,504 INFO L226 Difference]: Without dead ends: 288 [2019-12-07 12:40:03,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:40:03,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-12-07 12:40:03,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 250. [2019-12-07 12:40:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 12:40:03,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2019-12-07 12:40:03,510 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2019-12-07 12:40:03,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:40:03,510 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2019-12-07 12:40:03,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:40:03,510 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2019-12-07 12:40:03,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-07 12:40:03,511 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:40:03,511 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:40:03,511 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:40:03,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:40:03,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1937232809, now seen corresponding path program 1 times [2019-12-07 12:40:03,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:40:03,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730274564] [2019-12-07 12:40:03,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:40:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:40:03,552 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 12:40:03,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730274564] [2019-12-07 12:40:03,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:40:03,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:40:03,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082223220] [2019-12-07 12:40:03,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:40:03,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:40:03,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:40:03,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:40:03,554 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2019-12-07 12:40:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:40:03,579 INFO L93 Difference]: Finished difference Result 710 states and 1059 transitions. [2019-12-07 12:40:03,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:40:03,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-12-07 12:40:03,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:40:03,582 INFO L225 Difference]: With dead ends: 710 [2019-12-07 12:40:03,582 INFO L226 Difference]: Without dead ends: 479 [2019-12-07 12:40:03,582 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-12-07 12:40:03,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-12-07 12:40:03,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-12-07 12:40:03,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-12-07 12:40:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 711 transitions. [2019-12-07 12:40:03,596 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 711 transitions. Word has length 106 [2019-12-07 12:40:03,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:40:03,596 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 711 transitions. [2019-12-07 12:40:03,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:40:03,596 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 711 transitions. [2019-12-07 12:40:03,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-12-07 12:40:03,598 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:40:03,598 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-07 12:40:03,598 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:40:03,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:40:03,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1707028326, now seen corresponding path program 1 times [2019-12-07 12:40:03,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:40:03,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110619278] [2019-12-07 12:40:03,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:40:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:40:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:40:03,775 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:40:03,775 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:40:03,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:40:03 BoogieIcfgContainer [2019-12-07 12:40:03,850 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:40:03,850 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:40:03,850 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:40:03,850 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:40:03,851 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:39:52" (3/4) ... [2019-12-07 12:40:03,853 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 12:40:03,853 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:40:03,855 INFO L168 Benchmark]: Toolchain (without parser) took 12520.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 310.4 MB). Free memory was 937.1 MB in the beginning and 1.3 GB in the end (delta: -344.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:40:03,855 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:40:03,855 INFO L168 Benchmark]: CACSL2BoogieTranslator took 459.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -134.3 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:40:03,855 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:40:03,856 INFO L168 Benchmark]: Boogie Preprocessor took 68.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:40:03,856 INFO L168 Benchmark]: RCFGBuilder took 678.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 969.0 MB in the end (delta: 91.7 MB). Peak memory consumption was 91.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:40:03,856 INFO L168 Benchmark]: TraceAbstraction took 11241.25 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 210.8 MB). Free memory was 969.0 MB in the beginning and 1.3 GB in the end (delta: -312.1 MB). Peak memory consumption was 379.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:40:03,856 INFO L168 Benchmark]: Witness Printer took 3.35 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:40:03,857 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 459.83 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -134.3 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 678.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 969.0 MB in the end (delta: 91.7 MB). Peak memory consumption was 91.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11241.25 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 210.8 MB). Free memory was 969.0 MB in the beginning and 1.3 GB in the end (delta: -312.1 MB). Peak memory consumption was 379.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.35 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1702]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={9:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={9:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={9:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={9:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={9:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={9:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={9:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={9:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1229] COND TRUE s->state == 8656 [L1550] EXPR s->session [L1550] EXPR s->s3 [L1550] EXPR (s->s3)->tmp.new_cipher [L1550] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1551] COND FALSE !(! tmp___9) [L1557] ret = __VERIFIER_nondet_int() [L1558] COND TRUE blastFlag == 2 [L1559] blastFlag = 4 VAL [init=1, SSLv3_server_data={9:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={9:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={9:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={9:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={9:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={9:0}] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={9:0}] [L1702] __VERIFIER_error() VAL [init=1, SSLv3_server_data={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 11.1s, OverallIterations: 39, TraceHistogramMax: 4, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7075 SDtfs, 2083 SDslu, 10603 SDs, 0 SdLazy, 6863 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 76 SyntacticMatches, 29 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 38 MinimizatonAttempts, 914 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 3288 NumberOfCodeBlocks, 3288 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3125 ConstructedInterpolants, 0 QuantifiedInterpolants, 733119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 1564/1564 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.25-f470102 [2019-12-07 12:40:05,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:40:05,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:40:05,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:40:05,343 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:40:05,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:40:05,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:40:05,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:40:05,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:40:05,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:40:05,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:40:05,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:40:05,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:40:05,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:40:05,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:40:05,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:40:05,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:40:05,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:40:05,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:40:05,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:40:05,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:40:05,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:40:05,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:40:05,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:40:05,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:40:05,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:40:05,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:40:05,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:40:05,367 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:40:05,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:40:05,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:40:05,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:40:05,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:40:05,369 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:40:05,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:40:05,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:40:05,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:40:05,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:40:05,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:40:05,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:40:05,372 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:40:05,372 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 12:40:05,385 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:40:05,385 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:40:05,386 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:40:05,386 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:40:05,387 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:40:05,387 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:40:05,387 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:40:05,387 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:40:05,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:40:05,388 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:40:05,388 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:40:05,388 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:40:05,388 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 12:40:05,388 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 12:40:05,388 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:40:05,389 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:40:05,389 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:40:05,389 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:40:05,389 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:40:05,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:40:05,390 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:40:05,390 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:40:05,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:40:05,390 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:40:05,390 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:40:05,391 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:40:05,391 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 12:40:05,391 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 12:40:05,391 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:40:05,391 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:40:05,392 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:40:05,392 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_7a71b520-29fa-4a2c-8ead-7c410af69be7/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 -> a85198d3f93b8c751f2c6e712deab62f97c1022f [2019-12-07 12:40:05,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:40:05,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:40:05,585 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:40:05,586 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:40:05,586 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:40:05,586 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-12-07 12:40:05,625 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/bin/uautomizer/data/d272d7a33/cc46fce2612e4721bb624de62603dfd3/FLAG430f77aff [2019-12-07 12:40:06,183 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:40:06,184 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-12-07 12:40:06,196 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/bin/uautomizer/data/d272d7a33/cc46fce2612e4721bb624de62603dfd3/FLAG430f77aff [2019-12-07 12:40:06,611 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/bin/uautomizer/data/d272d7a33/cc46fce2612e4721bb624de62603dfd3 [2019-12-07 12:40:06,613 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:40:06,614 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:40:06,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:40:06,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:40:06,617 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:40:06,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:40:06" (1/1) ... [2019-12-07 12:40:06,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a94c128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:40:06, skipping insertion in model container [2019-12-07 12:40:06,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:40:06" (1/1) ... [2019-12-07 12:40:06,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:40:06,665 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:40:06,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:40:06,961 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:40:07,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:40:07,046 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:40:07,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:40:07 WrapperNode [2019-12-07 12:40:07,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:40:07,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:40:07,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:40:07,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:40:07,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:40:07" (1/1) ... [2019-12-07 12:40:07,072 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:40:07" (1/1) ... [2019-12-07 12:40:07,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:40:07,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:40:07,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:40:07,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:40:07,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:40:07" (1/1) ... [2019-12-07 12:40:07,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:40:07" (1/1) ... [2019-12-07 12:40:07,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:40:07" (1/1) ... [2019-12-07 12:40:07,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:40:07" (1/1) ... [2019-12-07 12:40:07,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:40:07" (1/1) ... [2019-12-07 12:40:07,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:40:07" (1/1) ... [2019-12-07 12:40:07,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:40:07" (1/1) ... [2019-12-07 12:40:07,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:40:07,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:40:07,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:40:07,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:40:07,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:40:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/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-12-07 12:40:07,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 12:40:07,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:40:07,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 12:40:07,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 12:40:07,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 12:40:07,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:40:07,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:40:07,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 12:40:07,326 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:40:09,311 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 12:40:09,311 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 12:40:09,312 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:40:09,312 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 12:40:09,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:40:09 BoogieIcfgContainer [2019-12-07 12:40:09,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:40:09,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:40:09,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:40:09,316 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:40:09,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:40:06" (1/3) ... [2019-12-07 12:40:09,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2609f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:40:09, skipping insertion in model container [2019-12-07 12:40:09,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:40:07" (2/3) ... [2019-12-07 12:40:09,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2609f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:40:09, skipping insertion in model container [2019-12-07 12:40:09,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:40:09" (3/3) ... [2019-12-07 12:40:09,319 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2019-12-07 12:40:09,326 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:40:09,331 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 12:40:09,339 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 12:40:09,356 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:40:09,356 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:40:09,357 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:40:09,357 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:40:09,357 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:40:09,357 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:40:09,357 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:40:09,357 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:40:09,371 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-12-07 12:40:09,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 12:40:09,378 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:40:09,379 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:40:09,379 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:40:09,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:40:09,383 INFO L82 PathProgramCache]: Analyzing trace with hash 522836684, now seen corresponding path program 1 times [2019-12-07 12:40:09,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:40:09,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193423065] [2019-12-07 12:40:09,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 12:40:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:40:09,527 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:40:09,535 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:40:09,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:40:09,576 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:40:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:40:09,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193423065] [2019-12-07 12:40:09,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:40:09,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 12:40:09,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835628544] [2019-12-07 12:40:09,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:40:09,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:40:09,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:40:09,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:40:09,620 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-12-07 12:40:09,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:40:09,712 INFO L93 Difference]: Finished difference Result 540 states and 917 transitions. [2019-12-07 12:40:09,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:40:09,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 12:40:09,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:40:09,729 INFO L225 Difference]: With dead ends: 540 [2019-12-07 12:40:09,730 INFO L226 Difference]: Without dead ends: 366 [2019-12-07 12:40:09,733 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 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-12-07 12:40:09,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-12-07 12:40:09,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2019-12-07 12:40:09,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-12-07 12:40:09,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 556 transitions. [2019-12-07 12:40:09,784 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 556 transitions. Word has length 45 [2019-12-07 12:40:09,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:40:09,784 INFO L462 AbstractCegarLoop]: Abstraction has 366 states and 556 transitions. [2019-12-07 12:40:09,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:40:09,785 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 556 transitions. [2019-12-07 12:40:09,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-07 12:40:09,789 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:40:09,789 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:40:09,990 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 12:40:09,991 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:40:09,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:40:09,992 INFO L82 PathProgramCache]: Analyzing trace with hash 577204179, now seen corresponding path program 1 times [2019-12-07 12:40:09,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:40:09,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802073330] [2019-12-07 12:40:09,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 12:40:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:40:10,231 INFO L264 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:40:10,235 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:40:10,265 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:40:10,265 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:40:10,293 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:40:10,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802073330] [2019-12-07 12:40:10,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:40:10,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 12:40:10,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100676933] [2019-12-07 12:40:10,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:40:10,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:40:10,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:40:10,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:40:10,295 INFO L87 Difference]: Start difference. First operand 366 states and 556 transitions. Second operand 4 states. [2019-12-07 12:40:11,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:40:11,064 INFO L93 Difference]: Finished difference Result 839 states and 1282 transitions. [2019-12-07 12:40:11,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:40:11,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-07 12:40:11,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:40:11,069 INFO L225 Difference]: With dead ends: 839 [2019-12-07 12:40:11,069 INFO L226 Difference]: Without dead ends: 600 [2019-12-07 12:40:11,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 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-12-07 12:40:11,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-12-07 12:40:11,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2019-12-07 12:40:11,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-12-07 12:40:11,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 910 transitions. [2019-12-07 12:40:11,108 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 910 transitions. Word has length 103 [2019-12-07 12:40:11,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:40:11,108 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 910 transitions. [2019-12-07 12:40:11,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:40:11,109 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 910 transitions. [2019-12-07 12:40:11,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-12-07 12:40:11,112 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:40:11,112 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12-07 12:40:11,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 12:40:11,313 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:40:11,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:40:11,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1707028326, now seen corresponding path program 1 times [2019-12-07 12:40:11,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:40:11,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814299886] [2019-12-07 12:40:11,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 12:40:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:40:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:40:12,067 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-12-07 12:40:12,068 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:40:12,268 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 12:40:12,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:40:12 BoogieIcfgContainer [2019-12-07 12:40:12,396 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:40:12,397 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:40:12,397 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:40:12,397 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:40:12,397 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:40:09" (3/4) ... [2019-12-07 12:40:12,399 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:40:12,508 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7a71b520-29fa-4a2c-8ead-7c410af69be7/bin/uautomizer/witness.graphml [2019-12-07 12:40:12,509 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:40:12,510 INFO L168 Benchmark]: Toolchain (without parser) took 5895.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.8 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:40:12,511 INFO L168 Benchmark]: CDTParser took 0.14 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-12-07 12:40:12,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 431.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:40:12,511 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-12-07 12:40:12,512 INFO L168 Benchmark]: Boogie Preprocessor took 52.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-12-07 12:40:12,512 INFO L168 Benchmark]: RCFGBuilder took 2157.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 996.1 MB in the end (delta: 89.9 MB). Peak memory consumption was 89.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:40:12,512 INFO L168 Benchmark]: TraceAbstraction took 3082.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 996.1 MB in the beginning and 1.1 GB in the end (delta: -144.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:40:12,513 INFO L168 Benchmark]: Witness Printer took 111.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:40:12,514 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 431.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2157.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 996.1 MB in the end (delta: 89.9 MB). Peak memory consumption was 89.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3082.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 996.1 MB in the beginning and 1.1 GB in the end (delta: -144.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 111.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1702]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={15:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={15:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={15:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={15:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={15:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={15:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={15:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={15:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1229] COND TRUE s->state == 8656 [L1550] EXPR s->session [L1550] EXPR s->s3 [L1550] EXPR (s->s3)->tmp.new_cipher [L1550] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1551] COND FALSE !(! tmp___9) [L1557] ret = __VERIFIER_nondet_int() [L1558] COND TRUE blastFlag == 2 [L1559] blastFlag = 4 VAL [init=1, SSLv3_server_data={15:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={15:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={15:0}] [L1702] __VERIFIER_error() VAL [init=1, SSLv3_server_data={15:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 2.9s, OverallIterations: 3, TraceHistogramMax: 4, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 587 SDtfs, 659 SDslu, 792 SDs, 0 SdLazy, 51 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=600occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 74336 SizeOfPredicates, 1 NumberOfNonLiveVariables, 399 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 116/116 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...