./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/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 9eb992f5fc2d1a4c635ca3f801d15ea699dd32d7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/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 9eb992f5fc2d1a4c635ca3f801d15ea699dd32d7 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:15:18,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:15:18,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:15:18,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:15:18,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:15:18,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:15:18,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:15:18,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:15:18,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:15:18,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:15:18,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:15:18,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:15:18,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:15:18,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:15:18,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:15:18,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:15:18,110 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:15:18,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:15:18,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:15:18,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:15:18,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:15:18,128 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:15:18,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:15:18,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:15:18,137 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:15:18,138 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:15:18,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:15:18,140 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:15:18,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:15:18,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:15:18,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:15:18,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:15:18,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:15:18,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:15:18,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:15:18,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:15:18,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:15:18,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:15:18,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:15:18,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:15:18,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:15:18,152 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:15:18,183 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:15:18,196 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:15:18,197 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:15:18,198 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:15:18,198 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:15:18,199 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:15:18,199 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:15:18,199 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:15:18,199 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:15:18,200 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:15:18,200 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:15:18,200 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:15:18,201 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:15:18,201 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:15:18,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:15:18,202 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:15:18,202 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:15:18,202 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:15:18,203 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:15:18,203 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:15:18,203 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:15:18,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:15:18,204 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:15:18,204 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:15:18,204 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:15:18,205 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:15:18,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:15:18,205 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:15:18,206 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_a3071cb6-dec9-4902-bff6-3f099b61aa99/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 -> 9eb992f5fc2d1a4c635ca3f801d15ea699dd32d7 [2019-11-15 22:15:18,250 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:15:18,269 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:15:18,272 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:15:18,274 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:15:18,275 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:15:18,276 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-11-15 22:15:18,366 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/data/94958fc0d/73754c556fb7409fa89abf760a62e813/FLAG00a8f3be1 [2019-11-15 22:15:19,093 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:15:19,099 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-11-15 22:15:19,129 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/data/94958fc0d/73754c556fb7409fa89abf760a62e813/FLAG00a8f3be1 [2019-11-15 22:15:19,196 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/data/94958fc0d/73754c556fb7409fa89abf760a62e813 [2019-11-15 22:15:19,199 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:15:19,201 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:15:19,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:15:19,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:15:19,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:15:19,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:15:19" (1/1) ... [2019-11-15 22:15:19,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29c0ac92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:19, skipping insertion in model container [2019-11-15 22:15:19,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:15:19" (1/1) ... [2019-11-15 22:15:19,219 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:15:19,307 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:15:19,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:15:19,985 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:15:20,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:15:20,238 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:15:20,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:20 WrapperNode [2019-11-15 22:15:20,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:15:20,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:15:20,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:15:20,240 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:15:20,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:20" (1/1) ... [2019-11-15 22:15:20,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:20" (1/1) ... [2019-11-15 22:15:20,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:15:20,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:15:20,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:15:20,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:15:20,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:20" (1/1) ... [2019-11-15 22:15:20,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:20" (1/1) ... [2019-11-15 22:15:20,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:20" (1/1) ... [2019-11-15 22:15:20,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:20" (1/1) ... [2019-11-15 22:15:20,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:20" (1/1) ... [2019-11-15 22:15:20,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:20" (1/1) ... [2019-11-15 22:15:20,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:20" (1/1) ... [2019-11-15 22:15:20,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:15:20,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:15:20,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:15:20,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:15:20,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:15:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:15:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:15:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:15:20,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:15:20,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:15:20,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:15:20,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:15:20,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:15:20,829 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:15:21,962 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 22:15:21,963 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 22:15:21,965 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:15:21,965 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:15:21,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:15:21 BoogieIcfgContainer [2019-11-15 22:15:21,967 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:15:21,968 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:15:21,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:15:21,972 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:15:21,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:15:19" (1/3) ... [2019-11-15 22:15:21,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c443ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:15:21, skipping insertion in model container [2019-11-15 22:15:21,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:20" (2/3) ... [2019-11-15 22:15:21,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c443ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:15:21, skipping insertion in model container [2019-11-15 22:15:21,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:15:21" (3/3) ... [2019-11-15 22:15:21,981 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2019-11-15 22:15:21,998 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:15:22,011 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:15:22,030 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:15:22,068 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:15:22,068 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:15:22,068 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:15:22,069 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:15:22,069 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:15:22,069 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:15:22,069 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:15:22,069 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:15:22,099 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-11-15 22:15:22,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 22:15:22,118 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:22,119 INFO L380 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-11-15 22:15:22,122 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:22,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:22,128 INFO L82 PathProgramCache]: Analyzing trace with hash 522834703, now seen corresponding path program 1 times [2019-11-15 22:15:22,138 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:22,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863121862] [2019-11-15 22:15:22,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:22,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:22,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:22,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:22,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863121862] [2019-11-15 22:15:22,593 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:22,594 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:22,594 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795770971] [2019-11-15 22:15:22,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:22,602 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:22,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:22,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:22,621 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 4 states. [2019-11-15 22:15:23,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:23,249 INFO L93 Difference]: Finished difference Result 317 states and 530 transitions. [2019-11-15 22:15:23,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:23,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-15 22:15:23,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:23,278 INFO L225 Difference]: With dead ends: 317 [2019-11-15 22:15:23,279 INFO L226 Difference]: Without dead ends: 160 [2019-11-15 22:15:23,286 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:23,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-15 22:15:23,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2019-11-15 22:15:23,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-15 22:15:23,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 219 transitions. [2019-11-15 22:15:23,373 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 219 transitions. Word has length 45 [2019-11-15 22:15:23,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:23,374 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 219 transitions. [2019-11-15 22:15:23,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:23,374 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 219 transitions. [2019-11-15 22:15:23,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 22:15:23,377 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:23,378 INFO L380 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-11-15 22:15:23,378 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:23,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:23,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1923702817, now seen corresponding path program 1 times [2019-11-15 22:15:23,379 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:23,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145613970] [2019-11-15 22:15:23,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:23,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:23,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:23,537 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:23,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145613970] [2019-11-15 22:15:23,539 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:23,539 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:23,539 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050062165] [2019-11-15 22:15:23,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:23,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:23,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:23,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:23,543 INFO L87 Difference]: Start difference. First operand 143 states and 219 transitions. Second operand 4 states. [2019-11-15 22:15:24,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:24,061 INFO L93 Difference]: Finished difference Result 284 states and 429 transitions. [2019-11-15 22:15:24,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:24,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-15 22:15:24,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:24,065 INFO L225 Difference]: With dead ends: 284 [2019-11-15 22:15:24,065 INFO L226 Difference]: Without dead ends: 160 [2019-11-15 22:15:24,067 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:24,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-15 22:15:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2019-11-15 22:15:24,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-15 22:15:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 218 transitions. [2019-11-15 22:15:24,098 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 218 transitions. Word has length 58 [2019-11-15 22:15:24,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:24,099 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 218 transitions. [2019-11-15 22:15:24,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:24,100 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 218 transitions. [2019-11-15 22:15:24,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 22:15:24,108 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:24,109 INFO L380 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-11-15 22:15:24,109 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:24,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:24,110 INFO L82 PathProgramCache]: Analyzing trace with hash -2009873572, now seen corresponding path program 1 times [2019-11-15 22:15:24,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:24,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161277828] [2019-11-15 22:15:24,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:24,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:24,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:24,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:24,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161277828] [2019-11-15 22:15:24,299 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:24,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:24,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705900355] [2019-11-15 22:15:24,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:24,300 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:24,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:24,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:24,301 INFO L87 Difference]: Start difference. First operand 143 states and 218 transitions. Second operand 4 states. [2019-11-15 22:15:24,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:24,772 INFO L93 Difference]: Finished difference Result 282 states and 426 transitions. [2019-11-15 22:15:24,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:24,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 22:15:24,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:24,776 INFO L225 Difference]: With dead ends: 282 [2019-11-15 22:15:24,776 INFO L226 Difference]: Without dead ends: 158 [2019-11-15 22:15:24,777 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:24,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-15 22:15:24,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 143. [2019-11-15 22:15:24,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-15 22:15:24,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 217 transitions. [2019-11-15 22:15:24,802 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 217 transitions. Word has length 59 [2019-11-15 22:15:24,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:24,803 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 217 transitions. [2019-11-15 22:15:24,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:24,803 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 217 transitions. [2019-11-15 22:15:24,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 22:15:24,805 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:24,805 INFO L380 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-11-15 22:15:24,805 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:24,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:24,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1439655328, now seen corresponding path program 1 times [2019-11-15 22:15:24,806 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:24,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726887516] [2019-11-15 22:15:24,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:24,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:24,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:24,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:24,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726887516] [2019-11-15 22:15:24,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:24,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:24,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303827377] [2019-11-15 22:15:24,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:24,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:24,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:24,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:24,903 INFO L87 Difference]: Start difference. First operand 143 states and 217 transitions. Second operand 4 states. [2019-11-15 22:15:25,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:25,421 INFO L93 Difference]: Finished difference Result 281 states and 424 transitions. [2019-11-15 22:15:25,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:25,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 22:15:25,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:25,423 INFO L225 Difference]: With dead ends: 281 [2019-11-15 22:15:25,423 INFO L226 Difference]: Without dead ends: 157 [2019-11-15 22:15:25,425 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:25,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-15 22:15:25,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 143. [2019-11-15 22:15:25,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-15 22:15:25,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 216 transitions. [2019-11-15 22:15:25,444 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 216 transitions. Word has length 59 [2019-11-15 22:15:25,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:25,447 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 216 transitions. [2019-11-15 22:15:25,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:25,447 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 216 transitions. [2019-11-15 22:15:25,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 22:15:25,453 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:25,453 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:15:25,453 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:25,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:25,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1630534542, now seen corresponding path program 1 times [2019-11-15 22:15:25,454 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:25,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570074027] [2019-11-15 22:15:25,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:25,455 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:25,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:25,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:25,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570074027] [2019-11-15 22:15:25,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:25,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:25,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764671377] [2019-11-15 22:15:25,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:25,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:25,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:25,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:25,574 INFO L87 Difference]: Start difference. First operand 143 states and 216 transitions. Second operand 4 states. [2019-11-15 22:15:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:25,999 INFO L93 Difference]: Finished difference Result 280 states and 422 transitions. [2019-11-15 22:15:26,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:26,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 22:15:26,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:26,002 INFO L225 Difference]: With dead ends: 280 [2019-11-15 22:15:26,002 INFO L226 Difference]: Without dead ends: 156 [2019-11-15 22:15:26,003 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:26,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-15 22:15:26,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-11-15 22:15:26,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-15 22:15:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 215 transitions. [2019-11-15 22:15:26,012 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 215 transitions. Word has length 60 [2019-11-15 22:15:26,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:26,013 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 215 transitions. [2019-11-15 22:15:26,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:26,013 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 215 transitions. [2019-11-15 22:15:26,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 22:15:26,014 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:26,015 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:15:26,015 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:26,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:26,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1839064698, now seen corresponding path program 1 times [2019-11-15 22:15:26,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:26,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957657891] [2019-11-15 22:15:26,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:26,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:26,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:26,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:26,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957657891] [2019-11-15 22:15:26,088 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:26,089 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:26,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65698791] [2019-11-15 22:15:26,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:26,090 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:26,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:26,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:26,091 INFO L87 Difference]: Start difference. First operand 143 states and 215 transitions. Second operand 4 states. [2019-11-15 22:15:26,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:26,518 INFO L93 Difference]: Finished difference Result 280 states and 421 transitions. [2019-11-15 22:15:26,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:26,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 22:15:26,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:26,525 INFO L225 Difference]: With dead ends: 280 [2019-11-15 22:15:26,526 INFO L226 Difference]: Without dead ends: 156 [2019-11-15 22:15:26,526 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:26,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-15 22:15:26,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-11-15 22:15:26,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-15 22:15:26,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2019-11-15 22:15:26,544 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 60 [2019-11-15 22:15:26,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:26,544 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2019-11-15 22:15:26,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:26,544 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2019-11-15 22:15:26,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 22:15:26,555 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:26,556 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:15:26,556 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:26,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:26,557 INFO L82 PathProgramCache]: Analyzing trace with hash 476213239, now seen corresponding path program 1 times [2019-11-15 22:15:26,557 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:26,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807912521] [2019-11-15 22:15:26,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:26,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:26,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:26,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:26,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807912521] [2019-11-15 22:15:26,648 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:26,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:26,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323234778] [2019-11-15 22:15:26,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:26,650 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:26,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:26,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:26,651 INFO L87 Difference]: Start difference. First operand 143 states and 214 transitions. Second operand 4 states. [2019-11-15 22:15:27,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:27,005 INFO L93 Difference]: Finished difference Result 280 states and 420 transitions. [2019-11-15 22:15:27,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:27,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-15 22:15:27,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:27,007 INFO L225 Difference]: With dead ends: 280 [2019-11-15 22:15:27,007 INFO L226 Difference]: Without dead ends: 156 [2019-11-15 22:15:27,008 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:27,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-15 22:15:27,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-11-15 22:15:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-15 22:15:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 213 transitions. [2019-11-15 22:15:27,014 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 213 transitions. Word has length 61 [2019-11-15 22:15:27,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:27,015 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 213 transitions. [2019-11-15 22:15:27,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:27,015 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2019-11-15 22:15:27,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 22:15:27,016 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:27,016 INFO L380 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, 1] [2019-11-15 22:15:27,016 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:27,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:27,017 INFO L82 PathProgramCache]: Analyzing trace with hash -25209675, now seen corresponding path program 1 times [2019-11-15 22:15:27,017 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:27,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461017800] [2019-11-15 22:15:27,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:27,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:27,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:27,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:27,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461017800] [2019-11-15 22:15:27,109 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:27,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:27,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995201396] [2019-11-15 22:15:27,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:27,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:27,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:27,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:27,112 INFO L87 Difference]: Start difference. First operand 143 states and 213 transitions. Second operand 4 states. [2019-11-15 22:15:27,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:27,484 INFO L93 Difference]: Finished difference Result 280 states and 419 transitions. [2019-11-15 22:15:27,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:27,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-15 22:15:27,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:27,486 INFO L225 Difference]: With dead ends: 280 [2019-11-15 22:15:27,486 INFO L226 Difference]: Without dead ends: 156 [2019-11-15 22:15:27,487 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:27,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-15 22:15:27,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2019-11-15 22:15:27,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-15 22:15:27,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 212 transitions. [2019-11-15 22:15:27,493 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 212 transitions. Word has length 62 [2019-11-15 22:15:27,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:27,495 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 212 transitions. [2019-11-15 22:15:27,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:27,496 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 212 transitions. [2019-11-15 22:15:27,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 22:15:27,497 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:27,497 INFO L380 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-11-15 22:15:27,498 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:27,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:27,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1383513241, now seen corresponding path program 1 times [2019-11-15 22:15:27,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:27,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892216814] [2019-11-15 22:15:27,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:27,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:27,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:27,623 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:27,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892216814] [2019-11-15 22:15:27,624 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:27,624 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:27,625 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548118306] [2019-11-15 22:15:27,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:27,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:27,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:27,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:27,626 INFO L87 Difference]: Start difference. First operand 143 states and 212 transitions. Second operand 4 states. [2019-11-15 22:15:28,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:28,026 INFO L93 Difference]: Finished difference Result 310 states and 467 transitions. [2019-11-15 22:15:28,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:28,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-15 22:15:28,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:28,028 INFO L225 Difference]: With dead ends: 310 [2019-11-15 22:15:28,028 INFO L226 Difference]: Without dead ends: 186 [2019-11-15 22:15:28,029 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:28,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-15 22:15:28,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2019-11-15 22:15:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-15 22:15:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 250 transitions. [2019-11-15 22:15:28,037 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 250 transitions. Word has length 62 [2019-11-15 22:15:28,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:28,037 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 250 transitions. [2019-11-15 22:15:28,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:28,038 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 250 transitions. [2019-11-15 22:15:28,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 22:15:28,039 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:28,039 INFO L380 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, 1] [2019-11-15 22:15:28,039 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:28,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:28,040 INFO L82 PathProgramCache]: Analyzing trace with hash 407848530, now seen corresponding path program 1 times [2019-11-15 22:15:28,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:28,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001892891] [2019-11-15 22:15:28,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:28,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:28,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:28,106 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:28,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001892891] [2019-11-15 22:15:28,107 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:28,107 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:28,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514594670] [2019-11-15 22:15:28,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:28,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:28,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:28,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:28,109 INFO L87 Difference]: Start difference. First operand 165 states and 250 transitions. Second operand 4 states. [2019-11-15 22:15:28,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:28,396 INFO L93 Difference]: Finished difference Result 314 states and 481 transitions. [2019-11-15 22:15:28,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:28,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-15 22:15:28,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:28,398 INFO L225 Difference]: With dead ends: 314 [2019-11-15 22:15:28,398 INFO L226 Difference]: Without dead ends: 168 [2019-11-15 22:15:28,399 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:28,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-15 22:15:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2019-11-15 22:15:28,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-15 22:15:28,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 249 transitions. [2019-11-15 22:15:28,405 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 249 transitions. Word has length 63 [2019-11-15 22:15:28,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:28,405 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 249 transitions. [2019-11-15 22:15:28,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:28,406 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 249 transitions. [2019-11-15 22:15:28,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 22:15:28,407 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:28,407 INFO L380 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-11-15 22:15:28,407 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:28,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:28,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1281685867, now seen corresponding path program 1 times [2019-11-15 22:15:28,408 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:28,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261596242] [2019-11-15 22:15:28,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:28,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:28,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:28,475 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:28,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261596242] [2019-11-15 22:15:28,476 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:28,476 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:28,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312181382] [2019-11-15 22:15:28,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:28,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:28,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:28,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:28,478 INFO L87 Difference]: Start difference. First operand 165 states and 249 transitions. Second operand 4 states. [2019-11-15 22:15:28,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:28,882 INFO L93 Difference]: Finished difference Result 332 states and 503 transitions. [2019-11-15 22:15:28,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:28,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-15 22:15:28,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:28,885 INFO L225 Difference]: With dead ends: 332 [2019-11-15 22:15:28,885 INFO L226 Difference]: Without dead ends: 186 [2019-11-15 22:15:28,886 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:28,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-15 22:15:28,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2019-11-15 22:15:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-15 22:15:28,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 248 transitions. [2019-11-15 22:15:28,894 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 248 transitions. Word has length 75 [2019-11-15 22:15:28,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:28,895 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 248 transitions. [2019-11-15 22:15:28,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:28,895 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 248 transitions. [2019-11-15 22:15:28,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 22:15:28,897 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:28,897 INFO L380 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-11-15 22:15:28,897 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:28,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:28,898 INFO L82 PathProgramCache]: Analyzing trace with hash 712782694, now seen corresponding path program 1 times [2019-11-15 22:15:28,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:28,899 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295268348] [2019-11-15 22:15:28,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:28,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:28,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:29,000 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:29,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295268348] [2019-11-15 22:15:29,000 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:29,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:29,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554894805] [2019-11-15 22:15:29,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:29,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:29,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:29,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:29,003 INFO L87 Difference]: Start difference. First operand 165 states and 248 transitions. Second operand 4 states. [2019-11-15 22:15:29,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:29,466 INFO L93 Difference]: Finished difference Result 330 states and 499 transitions. [2019-11-15 22:15:29,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:29,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 22:15:29,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:29,468 INFO L225 Difference]: With dead ends: 330 [2019-11-15 22:15:29,468 INFO L226 Difference]: Without dead ends: 184 [2019-11-15 22:15:29,469 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:29,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-15 22:15:29,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 165. [2019-11-15 22:15:29,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-15 22:15:29,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 247 transitions. [2019-11-15 22:15:29,478 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 247 transitions. Word has length 76 [2019-11-15 22:15:29,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:29,478 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 247 transitions. [2019-11-15 22:15:29,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:29,479 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 247 transitions. [2019-11-15 22:15:29,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 22:15:29,480 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:29,480 INFO L380 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-11-15 22:15:29,480 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:29,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:29,481 INFO L82 PathProgramCache]: Analyzing trace with hash -132655702, now seen corresponding path program 1 times [2019-11-15 22:15:29,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:29,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862509562] [2019-11-15 22:15:29,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:29,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:29,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:29,577 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:29,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862509562] [2019-11-15 22:15:29,577 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:29,578 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:29,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290757482] [2019-11-15 22:15:29,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:29,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:29,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:29,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:29,583 INFO L87 Difference]: Start difference. First operand 165 states and 247 transitions. Second operand 4 states. [2019-11-15 22:15:30,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:30,029 INFO L93 Difference]: Finished difference Result 329 states and 496 transitions. [2019-11-15 22:15:30,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:30,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 22:15:30,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:30,031 INFO L225 Difference]: With dead ends: 329 [2019-11-15 22:15:30,031 INFO L226 Difference]: Without dead ends: 183 [2019-11-15 22:15:30,032 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:30,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-15 22:15:30,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 165. [2019-11-15 22:15:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-15 22:15:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 246 transitions. [2019-11-15 22:15:30,039 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 246 transitions. Word has length 76 [2019-11-15 22:15:30,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:30,041 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 246 transitions. [2019-11-15 22:15:30,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:30,041 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 246 transitions. [2019-11-15 22:15:30,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-15 22:15:30,042 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:30,043 INFO L380 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, 1] [2019-11-15 22:15:30,043 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:30,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:30,043 INFO L82 PathProgramCache]: Analyzing trace with hash 133532868, now seen corresponding path program 1 times [2019-11-15 22:15:30,044 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:30,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71137297] [2019-11-15 22:15:30,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:30,044 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:30,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:30,099 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:30,102 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71137297] [2019-11-15 22:15:30,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:30,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:30,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601831742] [2019-11-15 22:15:30,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:30,108 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:30,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:30,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:30,108 INFO L87 Difference]: Start difference. First operand 165 states and 246 transitions. Second operand 4 states. [2019-11-15 22:15:30,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:30,564 INFO L93 Difference]: Finished difference Result 328 states and 493 transitions. [2019-11-15 22:15:30,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:30,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-15 22:15:30,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:30,565 INFO L225 Difference]: With dead ends: 328 [2019-11-15 22:15:30,566 INFO L226 Difference]: Without dead ends: 182 [2019-11-15 22:15:30,566 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:30,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-15 22:15:30,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-11-15 22:15:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-15 22:15:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 245 transitions. [2019-11-15 22:15:30,573 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 245 transitions. Word has length 77 [2019-11-15 22:15:30,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:30,573 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 245 transitions. [2019-11-15 22:15:30,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:30,573 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 245 transitions. [2019-11-15 22:15:30,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-15 22:15:30,574 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:30,574 INFO L380 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, 1] [2019-11-15 22:15:30,575 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:30,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:30,575 INFO L82 PathProgramCache]: Analyzing trace with hash 342063024, now seen corresponding path program 1 times [2019-11-15 22:15:30,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:30,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383985495] [2019-11-15 22:15:30,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:30,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:30,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:30,633 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:30,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383985495] [2019-11-15 22:15:30,634 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:30,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:30,634 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658015006] [2019-11-15 22:15:30,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:30,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:30,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:30,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:30,636 INFO L87 Difference]: Start difference. First operand 165 states and 245 transitions. Second operand 4 states. [2019-11-15 22:15:31,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:31,105 INFO L93 Difference]: Finished difference Result 328 states and 491 transitions. [2019-11-15 22:15:31,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:31,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-15 22:15:31,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:31,107 INFO L225 Difference]: With dead ends: 328 [2019-11-15 22:15:31,107 INFO L226 Difference]: Without dead ends: 182 [2019-11-15 22:15:31,108 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:31,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-15 22:15:31,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-11-15 22:15:31,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-15 22:15:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2019-11-15 22:15:31,118 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 77 [2019-11-15 22:15:31,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:31,119 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2019-11-15 22:15:31,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:31,119 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2019-11-15 22:15:31,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-15 22:15:31,120 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:31,120 INFO L380 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, 1] [2019-11-15 22:15:31,121 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:31,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:31,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1313801601, now seen corresponding path program 1 times [2019-11-15 22:15:31,122 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:31,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003340269] [2019-11-15 22:15:31,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:31,122 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:31,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:31,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003340269] [2019-11-15 22:15:31,223 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:31,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:31,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124169154] [2019-11-15 22:15:31,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:31,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:31,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:31,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:31,225 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand 4 states. [2019-11-15 22:15:31,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:31,624 INFO L93 Difference]: Finished difference Result 328 states and 489 transitions. [2019-11-15 22:15:31,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:31,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-15 22:15:31,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:31,626 INFO L225 Difference]: With dead ends: 328 [2019-11-15 22:15:31,627 INFO L226 Difference]: Without dead ends: 182 [2019-11-15 22:15:31,627 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:31,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-15 22:15:31,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-11-15 22:15:31,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-15 22:15:31,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2019-11-15 22:15:31,636 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 78 [2019-11-15 22:15:31,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:31,636 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2019-11-15 22:15:31,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:31,636 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2019-11-15 22:15:31,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 22:15:31,638 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:31,638 INFO L380 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, 1] [2019-11-15 22:15:31,638 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:31,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:31,639 INFO L82 PathProgramCache]: Analyzing trace with hash 170225771, now seen corresponding path program 1 times [2019-11-15 22:15:31,639 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:31,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299591592] [2019-11-15 22:15:31,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:31,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:31,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:31,699 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:31,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299591592] [2019-11-15 22:15:31,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:31,700 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:31,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916788394] [2019-11-15 22:15:31,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:31,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:31,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:31,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:31,702 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand 4 states. [2019-11-15 22:15:32,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:32,124 INFO L93 Difference]: Finished difference Result 328 states and 487 transitions. [2019-11-15 22:15:32,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:32,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-15 22:15:32,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:32,126 INFO L225 Difference]: With dead ends: 328 [2019-11-15 22:15:32,126 INFO L226 Difference]: Without dead ends: 182 [2019-11-15 22:15:32,127 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:32,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-15 22:15:32,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 165. [2019-11-15 22:15:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-15 22:15:32,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 242 transitions. [2019-11-15 22:15:32,133 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 242 transitions. Word has length 79 [2019-11-15 22:15:32,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:32,133 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 242 transitions. [2019-11-15 22:15:32,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:32,133 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 242 transitions. [2019-11-15 22:15:32,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-15 22:15:32,136 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:32,136 INFO L380 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, 1] [2019-11-15 22:15:32,137 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:32,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:32,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2123587236, now seen corresponding path program 1 times [2019-11-15 22:15:32,137 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:32,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371577295] [2019-11-15 22:15:32,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:32,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:32,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:32,207 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:32,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371577295] [2019-11-15 22:15:32,207 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:32,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:32,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998233007] [2019-11-15 22:15:32,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:32,209 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:32,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:32,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:32,209 INFO L87 Difference]: Start difference. First operand 165 states and 242 transitions. Second operand 4 states. [2019-11-15 22:15:32,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:32,594 INFO L93 Difference]: Finished difference Result 318 states and 472 transitions. [2019-11-15 22:15:32,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:32,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-15 22:15:32,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:32,596 INFO L225 Difference]: With dead ends: 318 [2019-11-15 22:15:32,596 INFO L226 Difference]: Without dead ends: 172 [2019-11-15 22:15:32,597 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:32,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-15 22:15:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 165. [2019-11-15 22:15:32,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-15 22:15:32,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 241 transitions. [2019-11-15 22:15:32,609 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 241 transitions. Word has length 80 [2019-11-15 22:15:32,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:32,609 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 241 transitions. [2019-11-15 22:15:32,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:32,609 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 241 transitions. [2019-11-15 22:15:32,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 22:15:32,611 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:32,611 INFO L380 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-11-15 22:15:32,611 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:32,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:32,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1575477095, now seen corresponding path program 1 times [2019-11-15 22:15:32,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:32,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357078714] [2019-11-15 22:15:32,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:32,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:32,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:15:32,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357078714] [2019-11-15 22:15:32,753 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:32,754 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:32,754 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285820168] [2019-11-15 22:15:32,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:32,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:32,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:32,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:32,761 INFO L87 Difference]: Start difference. First operand 165 states and 241 transitions. Second operand 4 states. [2019-11-15 22:15:33,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:33,277 INFO L93 Difference]: Finished difference Result 408 states and 610 transitions. [2019-11-15 22:15:33,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:33,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-15 22:15:33,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:33,281 INFO L225 Difference]: With dead ends: 408 [2019-11-15 22:15:33,281 INFO L226 Difference]: Without dead ends: 262 [2019-11-15 22:15:33,282 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:33,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-15 22:15:33,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 208. [2019-11-15 22:15:33,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-15 22:15:33,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 319 transitions. [2019-11-15 22:15:33,293 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 319 transitions. Word has length 84 [2019-11-15 22:15:33,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:33,293 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 319 transitions. [2019-11-15 22:15:33,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:33,294 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 319 transitions. [2019-11-15 22:15:33,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 22:15:33,295 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:33,296 INFO L380 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-11-15 22:15:33,296 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:33,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:33,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1822096923, now seen corresponding path program 1 times [2019-11-15 22:15:33,297 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:33,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664548540] [2019-11-15 22:15:33,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:33,298 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:33,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:33,387 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:15:33,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664548540] [2019-11-15 22:15:33,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:33,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:33,388 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53219408] [2019-11-15 22:15:33,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:33,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:33,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:33,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:33,390 INFO L87 Difference]: Start difference. First operand 208 states and 319 transitions. Second operand 4 states. [2019-11-15 22:15:33,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:33,829 INFO L93 Difference]: Finished difference Result 446 states and 691 transitions. [2019-11-15 22:15:33,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:33,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-15 22:15:33,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:33,832 INFO L225 Difference]: With dead ends: 446 [2019-11-15 22:15:33,832 INFO L226 Difference]: Without dead ends: 257 [2019-11-15 22:15:33,832 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:33,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-15 22:15:33,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2019-11-15 22:15:33,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-15 22:15:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 361 transitions. [2019-11-15 22:15:33,841 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 361 transitions. Word has length 84 [2019-11-15 22:15:33,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:33,842 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 361 transitions. [2019-11-15 22:15:33,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:33,842 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 361 transitions. [2019-11-15 22:15:33,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 22:15:33,844 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:33,844 INFO L380 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-11-15 22:15:33,845 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:33,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:33,845 INFO L82 PathProgramCache]: Analyzing trace with hash 878453397, now seen corresponding path program 1 times [2019-11-15 22:15:33,845 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:33,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660234244] [2019-11-15 22:15:33,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:33,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:33,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:33,999 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:15:33,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660234244] [2019-11-15 22:15:33,999 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:33,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:33,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251562964] [2019-11-15 22:15:34,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:34,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:34,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:34,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:34,001 INFO L87 Difference]: Start difference. First operand 232 states and 361 transitions. Second operand 4 states. [2019-11-15 22:15:34,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:34,621 INFO L93 Difference]: Finished difference Result 499 states and 771 transitions. [2019-11-15 22:15:34,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:34,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 22:15:34,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:34,624 INFO L225 Difference]: With dead ends: 499 [2019-11-15 22:15:34,625 INFO L226 Difference]: Without dead ends: 286 [2019-11-15 22:15:34,625 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:34,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-11-15 22:15:34,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 232. [2019-11-15 22:15:34,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-15 22:15:34,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 360 transitions. [2019-11-15 22:15:34,634 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 360 transitions. Word has length 97 [2019-11-15 22:15:34,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:34,634 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 360 transitions. [2019-11-15 22:15:34,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:34,634 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 360 transitions. [2019-11-15 22:15:34,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 22:15:34,636 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:34,636 INFO L380 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-11-15 22:15:34,636 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:34,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:34,637 INFO L82 PathProgramCache]: Analyzing trace with hash 919128147, now seen corresponding path program 1 times [2019-11-15 22:15:34,637 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:34,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816523405] [2019-11-15 22:15:34,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:34,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:34,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:34,723 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:15:34,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816523405] [2019-11-15 22:15:34,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:34,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:34,725 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710901278] [2019-11-15 22:15:34,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:34,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:34,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:34,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:34,726 INFO L87 Difference]: Start difference. First operand 232 states and 360 transitions. Second operand 4 states. [2019-11-15 22:15:35,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:35,240 INFO L93 Difference]: Finished difference Result 470 states and 730 transitions. [2019-11-15 22:15:35,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:35,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 22:15:35,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:35,245 INFO L225 Difference]: With dead ends: 470 [2019-11-15 22:15:35,246 INFO L226 Difference]: Without dead ends: 257 [2019-11-15 22:15:35,246 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:35,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-15 22:15:35,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2019-11-15 22:15:35,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-15 22:15:35,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 359 transitions. [2019-11-15 22:15:35,254 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 359 transitions. Word has length 97 [2019-11-15 22:15:35,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:35,255 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 359 transitions. [2019-11-15 22:15:35,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:35,255 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2019-11-15 22:15:35,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:15:35,256 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:35,257 INFO L380 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-11-15 22:15:35,257 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:35,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:35,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1042376858, now seen corresponding path program 1 times [2019-11-15 22:15:35,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:35,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921850009] [2019-11-15 22:15:35,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:35,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:35,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:35,339 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:15:35,339 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921850009] [2019-11-15 22:15:35,339 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:35,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:35,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006166302] [2019-11-15 22:15:35,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:35,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:35,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:35,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:35,343 INFO L87 Difference]: Start difference. First operand 232 states and 359 transitions. Second operand 4 states. [2019-11-15 22:15:35,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:35,993 INFO L93 Difference]: Finished difference Result 497 states and 765 transitions. [2019-11-15 22:15:35,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:35,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 22:15:35,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:35,996 INFO L225 Difference]: With dead ends: 497 [2019-11-15 22:15:35,996 INFO L226 Difference]: Without dead ends: 284 [2019-11-15 22:15:35,997 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:35,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-11-15 22:15:36,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 232. [2019-11-15 22:15:36,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-15 22:15:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 358 transitions. [2019-11-15 22:15:36,005 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 358 transitions. Word has length 98 [2019-11-15 22:15:36,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:36,005 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 358 transitions. [2019-11-15 22:15:36,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:36,006 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 358 transitions. [2019-11-15 22:15:36,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:15:36,007 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:36,007 INFO L380 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-11-15 22:15:36,008 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:36,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:36,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1887815254, now seen corresponding path program 1 times [2019-11-15 22:15:36,009 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:36,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886709513] [2019-11-15 22:15:36,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:36,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:36,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:15:36,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886709513] [2019-11-15 22:15:36,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:36,090 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:36,090 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313426891] [2019-11-15 22:15:36,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:36,091 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:36,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:36,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:36,093 INFO L87 Difference]: Start difference. First operand 232 states and 358 transitions. Second operand 4 states. [2019-11-15 22:15:36,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:36,741 INFO L93 Difference]: Finished difference Result 496 states and 762 transitions. [2019-11-15 22:15:36,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:36,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 22:15:36,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:36,743 INFO L225 Difference]: With dead ends: 496 [2019-11-15 22:15:36,743 INFO L226 Difference]: Without dead ends: 283 [2019-11-15 22:15:36,744 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:36,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-15 22:15:36,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 232. [2019-11-15 22:15:36,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-15 22:15:36,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 357 transitions. [2019-11-15 22:15:36,755 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 357 transitions. Word has length 98 [2019-11-15 22:15:36,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:36,756 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 357 transitions. [2019-11-15 22:15:36,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:36,756 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 357 transitions. [2019-11-15 22:15:36,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:15:36,757 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:36,758 INFO L380 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-11-15 22:15:36,758 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:36,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:36,759 INFO L82 PathProgramCache]: Analyzing trace with hash 218540392, now seen corresponding path program 1 times [2019-11-15 22:15:36,759 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:36,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111762676] [2019-11-15 22:15:36,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:36,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:36,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:15:36,862 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111762676] [2019-11-15 22:15:36,862 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:36,862 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:36,862 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148430764] [2019-11-15 22:15:36,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:36,863 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:36,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:36,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:36,864 INFO L87 Difference]: Start difference. First operand 232 states and 357 transitions. Second operand 4 states. [2019-11-15 22:15:37,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:37,342 INFO L93 Difference]: Finished difference Result 468 states and 722 transitions. [2019-11-15 22:15:37,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:37,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 22:15:37,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:37,345 INFO L225 Difference]: With dead ends: 468 [2019-11-15 22:15:37,345 INFO L226 Difference]: Without dead ends: 255 [2019-11-15 22:15:37,346 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:37,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-15 22:15:37,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 232. [2019-11-15 22:15:37,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-15 22:15:37,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 356 transitions. [2019-11-15 22:15:37,354 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 356 transitions. Word has length 98 [2019-11-15 22:15:37,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:37,354 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 356 transitions. [2019-11-15 22:15:37,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 356 transitions. [2019-11-15 22:15:37,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 22:15:37,356 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:37,356 INFO L380 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-11-15 22:15:37,356 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:37,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:37,357 INFO L82 PathProgramCache]: Analyzing trace with hash -626898004, now seen corresponding path program 1 times [2019-11-15 22:15:37,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:37,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136451640] [2019-11-15 22:15:37,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:37,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:37,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:15:37,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136451640] [2019-11-15 22:15:37,443 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:37,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:37,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579188232] [2019-11-15 22:15:37,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:37,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:37,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:37,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:37,445 INFO L87 Difference]: Start difference. First operand 232 states and 356 transitions. Second operand 4 states. [2019-11-15 22:15:37,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:37,930 INFO L93 Difference]: Finished difference Result 467 states and 719 transitions. [2019-11-15 22:15:37,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:37,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 22:15:37,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:37,933 INFO L225 Difference]: With dead ends: 467 [2019-11-15 22:15:37,933 INFO L226 Difference]: Without dead ends: 254 [2019-11-15 22:15:37,934 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:37,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-15 22:15:37,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 232. [2019-11-15 22:15:37,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-15 22:15:37,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 355 transitions. [2019-11-15 22:15:37,942 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 355 transitions. Word has length 98 [2019-11-15 22:15:37,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:37,942 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 355 transitions. [2019-11-15 22:15:37,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:37,942 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 355 transitions. [2019-11-15 22:15:37,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 22:15:37,943 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:37,944 INFO L380 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, 1] [2019-11-15 22:15:37,944 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:37,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:37,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1558161604, now seen corresponding path program 1 times [2019-11-15 22:15:37,945 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:37,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256664867] [2019-11-15 22:15:37,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:37,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:37,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:38,012 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:15:38,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256664867] [2019-11-15 22:15:38,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:38,013 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:38,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422774944] [2019-11-15 22:15:38,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:38,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:38,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:38,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:38,014 INFO L87 Difference]: Start difference. First operand 232 states and 355 transitions. Second operand 4 states. [2019-11-15 22:15:38,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:38,623 INFO L93 Difference]: Finished difference Result 495 states and 755 transitions. [2019-11-15 22:15:38,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:38,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 22:15:38,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:38,625 INFO L225 Difference]: With dead ends: 495 [2019-11-15 22:15:38,625 INFO L226 Difference]: Without dead ends: 282 [2019-11-15 22:15:38,626 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:38,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-15 22:15:38,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2019-11-15 22:15:38,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-15 22:15:38,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 354 transitions. [2019-11-15 22:15:38,634 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 354 transitions. Word has length 99 [2019-11-15 22:15:38,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:38,634 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 354 transitions. [2019-11-15 22:15:38,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:38,635 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 354 transitions. [2019-11-15 22:15:38,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 22:15:38,636 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:38,636 INFO L380 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-11-15 22:15:38,636 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:38,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:38,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1766691760, now seen corresponding path program 1 times [2019-11-15 22:15:38,637 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:38,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663783274] [2019-11-15 22:15:38,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:38,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:38,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:38,723 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 22:15:38,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663783274] [2019-11-15 22:15:38,723 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:38,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:15:38,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681435335] [2019-11-15 22:15:38,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:15:38,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:38,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:15:38,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:38,725 INFO L87 Difference]: Start difference. First operand 232 states and 354 transitions. Second operand 5 states. [2019-11-15 22:15:39,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:39,440 INFO L93 Difference]: Finished difference Result 466 states and 716 transitions. [2019-11-15 22:15:39,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:15:39,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-11-15 22:15:39,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:39,443 INFO L225 Difference]: With dead ends: 466 [2019-11-15 22:15:39,443 INFO L226 Difference]: Without dead ends: 253 [2019-11-15 22:15:39,444 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:15:39,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-15 22:15:39,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2019-11-15 22:15:39,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 22:15:39,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 380 transitions. [2019-11-15 22:15:39,452 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 380 transitions. Word has length 99 [2019-11-15 22:15:39,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:39,453 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 380 transitions. [2019-11-15 22:15:39,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:15:39,453 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 380 transitions. [2019-11-15 22:15:39,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 22:15:39,454 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:39,455 INFO L380 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, 1] [2019-11-15 22:15:39,455 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:39,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:39,455 INFO L82 PathProgramCache]: Analyzing trace with hash -907239660, now seen corresponding path program 1 times [2019-11-15 22:15:39,456 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:39,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823517562] [2019-11-15 22:15:39,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:39,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:39,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:15:39,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823517562] [2019-11-15 22:15:39,524 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:39,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:39,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054261061] [2019-11-15 22:15:39,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:39,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:39,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:39,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:39,526 INFO L87 Difference]: Start difference. First operand 252 states and 380 transitions. Second operand 4 states. [2019-11-15 22:15:40,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:40,160 INFO L93 Difference]: Finished difference Result 535 states and 804 transitions. [2019-11-15 22:15:40,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:40,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-15 22:15:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:40,163 INFO L225 Difference]: With dead ends: 535 [2019-11-15 22:15:40,163 INFO L226 Difference]: Without dead ends: 302 [2019-11-15 22:15:40,164 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:40,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-15 22:15:40,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2019-11-15 22:15:40,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 22:15:40,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 379 transitions. [2019-11-15 22:15:40,176 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 379 transitions. Word has length 100 [2019-11-15 22:15:40,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:40,177 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 379 transitions. [2019-11-15 22:15:40,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:40,177 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 379 transitions. [2019-11-15 22:15:40,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 22:15:40,178 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:40,179 INFO L380 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, 1] [2019-11-15 22:15:40,179 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:40,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:40,180 INFO L82 PathProgramCache]: Analyzing trace with hash -346539882, now seen corresponding path program 1 times [2019-11-15 22:15:40,180 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:40,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005112469] [2019-11-15 22:15:40,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:40,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:40,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:40,265 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:15:40,270 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005112469] [2019-11-15 22:15:40,270 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:40,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:40,271 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455294003] [2019-11-15 22:15:40,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:40,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:40,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:40,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:40,272 INFO L87 Difference]: Start difference. First operand 252 states and 379 transitions. Second operand 4 states. [2019-11-15 22:15:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:40,746 INFO L93 Difference]: Finished difference Result 506 states and 763 transitions. [2019-11-15 22:15:40,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:40,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-15 22:15:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:40,749 INFO L225 Difference]: With dead ends: 506 [2019-11-15 22:15:40,749 INFO L226 Difference]: Without dead ends: 273 [2019-11-15 22:15:40,750 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:40,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-15 22:15:40,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-11-15 22:15:40,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 22:15:40,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 378 transitions. [2019-11-15 22:15:40,760 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 378 transitions. Word has length 100 [2019-11-15 22:15:40,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:40,761 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 378 transitions. [2019-11-15 22:15:40,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:40,761 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 378 transitions. [2019-11-15 22:15:40,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 22:15:40,762 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:40,763 INFO L380 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, 1] [2019-11-15 22:15:40,764 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:40,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:40,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1206682467, now seen corresponding path program 1 times [2019-11-15 22:15:40,764 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:40,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743206056] [2019-11-15 22:15:40,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:40,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:40,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:40,863 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:15:40,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743206056] [2019-11-15 22:15:40,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:40,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:40,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269932329] [2019-11-15 22:15:40,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:40,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:40,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:40,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:40,865 INFO L87 Difference]: Start difference. First operand 252 states and 378 transitions. Second operand 4 states. [2019-11-15 22:15:41,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:41,438 INFO L93 Difference]: Finished difference Result 535 states and 800 transitions. [2019-11-15 22:15:41,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:41,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-15 22:15:41,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:41,441 INFO L225 Difference]: With dead ends: 535 [2019-11-15 22:15:41,441 INFO L226 Difference]: Without dead ends: 302 [2019-11-15 22:15:41,442 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:41,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-15 22:15:41,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2019-11-15 22:15:41,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 22:15:41,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 377 transitions. [2019-11-15 22:15:41,453 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 377 transitions. Word has length 101 [2019-11-15 22:15:41,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:41,454 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 377 transitions. [2019-11-15 22:15:41,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:41,454 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 377 transitions. [2019-11-15 22:15:41,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 22:15:41,455 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:41,455 INFO L380 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, 1] [2019-11-15 22:15:41,456 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:41,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:41,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1408506401, now seen corresponding path program 1 times [2019-11-15 22:15:41,457 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:41,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562198369] [2019-11-15 22:15:41,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:41,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:41,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:41,544 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:15:41,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562198369] [2019-11-15 22:15:41,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:41,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:41,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375331575] [2019-11-15 22:15:41,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:41,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:41,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:41,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:41,547 INFO L87 Difference]: Start difference. First operand 252 states and 377 transitions. Second operand 4 states. [2019-11-15 22:15:41,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:41,950 INFO L93 Difference]: Finished difference Result 506 states and 759 transitions. [2019-11-15 22:15:41,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:41,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-15 22:15:41,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:41,953 INFO L225 Difference]: With dead ends: 506 [2019-11-15 22:15:41,953 INFO L226 Difference]: Without dead ends: 273 [2019-11-15 22:15:41,954 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:41,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-15 22:15:41,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-11-15 22:15:41,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 22:15:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 376 transitions. [2019-11-15 22:15:41,965 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 376 transitions. Word has length 101 [2019-11-15 22:15:41,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:41,966 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 376 transitions. [2019-11-15 22:15:41,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:41,966 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 376 transitions. [2019-11-15 22:15:41,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-15 22:15:41,967 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:41,967 INFO L380 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, 1] [2019-11-15 22:15:41,968 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:41,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:41,968 INFO L82 PathProgramCache]: Analyzing trace with hash -610222663, now seen corresponding path program 1 times [2019-11-15 22:15:41,968 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:41,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741163530] [2019-11-15 22:15:41,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:41,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:41,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:15:42,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741163530] [2019-11-15 22:15:42,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:42,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:42,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017580628] [2019-11-15 22:15:42,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:42,044 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:42,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:42,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:42,044 INFO L87 Difference]: Start difference. First operand 252 states and 376 transitions. Second operand 4 states. [2019-11-15 22:15:42,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:42,652 INFO L93 Difference]: Finished difference Result 535 states and 796 transitions. [2019-11-15 22:15:42,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:42,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-15 22:15:42,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:42,656 INFO L225 Difference]: With dead ends: 535 [2019-11-15 22:15:42,656 INFO L226 Difference]: Without dead ends: 302 [2019-11-15 22:15:42,656 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:42,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-11-15 22:15:42,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 252. [2019-11-15 22:15:42,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 22:15:42,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 375 transitions. [2019-11-15 22:15:42,668 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 375 transitions. Word has length 102 [2019-11-15 22:15:42,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:42,669 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 375 transitions. [2019-11-15 22:15:42,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:42,669 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 375 transitions. [2019-11-15 22:15:42,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-15 22:15:42,670 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:42,670 INFO L380 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, 1] [2019-11-15 22:15:42,671 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:42,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:42,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1351351995, now seen corresponding path program 1 times [2019-11-15 22:15:42,671 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:42,672 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144558508] [2019-11-15 22:15:42,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:42,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:42,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:42,747 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:15:42,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144558508] [2019-11-15 22:15:42,748 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:42,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:42,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433703900] [2019-11-15 22:15:42,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:42,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:42,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:42,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:42,750 INFO L87 Difference]: Start difference. First operand 252 states and 375 transitions. Second operand 4 states. [2019-11-15 22:15:43,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:43,215 INFO L93 Difference]: Finished difference Result 506 states and 755 transitions. [2019-11-15 22:15:43,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:43,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-15 22:15:43,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:43,219 INFO L225 Difference]: With dead ends: 506 [2019-11-15 22:15:43,219 INFO L226 Difference]: Without dead ends: 273 [2019-11-15 22:15:43,220 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:43,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-15 22:15:43,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-11-15 22:15:43,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 22:15:43,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 374 transitions. [2019-11-15 22:15:43,232 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 374 transitions. Word has length 102 [2019-11-15 22:15:43,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:43,232 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 374 transitions. [2019-11-15 22:15:43,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:43,233 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 374 transitions. [2019-11-15 22:15:43,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 22:15:43,234 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:43,234 INFO L380 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, 1] [2019-11-15 22:15:43,235 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:43,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:43,235 INFO L82 PathProgramCache]: Analyzing trace with hash 271278824, now seen corresponding path program 1 times [2019-11-15 22:15:43,235 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:43,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985197590] [2019-11-15 22:15:43,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:43,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:43,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:15:43,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985197590] [2019-11-15 22:15:43,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:43,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:43,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312315267] [2019-11-15 22:15:43,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:43,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:43,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:43,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:43,329 INFO L87 Difference]: Start difference. First operand 252 states and 374 transitions. Second operand 4 states. [2019-11-15 22:15:43,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:43,953 INFO L93 Difference]: Finished difference Result 525 states and 780 transitions. [2019-11-15 22:15:43,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:43,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-15 22:15:43,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:43,955 INFO L225 Difference]: With dead ends: 525 [2019-11-15 22:15:43,955 INFO L226 Difference]: Without dead ends: 292 [2019-11-15 22:15:43,956 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:43,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-15 22:15:43,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 252. [2019-11-15 22:15:43,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 22:15:43,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 373 transitions. [2019-11-15 22:15:43,965 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 373 transitions. Word has length 103 [2019-11-15 22:15:43,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:43,966 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 373 transitions. [2019-11-15 22:15:43,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:43,966 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 373 transitions. [2019-11-15 22:15:43,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 22:15:43,968 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:43,968 INFO L380 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, 1] [2019-11-15 22:15:43,968 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:43,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:43,969 INFO L82 PathProgramCache]: Analyzing trace with hash 950551078, now seen corresponding path program 1 times [2019-11-15 22:15:43,969 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:43,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975095333] [2019-11-15 22:15:43,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:43,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:43,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:44,059 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:15:44,060 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975095333] [2019-11-15 22:15:44,060 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:44,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:44,061 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670868290] [2019-11-15 22:15:44,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:44,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:44,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:44,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:44,062 INFO L87 Difference]: Start difference. First operand 252 states and 373 transitions. Second operand 4 states. [2019-11-15 22:15:44,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:44,441 INFO L93 Difference]: Finished difference Result 496 states and 739 transitions. [2019-11-15 22:15:44,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:44,441 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-15 22:15:44,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:44,444 INFO L225 Difference]: With dead ends: 496 [2019-11-15 22:15:44,444 INFO L226 Difference]: Without dead ends: 263 [2019-11-15 22:15:44,444 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:44,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-11-15 22:15:44,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 252. [2019-11-15 22:15:44,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 22:15:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 372 transitions. [2019-11-15 22:15:44,455 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 372 transitions. Word has length 103 [2019-11-15 22:15:44,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:44,456 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 372 transitions. [2019-11-15 22:15:44,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:44,456 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 372 transitions. [2019-11-15 22:15:44,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 22:15:44,457 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:44,458 INFO L380 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-11-15 22:15:44,458 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:44,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:44,458 INFO L82 PathProgramCache]: Analyzing trace with hash -504345715, now seen corresponding path program 1 times [2019-11-15 22:15:44,459 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:44,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970498544] [2019-11-15 22:15:44,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:44,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:44,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:15:44,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970498544] [2019-11-15 22:15:44,547 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:44,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:15:44,548 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386921380] [2019-11-15 22:15:44,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:44,549 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:44,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:44,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:44,550 INFO L87 Difference]: Start difference. First operand 252 states and 372 transitions. Second operand 4 states. [2019-11-15 22:15:45,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:45,141 INFO L93 Difference]: Finished difference Result 525 states and 776 transitions. [2019-11-15 22:15:45,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:45,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-15 22:15:45,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:45,144 INFO L225 Difference]: With dead ends: 525 [2019-11-15 22:15:45,144 INFO L226 Difference]: Without dead ends: 292 [2019-11-15 22:15:45,145 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:15:45,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-15 22:15:45,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 252. [2019-11-15 22:15:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 22:15:45,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 371 transitions. [2019-11-15 22:15:45,156 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 371 transitions. Word has length 106 [2019-11-15 22:15:45,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:45,157 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 371 transitions. [2019-11-15 22:15:45,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:45,157 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 371 transitions. [2019-11-15 22:15:45,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 22:15:45,158 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:45,159 INFO L380 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-11-15 22:15:45,159 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:45,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:45,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2104441743, now seen corresponding path program 1 times [2019-11-15 22:15:45,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:45,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901397673] [2019-11-15 22:15:45,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:45,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:45,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:45,244 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 22:15:45,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901397673] [2019-11-15 22:15:45,244 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:45,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:15:45,245 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513963633] [2019-11-15 22:15:45,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:15:45,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:45,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:15:45,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:15:45,246 INFO L87 Difference]: Start difference. First operand 252 states and 371 transitions. Second operand 3 states. [2019-11-15 22:15:45,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:45,297 INFO L93 Difference]: Finished difference Result 716 states and 1068 transitions. [2019-11-15 22:15:45,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:15:45,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-15 22:15:45,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:45,301 INFO L225 Difference]: With dead ends: 716 [2019-11-15 22:15:45,301 INFO L226 Difference]: Without dead ends: 483 [2019-11-15 22:15:45,302 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:15:45,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-11-15 22:15:45,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2019-11-15 22:15:45,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-11-15 22:15:45,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 716 transitions. [2019-11-15 22:15:45,321 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 716 transitions. Word has length 106 [2019-11-15 22:15:45,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:45,322 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 716 transitions. [2019-11-15 22:15:45,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:15:45,322 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 716 transitions. [2019-11-15 22:15:45,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-15 22:15:45,324 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:45,325 INFO L380 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-11-15 22:15:45,326 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:45,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:45,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1080065455, now seen corresponding path program 1 times [2019-11-15 22:15:45,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:45,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869982164] [2019-11-15 22:15:45,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:45,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:45,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:45,413 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 22:15:45,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869982164] [2019-11-15 22:15:45,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:45,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:15:45,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225321308] [2019-11-15 22:15:45,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:15:45,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:15:45,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:15:45,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:15:45,415 INFO L87 Difference]: Start difference. First operand 483 states and 716 transitions. Second operand 3 states. [2019-11-15 22:15:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:45,502 INFO L93 Difference]: Finished difference Result 947 states and 1410 transitions. [2019-11-15 22:15:45,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:15:45,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-11-15 22:15:45,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:45,506 INFO L225 Difference]: With dead ends: 947 [2019-11-15 22:15:45,507 INFO L226 Difference]: Without dead ends: 483 [2019-11-15 22:15:45,508 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:15:45,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-11-15 22:15:45,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2019-11-15 22:15:45,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-11-15 22:15:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 711 transitions. [2019-11-15 22:15:45,527 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 711 transitions. Word has length 125 [2019-11-15 22:15:45,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:45,528 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 711 transitions. [2019-11-15 22:15:45,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:15:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 711 transitions. [2019-11-15 22:15:45,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-15 22:15:45,530 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:45,530 INFO L380 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, 1] [2019-11-15 22:15:45,530 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:45,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:45,531 INFO L82 PathProgramCache]: Analyzing trace with hash -877709346, now seen corresponding path program 1 times [2019-11-15 22:15:45,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:15:45,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524014042] [2019-11-15 22:15:45,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:45,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:15:45,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:15:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:15:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:15:45,883 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:15:45,885 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:15:46,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:15:46 BoogieIcfgContainer [2019-11-15 22:15:46,091 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:15:46,091 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:15:46,091 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:15:46,092 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:15:46,092 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:15:21" (3/4) ... [2019-11-15 22:15:46,098 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:15:46,098 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:15:46,101 INFO L168 Benchmark]: Toolchain (without parser) took 26899.05 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 411.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -150.4 MB). Peak memory consumption was 260.7 MB. Max. memory is 11.5 GB. [2019-11-15 22:15:46,101 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:15:46,102 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1037.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -165.5 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:15:46,102 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:15:46,103 INFO L168 Benchmark]: Boogie Preprocessor took 137.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:15:46,103 INFO L168 Benchmark]: RCFGBuilder took 1472.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.4 MB). Peak memory consumption was 95.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:15:46,104 INFO L168 Benchmark]: TraceAbstraction took 24122.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 276.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -87.0 MB). Peak memory consumption was 189.3 MB. Max. memory is 11.5 GB. [2019-11-15 22:15:46,104 INFO L168 Benchmark]: Witness Printer took 6.89 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:15:46,106 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1037.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -165.5 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 116.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 137.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1472.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 95.4 MB). Peak memory consumption was 95.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24122.92 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 276.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -87.0 MB). Peak memory consumption was 189.3 MB. Max. memory is 11.5 GB. * Witness Printer took 6.89 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1706]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1120. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-3: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 = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp = __VERIFIER_nondet_long() ; [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 ; [L1095] int tmp___4 ; [L1096] int tmp___5 ; [L1097] int tmp___6 ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 ; [L1101] int tmp___10 ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] Time = tmp [L1110] cb = (void (*)())((void *)0) [L1111] ret = -1 [L1112] skip = 0 [L1113] got_new_session = 0 [L1114] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-3:0}] [L1114] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1115] EXPR s->info_callback [L1115] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-3:0}] [L1129] EXPR s->cert VAL [init=1, SSLv3_server_data={-3:0}] [L1129] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1162] COND TRUE s->state == 8464 [L1318] s->shutdown = 0 [L1319] ret = __VERIFIER_nondet_int() [L1320] COND TRUE blastFlag == 0 [L1321] blastFlag = 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1325] COND FALSE !(ret <= 0) [L1330] got_new_session = 1 [L1331] s->state = 8496 [L1332] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1171] COND TRUE s->state == 8496 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 VAL [init=1, SSLv3_server_data={-3:0}] [L1342] COND FALSE !(ret <= 0) [L1347] s->hit VAL [init=1, SSLv3_server_data={-3:0}] [L1347] COND TRUE s->hit [L1348] s->state = 8656 VAL [init=1, SSLv3_server_data={-3:0}] [L1352] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1228] COND TRUE s->state == 8656 [L1552] EXPR s->session [L1552] EXPR s->s3 [L1552] EXPR (s->s3)->tmp.new_cipher [L1552] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1553] tmp___9 = __VERIFIER_nondet_int() [L1554] COND FALSE !(! tmp___9) [L1560] ret = __VERIFIER_nondet_int() [L1561] COND TRUE blastFlag == 2 [L1562] blastFlag = 5 VAL [init=1, SSLv3_server_data={-3:0}] [L1566] COND FALSE !(ret <= 0) [L1571] s->state = 8672 [L1572] s->init_num = 0 [L1573] tmp___10 = __VERIFIER_nondet_int() [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-3:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1228] COND FALSE !(s->state == 8656) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1231] COND FALSE !(s->state == 8657) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1234] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND FALSE !(blastFlag == 4) VAL [init=1, SSLv3_server_data={-3:0}] [L1587] COND TRUE blastFlag == 5 VAL [init=1, SSLv3_server_data={-3:0}] [L1706] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Result: UNSAFE, OverallTime: 24.0s, OverallIterations: 40, TraceHistogramMax: 4, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7567 SDtfs, 2263 SDslu, 10403 SDs, 0 SdLazy, 6834 SolverSat, 349 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 230 GetRequests, 86 SyntacticMatches, 33 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=483occurred 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.4s AutomataMinimizationTime, 39 MinimizatonAttempts, 933 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 3434 NumberOfCodeBlocks, 3434 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3269 ConstructedInterpolants, 0 QuantifiedInterpolants, 773930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 1667/1667 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 22:15:48,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:15:48,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:15:48,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:15:48,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:15:48,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:15:48,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:15:48,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:15:48,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:15:48,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:15:48,666 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:15:48,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:15:48,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:15:48,669 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:15:48,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:15:48,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:15:48,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:15:48,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:15:48,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:15:48,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:15:48,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:15:48,683 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:15:48,684 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:15:48,685 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:15:48,689 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:15:48,689 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:15:48,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:15:48,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:15:48,691 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:15:48,693 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:15:48,693 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:15:48,694 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:15:48,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:15:48,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:15:48,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:15:48,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:15:48,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:15:48,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:15:48,700 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:15:48,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:15:48,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:15:48,703 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 22:15:48,720 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:15:48,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:15:48,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:15:48,722 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:15:48,722 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:15:48,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:15:48,723 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:15:48,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:15:48,724 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:15:48,724 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:15:48,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:15:48,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:15:48,725 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 22:15:48,725 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 22:15:48,725 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:15:48,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:15:48,726 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:15:48,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:15:48,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:15:48,727 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:15:48,727 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:15:48,727 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:15:48,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:15:48,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:15:48,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:15:48,729 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:15:48,729 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 22:15:48,729 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 22:15:48,729 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:15:48,730 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 22:15:48,730 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_a3071cb6-dec9-4902-bff6-3f099b61aa99/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 -> 9eb992f5fc2d1a4c635ca3f801d15ea699dd32d7 [2019-11-15 22:15:48,769 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:15:48,782 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:15:48,786 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:15:48,787 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:15:48,788 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:15:48,789 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-11-15 22:15:48,854 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/data/a07a72533/662b46b3c49a4193ba04eac721258919/FLAG282c5420c [2019-11-15 22:15:49,561 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:15:49,561 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-11-15 22:15:49,596 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/data/a07a72533/662b46b3c49a4193ba04eac721258919/FLAG282c5420c [2019-11-15 22:15:49,724 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/data/a07a72533/662b46b3c49a4193ba04eac721258919 [2019-11-15 22:15:49,727 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:15:49,728 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:15:49,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:15:49,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:15:49,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:15:49,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:15:49" (1/1) ... [2019-11-15 22:15:49,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b4f71e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:49, skipping insertion in model container [2019-11-15 22:15:49,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:15:49" (1/1) ... [2019-11-15 22:15:49,747 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:15:49,808 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:15:50,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:15:50,407 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:15:50,562 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:15:50,588 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:15:50,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:50 WrapperNode [2019-11-15 22:15:50,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:15:50,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:15:50,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:15:50,591 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:15:50,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:50" (1/1) ... [2019-11-15 22:15:50,639 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:50" (1/1) ... [2019-11-15 22:15:50,724 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:15:50,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:15:50,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:15:50,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:15:50,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:50" (1/1) ... [2019-11-15 22:15:50,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:50" (1/1) ... [2019-11-15 22:15:50,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:50" (1/1) ... [2019-11-15 22:15:50,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:50" (1/1) ... [2019-11-15 22:15:50,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:50" (1/1) ... [2019-11-15 22:15:50,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:50" (1/1) ... [2019-11-15 22:15:50,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:50" (1/1) ... [2019-11-15 22:15:50,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:15:50,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:15:50,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:15:50,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:15:50,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:15:50,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:15:50,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:15:50,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 22:15:50,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:15:50,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:15:50,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:15:50,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:15:50,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 22:15:51,234 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 22:15:54,467 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 22:15:54,468 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 22:15:54,470 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:15:54,470 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 22:15:54,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:15:54 BoogieIcfgContainer [2019-11-15 22:15:54,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:15:54,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:15:54,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:15:54,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:15:54,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:15:49" (1/3) ... [2019-11-15 22:15:54,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a2adce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:15:54, skipping insertion in model container [2019-11-15 22:15:54,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:15:50" (2/3) ... [2019-11-15 22:15:54,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a2adce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:15:54, skipping insertion in model container [2019-11-15 22:15:54,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:15:54" (3/3) ... [2019-11-15 22:15:54,484 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2019-11-15 22:15:54,495 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:15:54,506 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 22:15:54,518 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 22:15:54,557 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:15:54,557 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:15:54,557 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:15:54,558 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:15:54,558 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:15:54,558 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:15:54,558 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:15:54,559 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:15:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-11-15 22:15:54,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 22:15:54,607 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:54,609 INFO L380 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-11-15 22:15:54,611 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:54,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:54,617 INFO L82 PathProgramCache]: Analyzing trace with hash 522834703, now seen corresponding path program 1 times [2019-11-15 22:15:54,632 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:15:54,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2083590541] [2019-11-15 22:15:54,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:15:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:54,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:15:54,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:54,949 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:15:55,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:55,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2083590541] [2019-11-15 22:15:55,006 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:55,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:15:55,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531256080] [2019-11-15 22:15:55,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:55,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:15:55,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:55,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:55,035 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 4 states. [2019-11-15 22:15:55,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:55,253 INFO L93 Difference]: Finished difference Result 549 states and 925 transitions. [2019-11-15 22:15:55,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:55,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-15 22:15:55,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:55,290 INFO L225 Difference]: With dead ends: 549 [2019-11-15 22:15:55,291 INFO L226 Difference]: Without dead ends: 373 [2019-11-15 22:15:55,297 INFO L600 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-11-15 22:15:55,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-11-15 22:15:55,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 371. [2019-11-15 22:15:55,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-11-15 22:15:55,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 562 transitions. [2019-11-15 22:15:55,426 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 562 transitions. Word has length 45 [2019-11-15 22:15:55,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:55,427 INFO L462 AbstractCegarLoop]: Abstraction has 371 states and 562 transitions. [2019-11-15 22:15:55,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:55,427 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 562 transitions. [2019-11-15 22:15:55,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 22:15:55,439 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:55,439 INFO L380 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, 1] [2019-11-15 22:15:55,647 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:15:55,647 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:55,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:55,648 INFO L82 PathProgramCache]: Analyzing trace with hash -60762572, now seen corresponding path program 1 times [2019-11-15 22:15:55,648 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:15:55,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2147421247] [2019-11-15 22:15:55,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:15:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:55,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:15:55,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:55,961 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:55,962 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:15:55,996 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:15:55,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2147421247] [2019-11-15 22:15:55,998 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:55,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:15:55,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575187904] [2019-11-15 22:15:56,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:56,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:15:56,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:56,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:56,002 INFO L87 Difference]: Start difference. First operand 371 states and 562 transitions. Second operand 4 states. [2019-11-15 22:15:56,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:56,627 INFO L93 Difference]: Finished difference Result 853 states and 1299 transitions. [2019-11-15 22:15:56,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:56,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-15 22:15:56,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:56,632 INFO L225 Difference]: With dead ends: 853 [2019-11-15 22:15:56,633 INFO L226 Difference]: Without dead ends: 611 [2019-11-15 22:15:56,640 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:56,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-11-15 22:15:56,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 609. [2019-11-15 22:15:56,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2019-11-15 22:15:56,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 922 transitions. [2019-11-15 22:15:56,699 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 922 transitions. Word has length 63 [2019-11-15 22:15:56,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:56,700 INFO L462 AbstractCegarLoop]: Abstraction has 609 states and 922 transitions. [2019-11-15 22:15:56,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:56,700 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 922 transitions. [2019-11-15 22:15:56,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-15 22:15:56,707 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:56,707 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:15:56,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:15:56,914 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:56,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:56,915 INFO L82 PathProgramCache]: Analyzing trace with hash -2005677060, now seen corresponding path program 1 times [2019-11-15 22:15:56,916 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:15:56,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [280515740] [2019-11-15 22:15:56,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:15:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:15:57,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:15:57,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:15:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:15:57,365 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 22:15:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 22:15:57,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [280515740] [2019-11-15 22:15:57,434 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:15:57,434 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 22:15:57,435 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018230867] [2019-11-15 22:15:57,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:15:57,437 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 22:15:57,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:15:57,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:57,439 INFO L87 Difference]: Start difference. First operand 609 states and 922 transitions. Second operand 4 states. [2019-11-15 22:15:57,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:15:57,796 INFO L93 Difference]: Finished difference Result 1091 states and 1654 transitions. [2019-11-15 22:15:57,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:15:57,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-11-15 22:15:57,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:15:57,802 INFO L225 Difference]: With dead ends: 1091 [2019-11-15 22:15:57,803 INFO L226 Difference]: Without dead ends: 611 [2019-11-15 22:15:57,804 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:15:57,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-11-15 22:15:57,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-11-15 22:15:57,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-15 22:15:57,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 918 transitions. [2019-11-15 22:15:57,838 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 918 transitions. Word has length 123 [2019-11-15 22:15:57,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:15:57,839 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 918 transitions. [2019-11-15 22:15:57,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:15:57,839 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 918 transitions. [2019-11-15 22:15:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-15 22:15:57,842 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:15:57,843 INFO L380 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, 1] [2019-11-15 22:15:58,047 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:15:58,047 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:15:58,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:15:58,048 INFO L82 PathProgramCache]: Analyzing trace with hash -877709346, now seen corresponding path program 1 times [2019-11-15 22:15:58,049 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 22:15:58,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1677071790] [2019-11-15 22:15:58,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:15:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:16:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:16:01,253 INFO L168 tionRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-15 22:16:01,253 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:16:01,466 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 22:16:01,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:16:01 BoogieIcfgContainer [2019-11-15 22:16:01,699 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:16:01,699 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:16:01,700 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:16:01,700 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:16:01,701 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:15:54" (3/4) ... [2019-11-15 22:16:01,703 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 22:16:01,901 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a3071cb6-dec9-4902-bff6-3f099b61aa99/bin/uautomizer/witness.graphml [2019-11-15 22:16:01,901 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:16:01,903 INFO L168 Benchmark]: Toolchain (without parser) took 12174.67 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 237.0 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -106.4 MB). Peak memory consumption was 130.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:16:01,904 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:16:01,904 INFO L168 Benchmark]: CACSL2BoogieTranslator took 860.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:16:01,905 INFO L168 Benchmark]: Boogie Procedure Inliner took 136.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:16:01,905 INFO L168 Benchmark]: Boogie Preprocessor took 177.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:16:01,906 INFO L168 Benchmark]: RCFGBuilder took 3567.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.9 MB). Peak memory consumption was 90.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:16:01,906 INFO L168 Benchmark]: TraceAbstraction took 7224.76 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 74.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -40.6 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. [2019-11-15 22:16:01,907 INFO L168 Benchmark]: Witness Printer took 201.74 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:16:01,909 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 860.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 136.83 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 177.41 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 3567.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.9 MB). Peak memory consumption was 90.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7224.76 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 74.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -40.6 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. * Witness Printer took 201.74 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1706]: 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={-1409524753: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 = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp = __VERIFIER_nondet_long() ; [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 ; [L1095] int tmp___4 ; [L1096] int tmp___5 ; [L1097] int tmp___6 ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 ; [L1101] int tmp___10 ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] Time = tmp [L1110] cb = (void (*)())((void *)0) [L1111] ret = -1 [L1112] skip = 0 [L1113] got_new_session = 0 [L1114] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1114] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1115] EXPR s->info_callback [L1115] cb = s->info_callback [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1129] EXPR s->cert VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1129] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1162] COND TRUE s->state == 8464 [L1318] s->shutdown = 0 [L1319] ret = __VERIFIER_nondet_int() [L1320] COND TRUE blastFlag == 0 [L1321] blastFlag = 1 VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1325] COND FALSE !(ret <= 0) [L1330] got_new_session = 1 [L1331] s->state = 8496 [L1332] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1171] COND TRUE s->state == 8496 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1342] COND FALSE !(ret <= 0) [L1347] s->hit VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1347] COND TRUE s->hit [L1348] s->state = 8656 VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1352] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1228] COND TRUE s->state == 8656 [L1552] EXPR s->session [L1552] EXPR s->s3 [L1552] EXPR (s->s3)->tmp.new_cipher [L1552] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1553] tmp___9 = __VERIFIER_nondet_int() [L1554] COND FALSE !(! tmp___9) [L1560] ret = __VERIFIER_nondet_int() [L1561] COND TRUE blastFlag == 2 [L1562] blastFlag = 5 VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1566] COND FALSE !(ret <= 0) [L1571] s->state = 8672 [L1572] s->init_num = 0 [L1573] tmp___10 = __VERIFIER_nondet_int() [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1135] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1228] COND FALSE !(s->state == 8656) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1231] COND FALSE !(s->state == 8657) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1234] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND FALSE !(blastFlag == 4) VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1587] COND TRUE blastFlag == 5 VAL [init=1, SSLv3_server_data={-1409524753:0}] [L1706] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-1409524753:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 145 locations, 1 error locations. Result: UNSAFE, OverallTime: 7.1s, OverallIterations: 4, TraceHistogramMax: 4, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 951 SDtfs, 1145 SDslu, 976 SDs, 0 SdLazy, 86 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 456 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=611occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 120522 SizeOfPredicates, 2 NumberOfNonLiveVariables, 614 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 224/224 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...