./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.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_74342e07-86bc-48cb-9b34-3f271c41e9ad/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/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 09d651c8899349531493fefbd169797d0022b4a3 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_74342e07-86bc-48cb-9b34-3f271c41e9ad/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/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 09d651c8899349531493fefbd169797d0022b4a3 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 20:23:53,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:23:53,283 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:23:53,300 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:23:53,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:23:53,302 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:23:53,305 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:23:53,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:23:53,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:23:53,325 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:23:53,326 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:23:53,327 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:23:53,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:23:53,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:23:53,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:23:53,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:23:53,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:23:53,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:23:53,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:23:53,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:23:53,338 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:23:53,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:23:53,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:23:53,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:23:53,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:23:53,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:23:53,345 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:23:53,346 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:23:53,346 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:23:53,347 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:23:53,347 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:23:53,348 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:23:53,349 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:23:53,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:23:53,350 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:23:53,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:23:53,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:23:53,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:23:53,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:23:53,353 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:23:53,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:23:53,354 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:23:53,367 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:23:53,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:23:53,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:23:53,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:23:53,370 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:23:53,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:23:53,370 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:23:53,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:23:53,371 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:23:53,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:23:53,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:23:53,372 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:23:53,372 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:23:53,372 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:23:53,372 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:23:53,373 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:23:53,373 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:23:53,373 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:23:53,373 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:23:53,374 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:23:53,374 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:23:53,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:23:53,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:23:53,375 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:23:53,375 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:23:53,376 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:23:53,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:23:53,376 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:23:53,376 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_74342e07-86bc-48cb-9b34-3f271c41e9ad/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 -> 09d651c8899349531493fefbd169797d0022b4a3 [2019-11-15 20:23:53,409 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:23:53,422 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:23:53,425 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:23:53,427 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:23:53,427 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:23:53,428 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c [2019-11-15 20:23:53,498 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/bin/uautomizer/data/6e29a29f1/34edd4d4836645ce8b621ea84c0fa947/FLAGb8f854399 [2019-11-15 20:23:54,263 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:23:54,263 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c [2019-11-15 20:23:54,294 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/bin/uautomizer/data/6e29a29f1/34edd4d4836645ce8b621ea84c0fa947/FLAGb8f854399 [2019-11-15 20:23:54,339 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/bin/uautomizer/data/6e29a29f1/34edd4d4836645ce8b621ea84c0fa947 [2019-11-15 20:23:54,342 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:23:54,343 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:23:54,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:23:54,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:23:54,349 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:23:54,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:23:54" (1/1) ... [2019-11-15 20:23:54,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4270ec6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:54, skipping insertion in model container [2019-11-15 20:23:54,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:23:54" (1/1) ... [2019-11-15 20:23:54,361 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:23:54,446 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:23:55,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:23:55,123 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:23:55,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:23:55,323 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:23:55,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55 WrapperNode [2019-11-15 20:23:55,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:23:55,330 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:23:55,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:23:55,330 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:23:55,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55" (1/1) ... [2019-11-15 20:23:55,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55" (1/1) ... [2019-11-15 20:23:55,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:23:55,457 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:23:55,457 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:23:55,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:23:55,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55" (1/1) ... [2019-11-15 20:23:55,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55" (1/1) ... [2019-11-15 20:23:55,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55" (1/1) ... [2019-11-15 20:23:55,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55" (1/1) ... [2019-11-15 20:23:55,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55" (1/1) ... [2019-11-15 20:23:55,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55" (1/1) ... [2019-11-15 20:23:55,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55" (1/1) ... [2019-11-15 20:23:55,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:23:55,643 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:23:55,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:23:55,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:23:55,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/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 20:23:55,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 20:23:55,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:23:55,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:23:55,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:23:55,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 20:23:55,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 20:23:55,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:23:55,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:23:56,035 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 20:23:57,224 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 20:23:57,225 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 20:23:57,228 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:23:57,228 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 20:23:57,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:23:57 BoogieIcfgContainer [2019-11-15 20:23:57,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:23:57,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:23:57,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:23:57,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:23:57,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:23:54" (1/3) ... [2019-11-15 20:23:57,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282c5f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:23:57, skipping insertion in model container [2019-11-15 20:23:57,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:23:55" (2/3) ... [2019-11-15 20:23:57,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282c5f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:23:57, skipping insertion in model container [2019-11-15 20:23:57,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:23:57" (3/3) ... [2019-11-15 20:23:57,244 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03.i.cil.c [2019-11-15 20:23:57,256 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:23:57,270 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:23:57,284 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:23:57,316 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:23:57,316 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:23:57,316 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:23:57,316 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:23:57,317 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:23:57,317 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:23:57,317 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:23:57,317 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:23:57,345 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-15 20:23:57,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 20:23:57,364 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:57,366 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 20:23:57,368 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:57,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:57,374 INFO L82 PathProgramCache]: Analyzing trace with hash 522837677, now seen corresponding path program 1 times [2019-11-15 20:23:57,384 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:57,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347428999] [2019-11-15 20:23:57,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:57,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:57,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:23:57,874 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 20:23:57,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347428999] [2019-11-15 20:23:57,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:23:57,877 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:23:57,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654268390] [2019-11-15 20:23:57,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:23:57,886 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:23:57,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:23:57,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:23:57,904 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-11-15 20:23:58,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:23:58,560 INFO L93 Difference]: Finished difference Result 313 states and 527 transitions. [2019-11-15 20:23:58,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:23:58,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-15 20:23:58,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:23:58,587 INFO L225 Difference]: With dead ends: 313 [2019-11-15 20:23:58,588 INFO L226 Difference]: Without dead ends: 158 [2019-11-15 20:23:58,593 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 20:23:58,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-15 20:23:58,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-15 20:23:58,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:23:58,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2019-11-15 20:23:58,685 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 45 [2019-11-15 20:23:58,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:23:58,686 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2019-11-15 20:23:58,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:23:58,687 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2019-11-15 20:23:58,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 20:23:58,695 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:58,695 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 20:23:58,696 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:58,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:58,696 INFO L82 PathProgramCache]: Analyzing trace with hash -428665669, now seen corresponding path program 1 times [2019-11-15 20:23:58,696 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:58,697 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9179671] [2019-11-15 20:23:58,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:58,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:58,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:23:58,852 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 20:23:58,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9179671] [2019-11-15 20:23:58,853 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:23:58,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:23:58,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113140657] [2019-11-15 20:23:58,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:23:58,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:23:58,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:23:58,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:23:58,858 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand 4 states. [2019-11-15 20:23:59,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:23:59,317 INFO L93 Difference]: Finished difference Result 280 states and 423 transitions. [2019-11-15 20:23:59,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:23:59,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-15 20:23:59,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:23:59,320 INFO L225 Difference]: With dead ends: 280 [2019-11-15 20:23:59,320 INFO L226 Difference]: Without dead ends: 158 [2019-11-15 20:23:59,322 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 20:23:59,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-15 20:23:59,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2019-11-15 20:23:59,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:23:59,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 215 transitions. [2019-11-15 20:23:59,353 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 215 transitions. Word has length 58 [2019-11-15 20:23:59,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:23:59,353 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 215 transitions. [2019-11-15 20:23:59,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:23:59,354 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 215 transitions. [2019-11-15 20:23:59,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 20:23:59,362 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:23:59,363 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] [2019-11-15 20:23:59,363 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:23:59,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:23:59,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1858029875, now seen corresponding path program 1 times [2019-11-15 20:23:59,365 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:23:59,366 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582779434] [2019-11-15 20:23:59,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:59,366 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:23:59,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:23:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:23:59,527 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 20:23:59,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582779434] [2019-11-15 20:23:59,529 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:23:59,529 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:23:59,529 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700410155] [2019-11-15 20:23:59,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:23:59,531 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:23:59,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:23:59,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:23:59,532 INFO L87 Difference]: Start difference. First operand 141 states and 215 transitions. Second operand 4 states. [2019-11-15 20:23:59,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:23:59,991 INFO L93 Difference]: Finished difference Result 279 states and 421 transitions. [2019-11-15 20:23:59,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:23:59,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 20:23:59,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:23:59,994 INFO L225 Difference]: With dead ends: 279 [2019-11-15 20:23:59,994 INFO L226 Difference]: Without dead ends: 157 [2019-11-15 20:23:59,995 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 20:23:59,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-15 20:24:00,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2019-11-15 20:24:00,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:24:00,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 214 transitions. [2019-11-15 20:24:00,009 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 214 transitions. Word has length 59 [2019-11-15 20:24:00,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:00,010 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 214 transitions. [2019-11-15 20:24:00,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:00,010 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 214 transitions. [2019-11-15 20:24:00,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 20:24:00,011 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:00,012 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 20:24:00,012 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:00,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:00,013 INFO L82 PathProgramCache]: Analyzing trace with hash -514836424, now seen corresponding path program 1 times [2019-11-15 20:24:00,013 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:00,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180135003] [2019-11-15 20:24:00,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:00,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:00,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:00,105 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 20:24:00,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180135003] [2019-11-15 20:24:00,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:00,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:00,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128386400] [2019-11-15 20:24:00,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:00,107 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:00,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:00,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:00,108 INFO L87 Difference]: Start difference. First operand 141 states and 214 transitions. Second operand 4 states. [2019-11-15 20:24:00,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:00,568 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2019-11-15 20:24:00,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:00,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 20:24:00,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:00,571 INFO L225 Difference]: With dead ends: 277 [2019-11-15 20:24:00,571 INFO L226 Difference]: Without dead ends: 155 [2019-11-15 20:24:00,572 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 20:24:00,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-15 20:24:00,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2019-11-15 20:24:00,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:24:00,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2019-11-15 20:24:00,583 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 59 [2019-11-15 20:24:00,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:00,584 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2019-11-15 20:24:00,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:00,584 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2019-11-15 20:24:00,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 20:24:00,585 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:00,585 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 20:24:00,586 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:00,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:00,586 INFO L82 PathProgramCache]: Analyzing trace with hash 434511736, now seen corresponding path program 1 times [2019-11-15 20:24:00,587 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:00,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353425946] [2019-11-15 20:24:00,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:00,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:00,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:00,663 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 20:24:00,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353425946] [2019-11-15 20:24:00,664 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:00,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:00,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355009029] [2019-11-15 20:24:00,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:00,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:00,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:00,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:00,666 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand 4 states. [2019-11-15 20:24:01,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:01,058 INFO L93 Difference]: Finished difference Result 276 states and 416 transitions. [2019-11-15 20:24:01,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:01,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 20:24:01,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:01,060 INFO L225 Difference]: With dead ends: 276 [2019-11-15 20:24:01,061 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 20:24:01,061 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 20:24:01,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 20:24:01,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-15 20:24:01,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:24:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2019-11-15 20:24:01,081 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 59 [2019-11-15 20:24:01,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:01,082 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2019-11-15 20:24:01,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:01,082 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2019-11-15 20:24:01,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-15 20:24:01,083 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:01,084 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] [2019-11-15 20:24:01,084 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:01,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:01,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1020019103, now seen corresponding path program 1 times [2019-11-15 20:24:01,085 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:01,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230382382] [2019-11-15 20:24:01,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:01,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:01,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:01,183 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 20:24:01,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230382382] [2019-11-15 20:24:01,185 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:01,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:01,186 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131958831] [2019-11-15 20:24:01,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:01,187 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:01,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:01,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:01,188 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand 4 states. [2019-11-15 20:24:01,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:01,514 INFO L93 Difference]: Finished difference Result 276 states and 415 transitions. [2019-11-15 20:24:01,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:01,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-15 20:24:01,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:01,519 INFO L225 Difference]: With dead ends: 276 [2019-11-15 20:24:01,519 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 20:24:01,520 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 20:24:01,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 20:24:01,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-15 20:24:01,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:24:01,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2019-11-15 20:24:01,535 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 59 [2019-11-15 20:24:01,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:01,536 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2019-11-15 20:24:01,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:01,536 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2019-11-15 20:24:01,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 20:24:01,537 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:01,537 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] [2019-11-15 20:24:01,537 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:01,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:01,538 INFO L82 PathProgramCache]: Analyzing trace with hash 321491268, now seen corresponding path program 1 times [2019-11-15 20:24:01,538 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:01,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442055805] [2019-11-15 20:24:01,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:01,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:01,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:01,622 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 20:24:01,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442055805] [2019-11-15 20:24:01,623 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:01,623 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:01,624 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913864929] [2019-11-15 20:24:01,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:01,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:01,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:01,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:01,625 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand 4 states. [2019-11-15 20:24:01,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:01,967 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2019-11-15 20:24:01,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:01,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 20:24:01,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:01,972 INFO L225 Difference]: With dead ends: 276 [2019-11-15 20:24:01,972 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 20:24:01,973 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 20:24:01,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 20:24:01,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-15 20:24:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:24:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2019-11-15 20:24:01,980 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 60 [2019-11-15 20:24:01,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:01,980 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2019-11-15 20:24:01,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:01,981 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2019-11-15 20:24:01,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 20:24:01,982 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:01,982 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] [2019-11-15 20:24:01,982 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:01,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:01,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1080156986, now seen corresponding path program 1 times [2019-11-15 20:24:01,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:01,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612630224] [2019-11-15 20:24:01,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:01,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:01,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:02,048 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 20:24:02,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612630224] [2019-11-15 20:24:02,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:02,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:02,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941421730] [2019-11-15 20:24:02,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:02,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:02,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:02,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:02,051 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand 4 states. [2019-11-15 20:24:02,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:02,410 INFO L93 Difference]: Finished difference Result 276 states and 413 transitions. [2019-11-15 20:24:02,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:02,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-15 20:24:02,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:02,413 INFO L225 Difference]: With dead ends: 276 [2019-11-15 20:24:02,413 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 20:24:02,413 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 20:24:02,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 20:24:02,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141. [2019-11-15 20:24:02,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:24:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 209 transitions. [2019-11-15 20:24:02,420 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 209 transitions. Word has length 61 [2019-11-15 20:24:02,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:02,421 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 209 transitions. [2019-11-15 20:24:02,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:02,421 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 209 transitions. [2019-11-15 20:24:02,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 20:24:02,423 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:02,423 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] [2019-11-15 20:24:02,423 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:02,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:02,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1620376695, now seen corresponding path program 1 times [2019-11-15 20:24:02,424 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:02,424 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076502794] [2019-11-15 20:24:02,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:02,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:02,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:02,486 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 20:24:02,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076502794] [2019-11-15 20:24:02,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:02,487 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:02,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496770565] [2019-11-15 20:24:02,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:02,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:02,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:02,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:02,490 INFO L87 Difference]: Start difference. First operand 141 states and 209 transitions. Second operand 4 states. [2019-11-15 20:24:02,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:02,827 INFO L93 Difference]: Finished difference Result 266 states and 399 transitions. [2019-11-15 20:24:02,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:02,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-15 20:24:02,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:02,830 INFO L225 Difference]: With dead ends: 266 [2019-11-15 20:24:02,830 INFO L226 Difference]: Without dead ends: 144 [2019-11-15 20:24:02,831 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 20:24:02,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-15 20:24:02,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-11-15 20:24:02,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 20:24:02,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2019-11-15 20:24:02,842 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 62 [2019-11-15 20:24:02,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:02,843 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2019-11-15 20:24:02,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:02,843 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2019-11-15 20:24:02,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 20:24:02,844 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:02,845 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 20:24:02,845 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:02,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:02,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1220225295, now seen corresponding path program 1 times [2019-11-15 20:24:02,846 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:02,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776910426] [2019-11-15 20:24:02,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:02,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:02,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:02,935 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 20:24:02,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776910426] [2019-11-15 20:24:02,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:02,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:02,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901493088] [2019-11-15 20:24:02,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:02,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:02,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:02,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:02,938 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand 4 states. [2019-11-15 20:24:03,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:03,352 INFO L93 Difference]: Finished difference Result 306 states and 460 transitions. [2019-11-15 20:24:03,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:03,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-15 20:24:03,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:03,355 INFO L225 Difference]: With dead ends: 306 [2019-11-15 20:24:03,355 INFO L226 Difference]: Without dead ends: 184 [2019-11-15 20:24:03,356 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 20:24:03,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-15 20:24:03,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-11-15 20:24:03,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:24:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2019-11-15 20:24:03,363 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 62 [2019-11-15 20:24:03,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:03,363 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2019-11-15 20:24:03,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:03,364 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2019-11-15 20:24:03,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 20:24:03,365 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:03,365 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 20:24:03,365 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:03,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:03,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1563120905, now seen corresponding path program 1 times [2019-11-15 20:24:03,366 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:03,366 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573573071] [2019-11-15 20:24:03,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:03,367 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:03,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:03,453 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 20:24:03,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573573071] [2019-11-15 20:24:03,453 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:03,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:03,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551139529] [2019-11-15 20:24:03,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:03,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:03,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:03,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:03,456 INFO L87 Difference]: Start difference. First operand 163 states and 246 transitions. Second operand 4 states. [2019-11-15 20:24:03,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:03,890 INFO L93 Difference]: Finished difference Result 328 states and 497 transitions. [2019-11-15 20:24:03,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:03,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-15 20:24:03,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:03,893 INFO L225 Difference]: With dead ends: 328 [2019-11-15 20:24:03,893 INFO L226 Difference]: Without dead ends: 184 [2019-11-15 20:24:03,893 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 20:24:03,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-15 20:24:03,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 163. [2019-11-15 20:24:03,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:24:03,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 245 transitions. [2019-11-15 20:24:03,901 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 245 transitions. Word has length 75 [2019-11-15 20:24:03,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:03,901 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 245 transitions. [2019-11-15 20:24:03,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:03,902 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 245 transitions. [2019-11-15 20:24:03,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 20:24:03,903 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:03,903 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] [2019-11-15 20:24:03,903 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:03,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:03,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1628563473, now seen corresponding path program 1 times [2019-11-15 20:24:03,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:03,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616533179] [2019-11-15 20:24:03,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:03,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:03,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:03,974 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 20:24:03,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616533179] [2019-11-15 20:24:03,974 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:03,975 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:03,975 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425872529] [2019-11-15 20:24:03,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:03,976 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:03,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:03,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:03,977 INFO L87 Difference]: Start difference. First operand 163 states and 245 transitions. Second operand 4 states. [2019-11-15 20:24:04,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:04,456 INFO L93 Difference]: Finished difference Result 327 states and 494 transitions. [2019-11-15 20:24:04,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:04,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 20:24:04,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:04,458 INFO L225 Difference]: With dead ends: 327 [2019-11-15 20:24:04,458 INFO L226 Difference]: Without dead ends: 183 [2019-11-15 20:24:04,459 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 20:24:04,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-15 20:24:04,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 163. [2019-11-15 20:24:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:24:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 244 transitions. [2019-11-15 20:24:04,466 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 244 transitions. Word has length 76 [2019-11-15 20:24:04,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:04,467 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 244 transitions. [2019-11-15 20:24:04,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:04,467 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 244 transitions. [2019-11-15 20:24:04,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 20:24:04,468 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:04,469 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 20:24:04,469 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:04,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:04,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1323210372, now seen corresponding path program 1 times [2019-11-15 20:24:04,473 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:04,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035246927] [2019-11-15 20:24:04,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:04,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:04,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:04,546 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 20:24:04,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035246927] [2019-11-15 20:24:04,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:04,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:04,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336842109] [2019-11-15 20:24:04,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:04,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:04,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:04,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:04,549 INFO L87 Difference]: Start difference. First operand 163 states and 244 transitions. Second operand 4 states. [2019-11-15 20:24:04,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:04,975 INFO L93 Difference]: Finished difference Result 325 states and 490 transitions. [2019-11-15 20:24:04,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:04,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 20:24:04,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:04,978 INFO L225 Difference]: With dead ends: 325 [2019-11-15 20:24:04,978 INFO L226 Difference]: Without dead ends: 181 [2019-11-15 20:24:04,978 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 20:24:04,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-15 20:24:04,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 163. [2019-11-15 20:24:04,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:24:04,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 243 transitions. [2019-11-15 20:24:04,984 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 243 transitions. Word has length 76 [2019-11-15 20:24:04,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:04,985 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 243 transitions. [2019-11-15 20:24:04,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:04,985 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 243 transitions. [2019-11-15 20:24:04,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 20:24:04,987 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:04,988 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 20:24:04,988 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:04,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:04,988 INFO L82 PathProgramCache]: Analyzing trace with hash -373862212, now seen corresponding path program 1 times [2019-11-15 20:24:04,989 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:04,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867400597] [2019-11-15 20:24:04,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:04,989 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:04,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:05,055 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 20:24:05,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867400597] [2019-11-15 20:24:05,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:05,061 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:05,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282579776] [2019-11-15 20:24:05,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:05,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:05,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:05,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:05,063 INFO L87 Difference]: Start difference. First operand 163 states and 243 transitions. Second operand 4 states. [2019-11-15 20:24:05,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:05,477 INFO L93 Difference]: Finished difference Result 324 states and 487 transitions. [2019-11-15 20:24:05,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:05,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 20:24:05,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:05,480 INFO L225 Difference]: With dead ends: 324 [2019-11-15 20:24:05,480 INFO L226 Difference]: Without dead ends: 180 [2019-11-15 20:24:05,480 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 20:24:05,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-15 20:24:05,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-15 20:24:05,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:24:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2019-11-15 20:24:05,488 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 76 [2019-11-15 20:24:05,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:05,488 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2019-11-15 20:24:05,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:05,489 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-11-15 20:24:05,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 20:24:05,490 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:05,490 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] [2019-11-15 20:24:05,490 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:05,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:05,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1828393051, now seen corresponding path program 1 times [2019-11-15 20:24:05,491 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:05,491 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571234293] [2019-11-15 20:24:05,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:05,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:05,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:05,561 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 20:24:05,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571234293] [2019-11-15 20:24:05,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:05,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:05,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621336362] [2019-11-15 20:24:05,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:05,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:05,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:05,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:05,564 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 4 states. [2019-11-15 20:24:05,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:05,935 INFO L93 Difference]: Finished difference Result 324 states and 485 transitions. [2019-11-15 20:24:05,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:05,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-15 20:24:05,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:05,937 INFO L225 Difference]: With dead ends: 324 [2019-11-15 20:24:05,937 INFO L226 Difference]: Without dead ends: 180 [2019-11-15 20:24:05,938 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 20:24:05,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-15 20:24:05,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-15 20:24:05,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:24:05,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 241 transitions. [2019-11-15 20:24:05,949 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 241 transitions. Word has length 76 [2019-11-15 20:24:05,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:05,949 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 241 transitions. [2019-11-15 20:24:05,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:05,950 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 241 transitions. [2019-11-15 20:24:05,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-15 20:24:05,951 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:05,951 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] [2019-11-15 20:24:05,951 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:05,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:05,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1031702656, now seen corresponding path program 1 times [2019-11-15 20:24:05,952 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:05,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928702900] [2019-11-15 20:24:05,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:05,953 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:05,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:06,018 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 20:24:06,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928702900] [2019-11-15 20:24:06,021 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:06,021 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:06,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991116507] [2019-11-15 20:24:06,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:06,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:06,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:06,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:06,023 INFO L87 Difference]: Start difference. First operand 163 states and 241 transitions. Second operand 4 states. [2019-11-15 20:24:06,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:06,449 INFO L93 Difference]: Finished difference Result 324 states and 483 transitions. [2019-11-15 20:24:06,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:06,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-15 20:24:06,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:06,451 INFO L225 Difference]: With dead ends: 324 [2019-11-15 20:24:06,451 INFO L226 Difference]: Without dead ends: 180 [2019-11-15 20:24:06,452 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 20:24:06,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-15 20:24:06,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-15 20:24:06,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:24:06,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 240 transitions. [2019-11-15 20:24:06,460 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 240 transitions. Word has length 77 [2019-11-15 20:24:06,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:06,460 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 240 transitions. [2019-11-15 20:24:06,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:06,461 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 240 transitions. [2019-11-15 20:24:06,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-15 20:24:06,462 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:06,462 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] [2019-11-15 20:24:06,462 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:06,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:06,463 INFO L82 PathProgramCache]: Analyzing trace with hash -538440438, now seen corresponding path program 1 times [2019-11-15 20:24:06,463 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:06,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590474672] [2019-11-15 20:24:06,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:06,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:06,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:06,523 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 20:24:06,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590474672] [2019-11-15 20:24:06,524 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:06,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:06,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689137045] [2019-11-15 20:24:06,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:06,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:06,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:06,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:06,526 INFO L87 Difference]: Start difference. First operand 163 states and 240 transitions. Second operand 4 states. [2019-11-15 20:24:06,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:06,940 INFO L93 Difference]: Finished difference Result 324 states and 481 transitions. [2019-11-15 20:24:06,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:06,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-15 20:24:06,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:06,943 INFO L225 Difference]: With dead ends: 324 [2019-11-15 20:24:06,943 INFO L226 Difference]: Without dead ends: 180 [2019-11-15 20:24:06,943 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 20:24:06,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-15 20:24:06,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2019-11-15 20:24:06,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:24:06,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 239 transitions. [2019-11-15 20:24:06,951 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 239 transitions. Word has length 78 [2019-11-15 20:24:06,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:06,951 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 239 transitions. [2019-11-15 20:24:06,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:06,952 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 239 transitions. [2019-11-15 20:24:06,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-15 20:24:06,953 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:06,953 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] [2019-11-15 20:24:06,953 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:06,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:06,954 INFO L82 PathProgramCache]: Analyzing trace with hash -2007032891, now seen corresponding path program 1 times [2019-11-15 20:24:06,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:06,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447303863] [2019-11-15 20:24:06,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:06,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:06,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:07,015 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 20:24:07,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447303863] [2019-11-15 20:24:07,016 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:07,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:07,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335229068] [2019-11-15 20:24:07,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:07,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:07,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:07,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:07,018 INFO L87 Difference]: Start difference. First operand 163 states and 239 transitions. Second operand 4 states. [2019-11-15 20:24:07,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:07,416 INFO L93 Difference]: Finished difference Result 314 states and 466 transitions. [2019-11-15 20:24:07,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:07,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-15 20:24:07,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:07,418 INFO L225 Difference]: With dead ends: 314 [2019-11-15 20:24:07,418 INFO L226 Difference]: Without dead ends: 170 [2019-11-15 20:24:07,419 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 20:24:07,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-15 20:24:07,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2019-11-15 20:24:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-15 20:24:07,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2019-11-15 20:24:07,426 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 79 [2019-11-15 20:24:07,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:07,427 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2019-11-15 20:24:07,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:07,428 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2019-11-15 20:24:07,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 20:24:07,429 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:07,429 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 20:24:07,430 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:07,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:07,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1409260885, now seen corresponding path program 1 times [2019-11-15 20:24:07,430 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:07,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558375355] [2019-11-15 20:24:07,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:07,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:07,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:07,538 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 20:24:07,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558375355] [2019-11-15 20:24:07,539 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:07,539 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:07,539 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177167928] [2019-11-15 20:24:07,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:07,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:07,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:07,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:07,546 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand 4 states. [2019-11-15 20:24:08,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:08,085 INFO L93 Difference]: Finished difference Result 403 states and 603 transitions. [2019-11-15 20:24:08,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:08,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-15 20:24:08,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:08,088 INFO L225 Difference]: With dead ends: 403 [2019-11-15 20:24:08,088 INFO L226 Difference]: Without dead ends: 259 [2019-11-15 20:24:08,089 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 20:24:08,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-11-15 20:24:08,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 206. [2019-11-15 20:24:08,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-15 20:24:08,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 316 transitions. [2019-11-15 20:24:08,098 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 316 transitions. Word has length 84 [2019-11-15 20:24:08,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:08,099 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 316 transitions. [2019-11-15 20:24:08,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:08,099 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 316 transitions. [2019-11-15 20:24:08,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 20:24:08,101 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:08,101 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 20:24:08,101 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:08,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:08,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1988313133, now seen corresponding path program 1 times [2019-11-15 20:24:08,102 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:08,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84424466] [2019-11-15 20:24:08,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:08,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:08,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:08,183 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 20:24:08,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84424466] [2019-11-15 20:24:08,184 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:08,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:08,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716823041] [2019-11-15 20:24:08,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:08,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:08,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:08,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:08,186 INFO L87 Difference]: Start difference. First operand 206 states and 316 transitions. Second operand 4 states. [2019-11-15 20:24:08,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:08,569 INFO L93 Difference]: Finished difference Result 442 states and 685 transitions. [2019-11-15 20:24:08,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:08,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-11-15 20:24:08,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:08,572 INFO L225 Difference]: With dead ends: 442 [2019-11-15 20:24:08,572 INFO L226 Difference]: Without dead ends: 255 [2019-11-15 20:24:08,573 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 20:24:08,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-15 20:24:08,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-11-15 20:24:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 20:24:08,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 358 transitions. [2019-11-15 20:24:08,614 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 358 transitions. Word has length 84 [2019-11-15 20:24:08,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:08,615 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 358 transitions. [2019-11-15 20:24:08,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:08,615 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 358 transitions. [2019-11-15 20:24:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 20:24:08,616 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:08,617 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 20:24:08,617 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:08,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:08,618 INFO L82 PathProgramCache]: Analyzing trace with hash -40403587, now seen corresponding path program 1 times [2019-11-15 20:24:08,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:08,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097420917] [2019-11-15 20:24:08,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:08,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:08,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:08,712 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 20:24:08,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097420917] [2019-11-15 20:24:08,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:08,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:08,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880778508] [2019-11-15 20:24:08,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:08,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:08,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:08,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:08,715 INFO L87 Difference]: Start difference. First operand 230 states and 358 transitions. Second operand 4 states. [2019-11-15 20:24:09,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:09,348 INFO L93 Difference]: Finished difference Result 494 states and 764 transitions. [2019-11-15 20:24:09,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:09,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 20:24:09,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:09,351 INFO L225 Difference]: With dead ends: 494 [2019-11-15 20:24:09,351 INFO L226 Difference]: Without dead ends: 283 [2019-11-15 20:24:09,352 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 20:24:09,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-15 20:24:09,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 230. [2019-11-15 20:24:09,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 20:24:09,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 357 transitions. [2019-11-15 20:24:09,361 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 357 transitions. Word has length 97 [2019-11-15 20:24:09,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:09,362 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 357 transitions. [2019-11-15 20:24:09,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:09,362 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 357 transitions. [2019-11-15 20:24:09,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-15 20:24:09,363 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:09,363 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 20:24:09,364 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:09,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:09,364 INFO L82 PathProgramCache]: Analyzing trace with hash 271163, now seen corresponding path program 1 times [2019-11-15 20:24:09,364 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:09,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099990384] [2019-11-15 20:24:09,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:09,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:09,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:09,449 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 20:24:09,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099990384] [2019-11-15 20:24:09,450 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:09,450 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:09,450 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031887620] [2019-11-15 20:24:09,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:09,451 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:09,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:09,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:09,452 INFO L87 Difference]: Start difference. First operand 230 states and 357 transitions. Second operand 4 states. [2019-11-15 20:24:09,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:09,908 INFO L93 Difference]: Finished difference Result 466 states and 724 transitions. [2019-11-15 20:24:09,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:09,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-15 20:24:09,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:09,912 INFO L225 Difference]: With dead ends: 466 [2019-11-15 20:24:09,912 INFO L226 Difference]: Without dead ends: 255 [2019-11-15 20:24:09,913 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 20:24:09,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-15 20:24:09,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 230. [2019-11-15 20:24:09,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 20:24:09,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 356 transitions. [2019-11-15 20:24:09,922 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 356 transitions. Word has length 97 [2019-11-15 20:24:09,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:09,922 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 356 transitions. [2019-11-15 20:24:09,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:09,923 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 356 transitions. [2019-11-15 20:24:09,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 20:24:09,924 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:09,924 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] [2019-11-15 20:24:09,924 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:09,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:09,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1588160075, now seen corresponding path program 1 times [2019-11-15 20:24:09,925 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:09,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673187934] [2019-11-15 20:24:09,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:09,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:09,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:09,997 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 20:24:09,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673187934] [2019-11-15 20:24:09,998 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:09,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:09,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059359787] [2019-11-15 20:24:10,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:10,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:10,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:10,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:10,001 INFO L87 Difference]: Start difference. First operand 230 states and 356 transitions. Second operand 4 states. [2019-11-15 20:24:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:10,557 INFO L93 Difference]: Finished difference Result 493 states and 759 transitions. [2019-11-15 20:24:10,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:10,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 20:24:10,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:10,560 INFO L225 Difference]: With dead ends: 493 [2019-11-15 20:24:10,560 INFO L226 Difference]: Without dead ends: 282 [2019-11-15 20:24:10,561 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 20:24:10,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-15 20:24:10,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 230. [2019-11-15 20:24:10,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 20:24:10,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 355 transitions. [2019-11-15 20:24:10,571 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 355 transitions. Word has length 98 [2019-11-15 20:24:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:10,571 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 355 transitions. [2019-11-15 20:24:10,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 355 transitions. [2019-11-15 20:24:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 20:24:10,573 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:10,573 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 20:24:10,573 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:10,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:10,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1363613770, now seen corresponding path program 1 times [2019-11-15 20:24:10,574 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:10,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103862328] [2019-11-15 20:24:10,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:10,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:10,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:10,665 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 20:24:10,666 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103862328] [2019-11-15 20:24:10,666 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:10,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:10,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868490438] [2019-11-15 20:24:10,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:10,667 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:10,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:10,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:10,669 INFO L87 Difference]: Start difference. First operand 230 states and 355 transitions. Second operand 4 states. [2019-11-15 20:24:11,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:11,224 INFO L93 Difference]: Finished difference Result 491 states and 755 transitions. [2019-11-15 20:24:11,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:11,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 20:24:11,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:11,228 INFO L225 Difference]: With dead ends: 491 [2019-11-15 20:24:11,228 INFO L226 Difference]: Without dead ends: 280 [2019-11-15 20:24:11,229 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 20:24:11,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-11-15 20:24:11,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 230. [2019-11-15 20:24:11,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 20:24:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 354 transitions. [2019-11-15 20:24:11,239 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 354 transitions. Word has length 98 [2019-11-15 20:24:11,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:11,239 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 354 transitions. [2019-11-15 20:24:11,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:11,240 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 354 transitions. [2019-11-15 20:24:11,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 20:24:11,241 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:11,241 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 20:24:11,241 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:11,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:11,242 INFO L82 PathProgramCache]: Analyzing trace with hash -414265610, now seen corresponding path program 1 times [2019-11-15 20:24:11,242 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:11,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616874720] [2019-11-15 20:24:11,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:11,243 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:11,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:11,328 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 20:24:11,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616874720] [2019-11-15 20:24:11,329 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:11,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:11,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190920560] [2019-11-15 20:24:11,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:11,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:11,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:11,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:11,331 INFO L87 Difference]: Start difference. First operand 230 states and 354 transitions. Second operand 4 states. [2019-11-15 20:24:11,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:11,902 INFO L93 Difference]: Finished difference Result 490 states and 752 transitions. [2019-11-15 20:24:11,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:11,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 20:24:11,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:11,905 INFO L225 Difference]: With dead ends: 490 [2019-11-15 20:24:11,905 INFO L226 Difference]: Without dead ends: 279 [2019-11-15 20:24:11,906 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 20:24:11,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-15 20:24:11,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 230. [2019-11-15 20:24:11,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-15 20:24:11,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 353 transitions. [2019-11-15 20:24:11,915 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 353 transitions. Word has length 98 [2019-11-15 20:24:11,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:11,915 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 353 transitions. [2019-11-15 20:24:11,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:11,916 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 353 transitions. [2019-11-15 20:24:11,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 20:24:11,917 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:11,917 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] [2019-11-15 20:24:11,918 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:11,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:11,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1868796449, now seen corresponding path program 1 times [2019-11-15 20:24:11,919 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:11,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126626769] [2019-11-15 20:24:11,919 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:11,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:11,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:12,029 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 20:24:12,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126626769] [2019-11-15 20:24:12,030 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:12,031 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 20:24:12,031 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136468401] [2019-11-15 20:24:12,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 20:24:12,032 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:12,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:24:12,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:24:12,033 INFO L87 Difference]: Start difference. First operand 230 states and 353 transitions. Second operand 5 states. [2019-11-15 20:24:12,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:12,683 INFO L93 Difference]: Finished difference Result 462 states and 714 transitions. [2019-11-15 20:24:12,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:24:12,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-11-15 20:24:12,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:12,686 INFO L225 Difference]: With dead ends: 462 [2019-11-15 20:24:12,686 INFO L226 Difference]: Without dead ends: 251 [2019-11-15 20:24:12,687 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 20:24:12,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-15 20:24:12,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-11-15 20:24:12,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:24:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 379 transitions. [2019-11-15 20:24:12,695 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 379 transitions. Word has length 98 [2019-11-15 20:24:12,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:12,696 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 379 transitions. [2019-11-15 20:24:12,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 20:24:12,696 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 379 transitions. [2019-11-15 20:24:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 20:24:12,697 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:12,698 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 20:24:12,698 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:12,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:12,699 INFO L82 PathProgramCache]: Analyzing trace with hash -102696520, now seen corresponding path program 1 times [2019-11-15 20:24:12,699 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:12,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190916418] [2019-11-15 20:24:12,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:12,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:12,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:12,787 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 20:24:12,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190916418] [2019-11-15 20:24:12,788 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:12,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:12,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217685876] [2019-11-15 20:24:12,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:12,789 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:12,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:12,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:12,790 INFO L87 Difference]: Start difference. First operand 250 states and 379 transitions. Second operand 4 states. [2019-11-15 20:24:13,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:13,152 INFO L93 Difference]: Finished difference Result 503 states and 764 transitions. [2019-11-15 20:24:13,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:13,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 20:24:13,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:13,155 INFO L225 Difference]: With dead ends: 503 [2019-11-15 20:24:13,155 INFO L226 Difference]: Without dead ends: 272 [2019-11-15 20:24:13,156 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 20:24:13,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-15 20:24:13,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 250. [2019-11-15 20:24:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:24:13,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 378 transitions. [2019-11-15 20:24:13,165 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 378 transitions. Word has length 98 [2019-11-15 20:24:13,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:13,166 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 378 transitions. [2019-11-15 20:24:13,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:13,166 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 378 transitions. [2019-11-15 20:24:13,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 20:24:13,167 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:13,167 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 20:24:13,168 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:13,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:13,168 INFO L82 PathProgramCache]: Analyzing trace with hash 846651640, now seen corresponding path program 1 times [2019-11-15 20:24:13,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:13,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343790273] [2019-11-15 20:24:13,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:13,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:13,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:13,235 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 20:24:13,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343790273] [2019-11-15 20:24:13,236 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:13,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:13,236 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265445442] [2019-11-15 20:24:13,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:13,236 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:13,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:13,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:13,237 INFO L87 Difference]: Start difference. First operand 250 states and 378 transitions. Second operand 4 states. [2019-11-15 20:24:13,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:13,668 INFO L93 Difference]: Finished difference Result 502 states and 761 transitions. [2019-11-15 20:24:13,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:13,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-15 20:24:13,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:13,671 INFO L225 Difference]: With dead ends: 502 [2019-11-15 20:24:13,671 INFO L226 Difference]: Without dead ends: 271 [2019-11-15 20:24:13,672 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 20:24:13,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-15 20:24:13,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-15 20:24:13,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:24:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 377 transitions. [2019-11-15 20:24:13,680 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 377 transitions. Word has length 98 [2019-11-15 20:24:13,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:13,681 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 377 transitions. [2019-11-15 20:24:13,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:13,681 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 377 transitions. [2019-11-15 20:24:13,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 20:24:13,682 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:13,683 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 20:24:13,683 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:13,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:13,683 INFO L82 PathProgramCache]: Analyzing trace with hash 651492985, now seen corresponding path program 1 times [2019-11-15 20:24:13,684 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:13,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920065700] [2019-11-15 20:24:13,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:13,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:13,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:13,755 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 20:24:13,755 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920065700] [2019-11-15 20:24:13,755 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:13,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:13,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576822578] [2019-11-15 20:24:13,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:13,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:13,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:13,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:13,758 INFO L87 Difference]: Start difference. First operand 250 states and 377 transitions. Second operand 4 states. [2019-11-15 20:24:14,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:14,234 INFO L93 Difference]: Finished difference Result 530 states and 797 transitions. [2019-11-15 20:24:14,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:14,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 20:24:14,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:14,239 INFO L225 Difference]: With dead ends: 530 [2019-11-15 20:24:14,239 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 20:24:14,240 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 20:24:14,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 20:24:14,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-11-15 20:24:14,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:24:14,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 376 transitions. [2019-11-15 20:24:14,254 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 376 transitions. Word has length 99 [2019-11-15 20:24:14,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:14,255 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 376 transitions. [2019-11-15 20:24:14,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:14,255 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 376 transitions. [2019-11-15 20:24:14,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 20:24:14,256 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:14,257 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 20:24:14,257 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:14,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:14,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1085222071, now seen corresponding path program 1 times [2019-11-15 20:24:14,257 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:14,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492660202] [2019-11-15 20:24:14,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:14,261 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:14,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:14,327 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 20:24:14,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492660202] [2019-11-15 20:24:14,329 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:14,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:14,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544976929] [2019-11-15 20:24:14,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:14,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:14,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:14,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:14,331 INFO L87 Difference]: Start difference. First operand 250 states and 376 transitions. Second operand 4 states. [2019-11-15 20:24:14,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:14,774 INFO L93 Difference]: Finished difference Result 502 states and 757 transitions. [2019-11-15 20:24:14,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:14,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-15 20:24:14,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:14,777 INFO L225 Difference]: With dead ends: 502 [2019-11-15 20:24:14,777 INFO L226 Difference]: Without dead ends: 271 [2019-11-15 20:24:14,778 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 20:24:14,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-15 20:24:14,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-15 20:24:14,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:24:14,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 375 transitions. [2019-11-15 20:24:14,788 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 375 transitions. Word has length 99 [2019-11-15 20:24:14,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:14,788 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 375 transitions. [2019-11-15 20:24:14,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:14,788 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 375 transitions. [2019-11-15 20:24:14,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 20:24:14,790 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:14,790 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] [2019-11-15 20:24:14,790 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:14,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:14,791 INFO L82 PathProgramCache]: Analyzing trace with hash 199692210, now seen corresponding path program 1 times [2019-11-15 20:24:14,791 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:14,791 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145596592] [2019-11-15 20:24:14,791 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:14,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:14,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:14,889 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 20:24:14,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145596592] [2019-11-15 20:24:14,889 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:14,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:14,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650360342] [2019-11-15 20:24:14,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:14,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:14,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:14,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:14,891 INFO L87 Difference]: Start difference. First operand 250 states and 375 transitions. Second operand 4 states. [2019-11-15 20:24:15,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:15,395 INFO L93 Difference]: Finished difference Result 530 states and 793 transitions. [2019-11-15 20:24:15,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:15,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-15 20:24:15,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:15,398 INFO L225 Difference]: With dead ends: 530 [2019-11-15 20:24:15,398 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 20:24:15,399 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 20:24:15,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 20:24:15,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-11-15 20:24:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:24:15,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 374 transitions. [2019-11-15 20:24:15,408 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 374 transitions. Word has length 100 [2019-11-15 20:24:15,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:15,408 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 374 transitions. [2019-11-15 20:24:15,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:15,408 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 374 transitions. [2019-11-15 20:24:15,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 20:24:15,409 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:15,410 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] [2019-11-15 20:24:15,410 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:15,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:15,411 INFO L82 PathProgramCache]: Analyzing trace with hash 760391988, now seen corresponding path program 1 times [2019-11-15 20:24:15,411 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:15,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9759471] [2019-11-15 20:24:15,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:15,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:15,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:15,491 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 20:24:15,491 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9759471] [2019-11-15 20:24:15,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:15,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:15,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451090828] [2019-11-15 20:24:15,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:15,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:15,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:15,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:15,494 INFO L87 Difference]: Start difference. First operand 250 states and 374 transitions. Second operand 4 states. [2019-11-15 20:24:15,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:15,961 INFO L93 Difference]: Finished difference Result 502 states and 753 transitions. [2019-11-15 20:24:15,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:15,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-11-15 20:24:15,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:15,964 INFO L225 Difference]: With dead ends: 502 [2019-11-15 20:24:15,964 INFO L226 Difference]: Without dead ends: 271 [2019-11-15 20:24:15,964 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 20:24:15,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-15 20:24:15,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-15 20:24:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:24:15,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 373 transitions. [2019-11-15 20:24:15,974 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 373 transitions. Word has length 100 [2019-11-15 20:24:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:15,975 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 373 transitions. [2019-11-15 20:24:15,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:15,975 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 373 transitions. [2019-11-15 20:24:15,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 20:24:15,976 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:15,977 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] [2019-11-15 20:24:15,977 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:15,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:15,977 INFO L82 PathProgramCache]: Analyzing trace with hash -2123930572, now seen corresponding path program 1 times [2019-11-15 20:24:15,978 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:15,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328450417] [2019-11-15 20:24:15,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:15,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:15,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:16,051 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 20:24:16,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328450417] [2019-11-15 20:24:16,051 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:16,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:16,052 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71179749] [2019-11-15 20:24:16,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:16,053 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:16,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:16,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:16,053 INFO L87 Difference]: Start difference. First operand 250 states and 373 transitions. Second operand 4 states. [2019-11-15 20:24:16,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:16,535 INFO L93 Difference]: Finished difference Result 530 states and 789 transitions. [2019-11-15 20:24:16,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:16,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-15 20:24:16,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:16,538 INFO L225 Difference]: With dead ends: 530 [2019-11-15 20:24:16,538 INFO L226 Difference]: Without dead ends: 299 [2019-11-15 20:24:16,539 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 20:24:16,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-11-15 20:24:16,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 250. [2019-11-15 20:24:16,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:24:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 372 transitions. [2019-11-15 20:24:16,548 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 372 transitions. Word has length 101 [2019-11-15 20:24:16,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:16,548 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 372 transitions. [2019-11-15 20:24:16,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:16,548 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 372 transitions. [2019-11-15 20:24:16,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 20:24:16,549 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:16,550 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] [2019-11-15 20:24:16,550 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:16,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:16,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1922106638, now seen corresponding path program 1 times [2019-11-15 20:24:16,551 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:16,551 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253405051] [2019-11-15 20:24:16,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:16,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:16,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:16,628 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 20:24:16,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253405051] [2019-11-15 20:24:16,628 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:16,629 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:16,629 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183768440] [2019-11-15 20:24:16,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:16,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:16,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:16,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:16,630 INFO L87 Difference]: Start difference. First operand 250 states and 372 transitions. Second operand 4 states. [2019-11-15 20:24:17,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:17,094 INFO L93 Difference]: Finished difference Result 502 states and 749 transitions. [2019-11-15 20:24:17,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:17,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-11-15 20:24:17,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:17,097 INFO L225 Difference]: With dead ends: 502 [2019-11-15 20:24:17,098 INFO L226 Difference]: Without dead ends: 271 [2019-11-15 20:24:17,098 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 20:24:17,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-11-15 20:24:17,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 250. [2019-11-15 20:24:17,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:24:17,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2019-11-15 20:24:17,107 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 101 [2019-11-15 20:24:17,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:17,108 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2019-11-15 20:24:17,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:17,108 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2019-11-15 20:24:17,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-15 20:24:17,109 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:17,110 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] [2019-11-15 20:24:17,110 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:17,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:17,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1950473869, now seen corresponding path program 1 times [2019-11-15 20:24:17,111 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:17,111 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608796250] [2019-11-15 20:24:17,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:17,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:17,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:17,204 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 20:24:17,205 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608796250] [2019-11-15 20:24:17,205 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:17,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:17,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542213251] [2019-11-15 20:24:17,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:17,206 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:17,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:17,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:17,207 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 4 states. [2019-11-15 20:24:17,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:17,641 INFO L93 Difference]: Finished difference Result 520 states and 773 transitions. [2019-11-15 20:24:17,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:17,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-15 20:24:17,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:17,644 INFO L225 Difference]: With dead ends: 520 [2019-11-15 20:24:17,644 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 20:24:17,645 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 20:24:17,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 20:24:17,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2019-11-15 20:24:17,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:24:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 370 transitions. [2019-11-15 20:24:17,655 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 370 transitions. Word has length 102 [2019-11-15 20:24:17,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:17,656 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 370 transitions. [2019-11-15 20:24:17,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:17,656 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 370 transitions. [2019-11-15 20:24:17,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-15 20:24:17,657 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:17,658 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] [2019-11-15 20:24:17,658 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:17,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:17,659 INFO L82 PathProgramCache]: Analyzing trace with hash -382918769, now seen corresponding path program 1 times [2019-11-15 20:24:17,659 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:17,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994110989] [2019-11-15 20:24:17,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:17,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:17,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:17,743 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 20:24:17,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994110989] [2019-11-15 20:24:17,743 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:17,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:17,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157908410] [2019-11-15 20:24:17,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:17,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:17,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:17,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:17,745 INFO L87 Difference]: Start difference. First operand 250 states and 370 transitions. Second operand 4 states. [2019-11-15 20:24:18,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:18,092 INFO L93 Difference]: Finished difference Result 492 states and 733 transitions. [2019-11-15 20:24:18,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:18,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-15 20:24:18,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:18,094 INFO L225 Difference]: With dead ends: 492 [2019-11-15 20:24:18,094 INFO L226 Difference]: Without dead ends: 261 [2019-11-15 20:24:18,095 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 20:24:18,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-15 20:24:18,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 250. [2019-11-15 20:24:18,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:24:18,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 369 transitions. [2019-11-15 20:24:18,104 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 369 transitions. Word has length 102 [2019-11-15 20:24:18,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:18,104 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 369 transitions. [2019-11-15 20:24:18,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:18,105 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 369 transitions. [2019-11-15 20:24:18,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 20:24:18,106 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:18,106 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 20:24:18,106 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:18,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:18,107 INFO L82 PathProgramCache]: Analyzing trace with hash -2022470311, now seen corresponding path program 1 times [2019-11-15 20:24:18,107 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:18,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46327357] [2019-11-15 20:24:18,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:18,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:18,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:18,200 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 20:24:18,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46327357] [2019-11-15 20:24:18,201 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:18,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:24:18,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117167489] [2019-11-15 20:24:18,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:18,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:18,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:18,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:18,203 INFO L87 Difference]: Start difference. First operand 250 states and 369 transitions. Second operand 4 states. [2019-11-15 20:24:18,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:18,723 INFO L93 Difference]: Finished difference Result 520 states and 769 transitions. [2019-11-15 20:24:18,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:18,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-15 20:24:18,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:18,725 INFO L225 Difference]: With dead ends: 520 [2019-11-15 20:24:18,725 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 20:24:18,725 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 20:24:18,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 20:24:18,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 250. [2019-11-15 20:24:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-15 20:24:18,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2019-11-15 20:24:18,734 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 106 [2019-11-15 20:24:18,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:18,734 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2019-11-15 20:24:18,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:18,735 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2019-11-15 20:24:18,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-15 20:24:18,736 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:18,736 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 20:24:18,736 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:18,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:18,736 INFO L82 PathProgramCache]: Analyzing trace with hash 586317147, now seen corresponding path program 1 times [2019-11-15 20:24:18,737 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:18,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879167614] [2019-11-15 20:24:18,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:18,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:18,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:18,811 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 20:24:18,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879167614] [2019-11-15 20:24:18,812 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:18,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:24:18,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005640881] [2019-11-15 20:24:18,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 20:24:18,813 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:24:18,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:24:18,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:24:18,813 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand 3 states. [2019-11-15 20:24:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:18,853 INFO L93 Difference]: Finished difference Result 710 states and 1059 transitions. [2019-11-15 20:24:18,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:24:18,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-15 20:24:18,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:18,857 INFO L225 Difference]: With dead ends: 710 [2019-11-15 20:24:18,857 INFO L226 Difference]: Without dead ends: 479 [2019-11-15 20:24:18,858 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 20:24:18,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-11-15 20:24:18,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2019-11-15 20:24:18,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-11-15 20:24:18,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 711 transitions. [2019-11-15 20:24:18,874 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 711 transitions. Word has length 106 [2019-11-15 20:24:18,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:18,875 INFO L462 AbstractCegarLoop]: Abstraction has 479 states and 711 transitions. [2019-11-15 20:24:18,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 20:24:18,875 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 711 transitions. [2019-11-15 20:24:18,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-15 20:24:18,877 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:18,877 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 20:24:18,878 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:18,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:18,878 INFO L82 PathProgramCache]: Analyzing trace with hash -536013004, now seen corresponding path program 1 times [2019-11-15 20:24:18,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:24:18,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500205722] [2019-11-15 20:24:18,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:18,879 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:24:18,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:24:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:24:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:24:19,268 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:24:19,269 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:24:19,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:24:19 BoogieIcfgContainer [2019-11-15 20:24:19,450 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:24:19,451 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:24:19,451 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:24:19,457 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:24:19,457 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:23:57" (3/4) ... [2019-11-15 20:24:19,461 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:24:19,461 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:24:19,463 INFO L168 Benchmark]: Toolchain (without parser) took 25119.64 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 410.5 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -179.8 MB). Peak memory consumption was 230.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:24:19,464 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:24:19,465 INFO L168 Benchmark]: CACSL2BoogieTranslator took 983.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:24:19,465 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.05 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:24:19,466 INFO L168 Benchmark]: Boogie Preprocessor took 185.74 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:24:19,466 INFO L168 Benchmark]: RCFGBuilder took 1587.00 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: 94.7 MB). Peak memory consumption was 94.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:24:19,467 INFO L168 Benchmark]: TraceAbstraction took 22219.23 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 265.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -118.0 MB). Peak memory consumption was 147.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:24:19,467 INFO L168 Benchmark]: Witness Printer took 10.90 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 20:24:19,470 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 983.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 127.05 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 185.74 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1587.00 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: 94.7 MB). Peak memory consumption was 94.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22219.23 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 265.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -118.0 MB). Peak memory consumption was 147.3 MB. Max. memory is 11.5 GB. * Witness Printer took 10.90 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: 1703]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={-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 ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-3:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-3:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={-3:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={-3:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={-3:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={-3:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1229] COND TRUE s->state == 8656 [L1555] EXPR s->session [L1555] EXPR s->s3 [L1555] EXPR (s->s3)->tmp.new_cipher [L1555] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1556] COND FALSE !(! tmp___9) [L1562] ret = __VERIFIER_nondet_int() [L1563] COND TRUE blastFlag == 2 [L1564] blastFlag = 3 VAL [init=1, SSLv3_server_data={-3:0}] [L1568] COND FALSE !(ret <= 0) [L1573] s->state = 8672 [L1574] s->init_num = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1575] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-3:0}] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-3:0}] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [init=1, SSLv3_server_data={-3:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-3:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={-3:0}] [L1235] COND TRUE s->state == 8672 [L1584] ret = __VERIFIER_nondet_int() [L1585] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={-3:0}] [L1703] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 22.1s, OverallIterations: 39, TraceHistogramMax: 4, AutomataDifference: 17.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7073 SDtfs, 2105 SDslu, 10093 SDs, 0 SdLazy, 6911 SolverSat, 339 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 227 GetRequests, 84 SyntacticMatches, 33 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 38 MinimizatonAttempts, 924 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 3288 NumberOfCodeBlocks, 3288 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3125 ConstructedInterpolants, 0 QuantifiedInterpolants, 741519 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 1564/1564 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 20:24:22,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:24:22,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:24:22,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:24:22,119 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:24:22,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:24:22,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:24:22,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:24:22,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:24:22,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:24:22,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:24:22,131 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:24:22,131 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:24:22,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:24:22,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:24:22,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:24:22,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:24:22,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:24:22,140 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:24:22,143 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:24:22,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:24:22,146 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:24:22,147 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:24:22,148 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:24:22,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:24:22,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:24:22,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:24:22,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:24:22,154 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:24:22,155 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:24:22,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:24:22,156 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:24:22,157 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:24:22,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:24:22,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:24:22,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:24:22,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:24:22,161 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:24:22,161 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:24:22,162 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:24:22,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:24:22,164 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 20:24:22,185 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:24:22,185 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:24:22,187 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:24:22,188 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:24:22,188 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:24:22,188 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:24:22,189 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:24:22,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:24:22,190 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:24:22,190 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:24:22,190 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:24:22,190 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:24:22,191 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 20:24:22,191 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 20:24:22,191 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:24:22,191 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:24:22,192 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:24:22,192 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:24:22,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:24:22,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:24:22,192 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:24:22,193 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:24:22,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:24:22,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:24:22,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:24:22,193 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:24:22,194 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 20:24:22,194 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 20:24:22,194 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:24:22,194 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 20:24:22,194 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_74342e07-86bc-48cb-9b34-3f271c41e9ad/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 -> 09d651c8899349531493fefbd169797d0022b4a3 [2019-11-15 20:24:22,237 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:24:22,249 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:24:22,254 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:24:22,257 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:24:22,257 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:24:22,258 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c [2019-11-15 20:24:22,338 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/bin/uautomizer/data/5df7267b8/92e54c8844304368ba0edac0bd87fcd3/FLAG89c3c6ecd [2019-11-15 20:24:23,009 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:24:23,010 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/sv-benchmarks/c/ssh/s3_srvr.blast.03.i.cil.c [2019-11-15 20:24:23,042 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/bin/uautomizer/data/5df7267b8/92e54c8844304368ba0edac0bd87fcd3/FLAG89c3c6ecd [2019-11-15 20:24:23,106 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/bin/uautomizer/data/5df7267b8/92e54c8844304368ba0edac0bd87fcd3 [2019-11-15 20:24:23,110 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:24:23,112 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:24:23,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:24:23,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:24:23,121 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:24:23,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:24:23" (1/1) ... [2019-11-15 20:24:23,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b87d831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:24:23, skipping insertion in model container [2019-11-15 20:24:23,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:24:23" (1/1) ... [2019-11-15 20:24:23,135 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:24:23,213 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:24:23,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:24:23,810 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:24:23,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:24:23,970 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:24:23,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:24:23 WrapperNode [2019-11-15 20:24:23,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:24:23,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:24:23,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:24:23,973 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:24:23,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:24:23" (1/1) ... [2019-11-15 20:24:24,014 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:24:23" (1/1) ... [2019-11-15 20:24:24,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:24:24,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:24:24,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:24:24,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:24:24,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:24:23" (1/1) ... [2019-11-15 20:24:24,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:24:23" (1/1) ... [2019-11-15 20:24:24,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:24:23" (1/1) ... [2019-11-15 20:24:24,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:24:23" (1/1) ... [2019-11-15 20:24:24,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:24:23" (1/1) ... [2019-11-15 20:24:24,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:24:23" (1/1) ... [2019-11-15 20:24:24,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:24:23" (1/1) ... [2019-11-15 20:24:24,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:24:24,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:24:24,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:24:24,164 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:24:24,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:24:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/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 20:24:24,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 20:24:24,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:24:24,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 20:24:24,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 20:24:24,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 20:24:24,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:24:24,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:24:24,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 20:24:24,587 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 20:24:27,905 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 20:24:27,905 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 20:24:27,907 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:24:27,907 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 20:24:27,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:24:27 BoogieIcfgContainer [2019-11-15 20:24:27,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:24:27,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:24:27,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:24:27,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:24:27,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:24:23" (1/3) ... [2019-11-15 20:24:27,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a13da5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:24:27, skipping insertion in model container [2019-11-15 20:24:27,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:24:23" (2/3) ... [2019-11-15 20:24:27,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a13da5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:24:27, skipping insertion in model container [2019-11-15 20:24:27,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:24:27" (3/3) ... [2019-11-15 20:24:27,921 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03.i.cil.c [2019-11-15 20:24:27,932 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:24:27,942 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:24:27,954 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:24:27,992 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:24:27,992 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:24:27,992 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:24:27,992 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:24:27,993 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:24:27,993 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:24:27,993 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:24:27,993 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:24:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-15 20:24:28,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 20:24:28,043 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:28,045 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 20:24:28,048 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:28,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:28,055 INFO L82 PathProgramCache]: Analyzing trace with hash 522837677, now seen corresponding path program 1 times [2019-11-15 20:24:28,069 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:24:28,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [555387119] [2019-11-15 20:24:28,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/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 20:24:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:28,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:24:28,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:24:28,384 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 20:24:28,385 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:24:28,419 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 20:24:28,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [555387119] [2019-11-15 20:24:28,421 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:28,422 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 20:24:28,422 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78352223] [2019-11-15 20:24:28,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:28,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:24:28,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:28,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:28,447 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2019-11-15 20:24:28,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:28,619 INFO L93 Difference]: Finished difference Result 537 states and 912 transitions. [2019-11-15 20:24:28,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:28,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-15 20:24:28,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:28,645 INFO L225 Difference]: With dead ends: 537 [2019-11-15 20:24:28,646 INFO L226 Difference]: Without dead ends: 363 [2019-11-15 20:24:28,651 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 20:24:28,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-11-15 20:24:28,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2019-11-15 20:24:28,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-11-15 20:24:28,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 551 transitions. [2019-11-15 20:24:28,745 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 551 transitions. Word has length 45 [2019-11-15 20:24:28,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:28,746 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 551 transitions. [2019-11-15 20:24:28,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:28,746 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 551 transitions. [2019-11-15 20:24:28,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-15 20:24:28,754 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:28,755 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:24:28,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:24:28,958 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:28,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:28,959 INFO L82 PathProgramCache]: Analyzing trace with hash 856140206, now seen corresponding path program 1 times [2019-11-15 20:24:28,960 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:24:28,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [458837534] [2019-11-15 20:24:28,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/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 20:24:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:24:29,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:24:29,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:24:29,331 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:24:29,331 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:24:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:24:29,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [458837534] [2019-11-15 20:24:29,390 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:24:29,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 20:24:29,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699855333] [2019-11-15 20:24:29,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 20:24:29,395 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:24:29,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:24:29,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:29,396 INFO L87 Difference]: Start difference. First operand 363 states and 551 transitions. Second operand 4 states. [2019-11-15 20:24:30,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:24:30,176 INFO L93 Difference]: Finished difference Result 834 states and 1272 transitions. [2019-11-15 20:24:30,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:24:30,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-15 20:24:30,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:24:30,183 INFO L225 Difference]: With dead ends: 834 [2019-11-15 20:24:30,183 INFO L226 Difference]: Without dead ends: 598 [2019-11-15 20:24:30,185 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:24:30,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-11-15 20:24:30,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-11-15 20:24:30,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-15 20:24:30,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 906 transitions. [2019-11-15 20:24:30,238 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 906 transitions. Word has length 103 [2019-11-15 20:24:30,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:24:30,239 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 906 transitions. [2019-11-15 20:24:30,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 20:24:30,240 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 906 transitions. [2019-11-15 20:24:30,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-15 20:24:30,248 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:24:30,248 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 20:24:30,451 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:24:30,452 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:24:30,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:24:30,452 INFO L82 PathProgramCache]: Analyzing trace with hash -536013004, now seen corresponding path program 1 times [2019-11-15 20:24:30,453 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:24:30,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1219122957] [2019-11-15 20:24:30,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/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 20:24:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:24:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:24:33,428 INFO L168 tionRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-15 20:24:33,428 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:24:33,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 20:24:33,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:24:33 BoogieIcfgContainer [2019-11-15 20:24:33,844 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:24:33,844 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:24:33,844 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:24:33,845 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:24:33,845 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:24:27" (3/4) ... [2019-11-15 20:24:33,851 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 20:24:34,029 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_74342e07-86bc-48cb-9b34-3f271c41e9ad/bin/uautomizer/witness.graphml [2019-11-15 20:24:34,029 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:24:34,032 INFO L168 Benchmark]: Toolchain (without parser) took 10919.69 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 241.7 MB). Free memory was 941.5 MB in the beginning and 1.2 GB in the end (delta: -221.7 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:24:34,032 INFO L168 Benchmark]: CDTParser took 0.30 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 20:24:34,033 INFO L168 Benchmark]: CACSL2BoogieTranslator took 855.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -203.2 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:24:34,033 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.05 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 20:24:34,034 INFO L168 Benchmark]: Boogie Preprocessor took 90.29 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 20:24:34,034 INFO L168 Benchmark]: RCFGBuilder took 3746.00 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.3 MB). Peak memory consumption was 90.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:24:34,035 INFO L168 Benchmark]: TraceAbstraction took 5933.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -137.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:24:34,035 INFO L168 Benchmark]: Witness Printer took 185.37 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:24:34,037 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.30 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 855.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -203.2 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 100.05 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 90.29 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 3746.00 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.3 MB). Peak memory consumption was 90.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5933.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 69.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -137.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 185.37 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 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: 1703]: 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={-1476592689:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1229] COND TRUE s->state == 8656 [L1555] EXPR s->session [L1555] EXPR s->s3 [L1555] EXPR (s->s3)->tmp.new_cipher [L1555] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1556] COND FALSE !(! tmp___9) [L1562] ret = __VERIFIER_nondet_int() [L1563] COND TRUE blastFlag == 2 [L1564] blastFlag = 3 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1568] COND FALSE !(ret <= 0) [L1573] s->state = 8672 [L1574] s->init_num = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1575] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1662] EXPR s->s3 [L1662] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1662] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1691] skip = 0 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1235] COND TRUE s->state == 8672 [L1584] ret = __VERIFIER_nondet_int() [L1585] COND TRUE blastFlag == 3 VAL [init=1, SSLv3_server_data={-1476592689:0}] [L1703] __VERIFIER_error() VAL [init=1, SSLv3_server_data={-1476592689:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 143 locations, 1 error locations. Result: UNSAFE, OverallTime: 5.8s, OverallIterations: 3, TraceHistogramMax: 4, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 588 SDtfs, 658 SDslu, 785 SDs, 0 SdLazy, 51 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=598occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 74336 SizeOfPredicates, 1 NumberOfNonLiveVariables, 397 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 116/116 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...