./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.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_7f9c6f75-7152-4da0-8b22-cc40950d71de/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/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 ed035556db4b60d2bb3e3e70af5f975a04e628c4 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_7f9c6f75-7152-4da0-8b22-cc40950d71de/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/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 ed035556db4b60d2bb3e3e70af5f975a04e628c4 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 21:20:43,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:20:43,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:20:43,335 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:20:43,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:20:43,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:20:43,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:20:43,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:20:43,355 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:20:43,356 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:20:43,357 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:20:43,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:20:43,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:20:43,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:20:43,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:20:43,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:20:43,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:20:43,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:20:43,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:20:43,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:20:43,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:20:43,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:20:43,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:20:43,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:20:43,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:20:43,381 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:20:43,382 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:20:43,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:20:43,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:20:43,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:20:43,386 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:20:43,387 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:20:43,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:20:43,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:20:43,392 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:20:43,393 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:20:43,394 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:20:43,395 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:20:43,395 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:20:43,398 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:20:43,399 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:20:43,401 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:20:43,434 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:20:43,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:20:43,442 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:20:43,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:20:43,443 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:20:43,443 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:20:43,443 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:20:43,443 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:20:43,444 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:20:43,451 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:20:43,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:20:43,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:20:43,452 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:20:43,453 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:20:43,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:20:43,453 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:20:43,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:20:43,454 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:20:43,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:20:43,454 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:20:43,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:20:43,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:20:43,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:20:43,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:20:43,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:20:43,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:20:43,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:20:43,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:20:43,457 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_7f9c6f75-7152-4da0-8b22-cc40950d71de/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 -> ed035556db4b60d2bb3e3e70af5f975a04e628c4 [2019-11-15 21:20:43,501 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:20:43,518 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:20:43,523 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:20:43,525 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:20:43,526 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:20:43,527 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c [2019-11-15 21:20:43,603 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/bin/uautomizer/data/9da7f544f/c3e611805e7343a0a19ea6a40f34be46/FLAG54248561b [2019-11-15 21:20:44,237 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:20:44,238 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c [2019-11-15 21:20:44,259 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/bin/uautomizer/data/9da7f544f/c3e611805e7343a0a19ea6a40f34be46/FLAG54248561b [2019-11-15 21:20:44,447 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/bin/uautomizer/data/9da7f544f/c3e611805e7343a0a19ea6a40f34be46 [2019-11-15 21:20:44,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:20:44,454 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:20:44,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:20:44,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:20:44,462 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:20:44,463 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:20:44" (1/1) ... [2019-11-15 21:20:44,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f09ad54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:44, skipping insertion in model container [2019-11-15 21:20:44,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:20:44" (1/1) ... [2019-11-15 21:20:44,474 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:20:44,566 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:20:45,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:20:45,214 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:20:45,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:20:45,391 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:20:45,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45 WrapperNode [2019-11-15 21:20:45,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:20:45,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:20:45,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:20:45,393 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:20:45,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45" (1/1) ... [2019-11-15 21:20:45,430 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45" (1/1) ... [2019-11-15 21:20:45,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:20:45,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:20:45,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:20:45,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:20:45,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45" (1/1) ... [2019-11-15 21:20:45,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45" (1/1) ... [2019-11-15 21:20:45,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45" (1/1) ... [2019-11-15 21:20:45,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45" (1/1) ... [2019-11-15 21:20:45,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45" (1/1) ... [2019-11-15 21:20:45,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45" (1/1) ... [2019-11-15 21:20:45,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45" (1/1) ... [2019-11-15 21:20:45,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:20:45,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:20:45,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:20:45,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:20:45,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/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 21:20:45,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:20:45,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:20:45,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:20:45,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:20:45,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:20:45,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:20:45,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:20:45,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:20:46,052 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:20:47,060 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-15 21:20:47,061 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-15 21:20:47,065 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:20:47,066 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:20:47,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:20:47 BoogieIcfgContainer [2019-11-15 21:20:47,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:20:47,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:20:47,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:20:47,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:20:47,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:20:44" (1/3) ... [2019-11-15 21:20:47,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8cabb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:20:47, skipping insertion in model container [2019-11-15 21:20:47,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:20:45" (2/3) ... [2019-11-15 21:20:47,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8cabb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:20:47, skipping insertion in model container [2019-11-15 21:20:47,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:20:47" (3/3) ... [2019-11-15 21:20:47,080 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-1.c [2019-11-15 21:20:47,093 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:20:47,107 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:20:47,121 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:20:47,156 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:20:47,156 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:20:47,156 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:20:47,157 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:20:47,157 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:20:47,157 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:20:47,157 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:20:47,157 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:20:47,184 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-11-15 21:20:47,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 21:20:47,197 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:47,198 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] [2019-11-15 21:20:47,201 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:47,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:47,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-11-15 21:20:47,217 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:47,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610488737] [2019-11-15 21:20:47,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:47,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:47,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:47,570 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 21:20:47,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610488737] [2019-11-15 21:20:47,571 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:47,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:47,572 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002566927] [2019-11-15 21:20:47,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:47,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:47,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:47,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:47,597 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-11-15 21:20:48,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:48,142 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2019-11-15 21:20:48,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:48,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-15 21:20:48,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:48,174 INFO L225 Difference]: With dead ends: 255 [2019-11-15 21:20:48,174 INFO L226 Difference]: Without dead ends: 116 [2019-11-15 21:20:48,179 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 21:20:48,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-15 21:20:48,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-11-15 21:20:48,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-15 21:20:48,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2019-11-15 21:20:48,267 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 24 [2019-11-15 21:20:48,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:48,268 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2019-11-15 21:20:48,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:48,268 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2019-11-15 21:20:48,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-15 21:20:48,270 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:48,270 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] [2019-11-15 21:20:48,271 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:48,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:48,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1001988123, now seen corresponding path program 1 times [2019-11-15 21:20:48,275 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:48,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021786207] [2019-11-15 21:20:48,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:48,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:48,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:20:48,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021786207] [2019-11-15 21:20:48,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:48,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:20:48,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947440284] [2019-11-15 21:20:48,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:20:48,527 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:48,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:20:48,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:20:48,529 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand 3 states. [2019-11-15 21:20:48,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:48,605 INFO L93 Difference]: Finished difference Result 321 states and 484 transitions. [2019-11-15 21:20:48,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:20:48,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-15 21:20:48,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:48,610 INFO L225 Difference]: With dead ends: 321 [2019-11-15 21:20:48,610 INFO L226 Difference]: Without dead ends: 216 [2019-11-15 21:20:48,611 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 21:20:48,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-15 21:20:48,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-15 21:20:48,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-15 21:20:48,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 320 transitions. [2019-11-15 21:20:48,638 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 320 transitions. Word has length 38 [2019-11-15 21:20:48,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:48,639 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 320 transitions. [2019-11-15 21:20:48,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:20:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 320 transitions. [2019-11-15 21:20:48,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 21:20:48,643 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:48,644 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 21:20:48,644 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:48,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:48,645 INFO L82 PathProgramCache]: Analyzing trace with hash -596933037, now seen corresponding path program 1 times [2019-11-15 21:20:48,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:48,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336486231] [2019-11-15 21:20:48,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:48,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:48,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:20:48,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336486231] [2019-11-15 21:20:48,788 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:48,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:20:48,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514667462] [2019-11-15 21:20:48,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:20:48,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:48,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:20:48,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:20:48,792 INFO L87 Difference]: Start difference. First operand 216 states and 320 transitions. Second operand 3 states. [2019-11-15 21:20:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:48,892 INFO L93 Difference]: Finished difference Result 420 states and 629 transitions. [2019-11-15 21:20:48,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:20:48,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-15 21:20:48,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:48,902 INFO L225 Difference]: With dead ends: 420 [2019-11-15 21:20:48,902 INFO L226 Difference]: Without dead ends: 315 [2019-11-15 21:20:48,904 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 21:20:48,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-15 21:20:48,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-11-15 21:20:48,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-15 21:20:48,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 466 transitions. [2019-11-15 21:20:48,962 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 466 transitions. Word has length 53 [2019-11-15 21:20:48,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:48,964 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 466 transitions. [2019-11-15 21:20:48,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:20:48,965 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 466 transitions. [2019-11-15 21:20:48,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 21:20:48,975 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:48,975 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:48,975 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:48,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:48,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1173568974, now seen corresponding path program 1 times [2019-11-15 21:20:48,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:48,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374692348] [2019-11-15 21:20:48,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:48,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:48,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:49,137 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:20:49,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374692348] [2019-11-15 21:20:49,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:49,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:49,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668597480] [2019-11-15 21:20:49,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:49,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:49,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:49,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:49,141 INFO L87 Difference]: Start difference. First operand 315 states and 466 transitions. Second operand 4 states. [2019-11-15 21:20:49,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:49,930 INFO L93 Difference]: Finished difference Result 806 states and 1197 transitions. [2019-11-15 21:20:49,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:49,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-15 21:20:49,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:49,939 INFO L225 Difference]: With dead ends: 806 [2019-11-15 21:20:49,940 INFO L226 Difference]: Without dead ends: 501 [2019-11-15 21:20:49,945 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 21:20:49,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-11-15 21:20:49,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 365. [2019-11-15 21:20:49,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-11-15 21:20:49,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 552 transitions. [2019-11-15 21:20:49,992 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 552 transitions. Word has length 71 [2019-11-15 21:20:49,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:49,993 INFO L462 AbstractCegarLoop]: Abstraction has 365 states and 552 transitions. [2019-11-15 21:20:49,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:49,994 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 552 transitions. [2019-11-15 21:20:49,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 21:20:49,999 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:49,999 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:50,000 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:50,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:50,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1307582480, now seen corresponding path program 1 times [2019-11-15 21:20:50,001 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:50,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889242404] [2019-11-15 21:20:50,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:50,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:50,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:20:50,159 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889242404] [2019-11-15 21:20:50,159 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:50,160 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:50,160 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883511801] [2019-11-15 21:20:50,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:50,161 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:50,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:50,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:50,161 INFO L87 Difference]: Start difference. First operand 365 states and 552 transitions. Second operand 4 states. [2019-11-15 21:20:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:50,665 INFO L93 Difference]: Finished difference Result 806 states and 1218 transitions. [2019-11-15 21:20:50,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:50,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-15 21:20:50,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:50,670 INFO L225 Difference]: With dead ends: 806 [2019-11-15 21:20:50,670 INFO L226 Difference]: Without dead ends: 451 [2019-11-15 21:20:50,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 21:20:50,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-15 21:20:50,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 405. [2019-11-15 21:20:50,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-11-15 21:20:50,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 620 transitions. [2019-11-15 21:20:50,690 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 620 transitions. Word has length 71 [2019-11-15 21:20:50,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:50,691 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 620 transitions. [2019-11-15 21:20:50,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:50,691 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 620 transitions. [2019-11-15 21:20:50,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 21:20:50,693 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:50,693 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:50,694 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:50,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:50,694 INFO L82 PathProgramCache]: Analyzing trace with hash -2025585655, now seen corresponding path program 1 times [2019-11-15 21:20:50,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:50,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511573734] [2019-11-15 21:20:50,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:50,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:50,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:50,787 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:20:50,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511573734] [2019-11-15 21:20:50,788 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:50,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:50,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885944938] [2019-11-15 21:20:50,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:50,789 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:50,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:50,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:50,790 INFO L87 Difference]: Start difference. First operand 405 states and 620 transitions. Second operand 4 states. [2019-11-15 21:20:51,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:51,382 INFO L93 Difference]: Finished difference Result 928 states and 1409 transitions. [2019-11-15 21:20:51,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:51,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-15 21:20:51,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:51,397 INFO L225 Difference]: With dead ends: 928 [2019-11-15 21:20:51,397 INFO L226 Difference]: Without dead ends: 533 [2019-11-15 21:20:51,398 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 21:20:51,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-11-15 21:20:51,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 407. [2019-11-15 21:20:51,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 21:20:51,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 622 transitions. [2019-11-15 21:20:51,416 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 622 transitions. Word has length 72 [2019-11-15 21:20:51,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:51,416 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 622 transitions. [2019-11-15 21:20:51,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:51,417 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 622 transitions. [2019-11-15 21:20:51,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 21:20:51,419 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:51,419 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 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] [2019-11-15 21:20:51,419 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:51,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:51,420 INFO L82 PathProgramCache]: Analyzing trace with hash 703880522, now seen corresponding path program 2 times [2019-11-15 21:20:51,420 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:51,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858940220] [2019-11-15 21:20:51,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:51,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:51,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:20:51,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858940220] [2019-11-15 21:20:51,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:51,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:51,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665077176] [2019-11-15 21:20:51,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:51,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:51,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:51,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:51,570 INFO L87 Difference]: Start difference. First operand 407 states and 622 transitions. Second operand 4 states. [2019-11-15 21:20:52,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:52,219 INFO L93 Difference]: Finished difference Result 928 states and 1407 transitions. [2019-11-15 21:20:52,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:52,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-15 21:20:52,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:52,226 INFO L225 Difference]: With dead ends: 928 [2019-11-15 21:20:52,226 INFO L226 Difference]: Without dead ends: 531 [2019-11-15 21:20:52,228 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 21:20:52,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-15 21:20:52,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-11-15 21:20:52,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 21:20:52,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 620 transitions. [2019-11-15 21:20:52,248 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 620 transitions. Word has length 85 [2019-11-15 21:20:52,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:52,248 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 620 transitions. [2019-11-15 21:20:52,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:52,249 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 620 transitions. [2019-11-15 21:20:52,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 21:20:52,250 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:52,251 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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] [2019-11-15 21:20:52,251 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:52,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:52,252 INFO L82 PathProgramCache]: Analyzing trace with hash -405099924, now seen corresponding path program 1 times [2019-11-15 21:20:52,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:52,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671011764] [2019-11-15 21:20:52,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:52,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:52,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:20:52,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671011764] [2019-11-15 21:20:52,396 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:52,396 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:52,401 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546820249] [2019-11-15 21:20:52,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:52,402 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:52,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:52,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:52,404 INFO L87 Difference]: Start difference. First operand 407 states and 620 transitions. Second operand 4 states. [2019-11-15 21:20:53,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:53,087 INFO L93 Difference]: Finished difference Result 928 states and 1403 transitions. [2019-11-15 21:20:53,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:53,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-15 21:20:53,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:53,092 INFO L225 Difference]: With dead ends: 928 [2019-11-15 21:20:53,092 INFO L226 Difference]: Without dead ends: 531 [2019-11-15 21:20:53,093 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 21:20:53,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-15 21:20:53,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-11-15 21:20:53,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 21:20:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 618 transitions. [2019-11-15 21:20:53,110 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 618 transitions. Word has length 85 [2019-11-15 21:20:53,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:53,111 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 618 transitions. [2019-11-15 21:20:53,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:53,111 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 618 transitions. [2019-11-15 21:20:53,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 21:20:53,113 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:53,113 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 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] [2019-11-15 21:20:53,113 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:53,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:53,114 INFO L82 PathProgramCache]: Analyzing trace with hash -325478776, now seen corresponding path program 2 times [2019-11-15 21:20:53,114 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:53,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367879242] [2019-11-15 21:20:53,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:53,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:53,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:53,224 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:20:53,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367879242] [2019-11-15 21:20:53,225 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:53,225 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:53,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669122064] [2019-11-15 21:20:53,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:53,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:53,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:53,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:53,229 INFO L87 Difference]: Start difference. First operand 407 states and 618 transitions. Second operand 4 states. [2019-11-15 21:20:53,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:53,755 INFO L93 Difference]: Finished difference Result 848 states and 1278 transitions. [2019-11-15 21:20:53,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:53,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-15 21:20:53,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:53,760 INFO L225 Difference]: With dead ends: 848 [2019-11-15 21:20:53,760 INFO L226 Difference]: Without dead ends: 451 [2019-11-15 21:20:53,762 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 21:20:53,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-15 21:20:53,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-11-15 21:20:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 21:20:53,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 616 transitions. [2019-11-15 21:20:53,782 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 616 transitions. Word has length 85 [2019-11-15 21:20:53,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:53,783 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 616 transitions. [2019-11-15 21:20:53,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:53,783 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 616 transitions. [2019-11-15 21:20:53,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-15 21:20:53,785 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:53,786 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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] [2019-11-15 21:20:53,786 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:53,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:53,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1434459222, now seen corresponding path program 1 times [2019-11-15 21:20:53,787 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:53,789 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568800587] [2019-11-15 21:20:53,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:53,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:53,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:20:53,911 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568800587] [2019-11-15 21:20:53,911 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:53,911 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:53,911 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545326227] [2019-11-15 21:20:53,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:53,912 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:53,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:53,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:53,914 INFO L87 Difference]: Start difference. First operand 407 states and 616 transitions. Second operand 4 states. [2019-11-15 21:20:54,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:54,366 INFO L93 Difference]: Finished difference Result 848 states and 1274 transitions. [2019-11-15 21:20:54,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:54,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-15 21:20:54,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:54,371 INFO L225 Difference]: With dead ends: 848 [2019-11-15 21:20:54,371 INFO L226 Difference]: Without dead ends: 451 [2019-11-15 21:20:54,372 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 21:20:54,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-15 21:20:54,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-11-15 21:20:54,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 21:20:54,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 614 transitions. [2019-11-15 21:20:54,393 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 614 transitions. Word has length 85 [2019-11-15 21:20:54,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:54,393 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 614 transitions. [2019-11-15 21:20:54,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:54,394 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 614 transitions. [2019-11-15 21:20:54,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-15 21:20:54,396 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:54,396 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2019-11-15 21:20:54,396 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:54,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:54,397 INFO L82 PathProgramCache]: Analyzing trace with hash 381197251, now seen corresponding path program 1 times [2019-11-15 21:20:54,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:54,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725370270] [2019-11-15 21:20:54,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:54,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:54,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:54,488 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:20:54,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725370270] [2019-11-15 21:20:54,489 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:54,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:54,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272133220] [2019-11-15 21:20:54,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:54,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:54,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:54,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:54,491 INFO L87 Difference]: Start difference. First operand 407 states and 614 transitions. Second operand 4 states. [2019-11-15 21:20:55,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:55,060 INFO L93 Difference]: Finished difference Result 928 states and 1391 transitions. [2019-11-15 21:20:55,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:55,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-15 21:20:55,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:55,065 INFO L225 Difference]: With dead ends: 928 [2019-11-15 21:20:55,065 INFO L226 Difference]: Without dead ends: 531 [2019-11-15 21:20:55,066 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 21:20:55,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-15 21:20:55,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-11-15 21:20:55,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 21:20:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 612 transitions. [2019-11-15 21:20:55,082 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 612 transitions. Word has length 86 [2019-11-15 21:20:55,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:55,083 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 612 transitions. [2019-11-15 21:20:55,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:55,083 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 612 transitions. [2019-11-15 21:20:55,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-15 21:20:55,085 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:55,085 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:55,085 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:55,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:55,086 INFO L82 PathProgramCache]: Analyzing trace with hash 681258334, now seen corresponding path program 1 times [2019-11-15 21:20:55,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:55,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094354102] [2019-11-15 21:20:55,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:55,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:55,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:55,173 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:20:55,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094354102] [2019-11-15 21:20:55,175 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:55,175 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:55,176 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277620274] [2019-11-15 21:20:55,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:55,176 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:55,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:55,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:55,177 INFO L87 Difference]: Start difference. First operand 407 states and 612 transitions. Second operand 4 states. [2019-11-15 21:20:55,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:55,824 INFO L93 Difference]: Finished difference Result 783 states and 1168 transitions. [2019-11-15 21:20:55,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:55,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-15 21:20:55,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:55,830 INFO L225 Difference]: With dead ends: 783 [2019-11-15 21:20:55,830 INFO L226 Difference]: Without dead ends: 531 [2019-11-15 21:20:55,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 21:20:55,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-15 21:20:55,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-11-15 21:20:55,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 21:20:55,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 610 transitions. [2019-11-15 21:20:55,847 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 610 transitions. Word has length 86 [2019-11-15 21:20:55,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:55,847 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 610 transitions. [2019-11-15 21:20:55,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:55,847 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 610 transitions. [2019-11-15 21:20:55,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-15 21:20:55,849 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:55,849 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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] [2019-11-15 21:20:55,850 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:55,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:55,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1464169915, now seen corresponding path program 1 times [2019-11-15 21:20:55,851 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:55,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187943227] [2019-11-15 21:20:55,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:55,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:55,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:55,929 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:20:55,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187943227] [2019-11-15 21:20:55,930 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:55,930 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:55,930 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814373483] [2019-11-15 21:20:55,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:55,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:55,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:55,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:55,932 INFO L87 Difference]: Start difference. First operand 407 states and 610 transitions. Second operand 4 states. [2019-11-15 21:20:56,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:56,377 INFO L93 Difference]: Finished difference Result 848 states and 1262 transitions. [2019-11-15 21:20:56,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:56,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-15 21:20:56,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:56,381 INFO L225 Difference]: With dead ends: 848 [2019-11-15 21:20:56,381 INFO L226 Difference]: Without dead ends: 451 [2019-11-15 21:20:56,382 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 21:20:56,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-15 21:20:56,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-11-15 21:20:56,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 21:20:56,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 608 transitions. [2019-11-15 21:20:56,397 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 608 transitions. Word has length 86 [2019-11-15 21:20:56,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:56,397 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 608 transitions. [2019-11-15 21:20:56,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:56,397 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 608 transitions. [2019-11-15 21:20:56,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-15 21:20:56,399 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:56,399 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:56,400 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:56,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:56,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1164108832, now seen corresponding path program 1 times [2019-11-15 21:20:56,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:56,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527245146] [2019-11-15 21:20:56,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:56,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:56,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:56,508 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:20:56,508 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527245146] [2019-11-15 21:20:56,508 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:56,509 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:56,509 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646048971] [2019-11-15 21:20:56,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:56,510 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:56,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:56,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:56,510 INFO L87 Difference]: Start difference. First operand 407 states and 608 transitions. Second operand 4 states. [2019-11-15 21:20:56,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:56,942 INFO L93 Difference]: Finished difference Result 703 states and 1041 transitions. [2019-11-15 21:20:56,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:56,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2019-11-15 21:20:56,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:56,946 INFO L225 Difference]: With dead ends: 703 [2019-11-15 21:20:56,946 INFO L226 Difference]: Without dead ends: 451 [2019-11-15 21:20:56,948 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 21:20:56,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-15 21:20:56,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-11-15 21:20:56,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 21:20:56,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 606 transitions. [2019-11-15 21:20:56,962 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 606 transitions. Word has length 86 [2019-11-15 21:20:56,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:56,963 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 606 transitions. [2019-11-15 21:20:56,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:56,963 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 606 transitions. [2019-11-15 21:20:56,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 21:20:56,965 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:56,965 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 21:20:56,965 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:56,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:56,966 INFO L82 PathProgramCache]: Analyzing trace with hash -956813465, now seen corresponding path program 1 times [2019-11-15 21:20:56,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:56,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022805782] [2019-11-15 21:20:56,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:56,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:56,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:57,049 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:20:57,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022805782] [2019-11-15 21:20:57,050 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:57,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:57,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800491465] [2019-11-15 21:20:57,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:57,051 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:57,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:57,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:57,051 INFO L87 Difference]: Start difference. First operand 407 states and 606 transitions. Second operand 4 states. [2019-11-15 21:20:57,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:57,681 INFO L93 Difference]: Finished difference Result 928 states and 1375 transitions. [2019-11-15 21:20:57,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:57,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 21:20:57,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:57,688 INFO L225 Difference]: With dead ends: 928 [2019-11-15 21:20:57,688 INFO L226 Difference]: Without dead ends: 531 [2019-11-15 21:20:57,689 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 21:20:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-11-15 21:20:57,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2019-11-15 21:20:57,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 21:20:57,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 604 transitions. [2019-11-15 21:20:57,702 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 604 transitions. Word has length 87 [2019-11-15 21:20:57,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:57,703 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 604 transitions. [2019-11-15 21:20:57,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:57,703 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 604 transitions. [2019-11-15 21:20:57,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 21:20:57,705 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:57,705 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:57,705 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:57,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:57,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2048176167, now seen corresponding path program 1 times [2019-11-15 21:20:57,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:57,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171387901] [2019-11-15 21:20:57,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:57,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:57,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:57,779 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:20:57,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171387901] [2019-11-15 21:20:57,781 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:57,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:57,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167379497] [2019-11-15 21:20:57,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:57,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:57,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:57,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:57,783 INFO L87 Difference]: Start difference. First operand 407 states and 604 transitions. Second operand 4 states. [2019-11-15 21:20:58,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:58,340 INFO L93 Difference]: Finished difference Result 777 states and 1149 transitions. [2019-11-15 21:20:58,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:58,340 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 21:20:58,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:58,343 INFO L225 Difference]: With dead ends: 777 [2019-11-15 21:20:58,343 INFO L226 Difference]: Without dead ends: 525 [2019-11-15 21:20:58,344 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 21:20:58,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-11-15 21:20:58,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 407. [2019-11-15 21:20:58,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 21:20:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 602 transitions. [2019-11-15 21:20:58,356 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 602 transitions. Word has length 87 [2019-11-15 21:20:58,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:58,356 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 602 transitions. [2019-11-15 21:20:58,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:58,357 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 602 transitions. [2019-11-15 21:20:58,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 21:20:58,358 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:58,358 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 21:20:58,359 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:58,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:58,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1966346533, now seen corresponding path program 1 times [2019-11-15 21:20:58,359 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:58,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51306395] [2019-11-15 21:20:58,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:58,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:58,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:20:58,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51306395] [2019-11-15 21:20:58,450 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:58,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:58,451 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048822833] [2019-11-15 21:20:58,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:58,451 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:58,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:58,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:58,452 INFO L87 Difference]: Start difference. First operand 407 states and 602 transitions. Second operand 4 states. [2019-11-15 21:20:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:58,797 INFO L93 Difference]: Finished difference Result 848 states and 1246 transitions. [2019-11-15 21:20:58,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:58,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 21:20:58,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:58,801 INFO L225 Difference]: With dead ends: 848 [2019-11-15 21:20:58,801 INFO L226 Difference]: Without dead ends: 451 [2019-11-15 21:20:58,802 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 21:20:58,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-11-15 21:20:58,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 407. [2019-11-15 21:20:58,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 21:20:58,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 600 transitions. [2019-11-15 21:20:58,814 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 600 transitions. Word has length 87 [2019-11-15 21:20:58,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:58,814 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 600 transitions. [2019-11-15 21:20:58,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:58,814 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 600 transitions. [2019-11-15 21:20:58,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 21:20:58,816 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:58,816 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:20:58,816 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:58,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:58,816 INFO L82 PathProgramCache]: Analyzing trace with hash 676368869, now seen corresponding path program 1 times [2019-11-15 21:20:58,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:58,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096556528] [2019-11-15 21:20:58,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:58,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:58,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:58,875 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:20:58,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096556528] [2019-11-15 21:20:58,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:58,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:58,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276053971] [2019-11-15 21:20:58,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:58,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:58,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:58,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:58,877 INFO L87 Difference]: Start difference. First operand 407 states and 600 transitions. Second operand 4 states. [2019-11-15 21:20:59,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:59,216 INFO L93 Difference]: Finished difference Result 697 states and 1022 transitions. [2019-11-15 21:20:59,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:59,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 21:20:59,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:59,219 INFO L225 Difference]: With dead ends: 697 [2019-11-15 21:20:59,219 INFO L226 Difference]: Without dead ends: 445 [2019-11-15 21:20:59,220 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:20:59,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-11-15 21:20:59,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 407. [2019-11-15 21:20:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 21:20:59,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 598 transitions. [2019-11-15 21:20:59,232 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 598 transitions. Word has length 87 [2019-11-15 21:20:59,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:59,232 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 598 transitions. [2019-11-15 21:20:59,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:59,232 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 598 transitions. [2019-11-15 21:20:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 21:20:59,234 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:59,234 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 21:20:59,234 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:59,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:59,234 INFO L82 PathProgramCache]: Analyzing trace with hash 571107934, now seen corresponding path program 1 times [2019-11-15 21:20:59,235 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:59,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771464918] [2019-11-15 21:20:59,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:59,235 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:59,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:59,298 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:20:59,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771464918] [2019-11-15 21:20:59,298 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:59,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:59,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099990384] [2019-11-15 21:20:59,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:59,299 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:59,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:59,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:59,300 INFO L87 Difference]: Start difference. First operand 407 states and 598 transitions. Second operand 4 states. [2019-11-15 21:20:59,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:20:59,773 INFO L93 Difference]: Finished difference Result 904 states and 1330 transitions. [2019-11-15 21:20:59,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:20:59,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 21:20:59,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:20:59,778 INFO L225 Difference]: With dead ends: 904 [2019-11-15 21:20:59,778 INFO L226 Difference]: Without dead ends: 507 [2019-11-15 21:20:59,779 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 21:20:59,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-11-15 21:20:59,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 407. [2019-11-15 21:20:59,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 21:20:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 596 transitions. [2019-11-15 21:20:59,794 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 596 transitions. Word has length 88 [2019-11-15 21:20:59,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:20:59,794 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 596 transitions. [2019-11-15 21:20:59,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:20:59,794 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 596 transitions. [2019-11-15 21:20:59,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 21:20:59,796 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:20:59,797 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-15 21:20:59,797 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:20:59,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:20:59,797 INFO L82 PathProgramCache]: Analyzing trace with hash 994754656, now seen corresponding path program 1 times [2019-11-15 21:20:59,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:20:59,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322465594] [2019-11-15 21:20:59,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:59,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:20:59,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:20:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:20:59,876 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:20:59,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322465594] [2019-11-15 21:20:59,877 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:20:59,877 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:20:59,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981174197] [2019-11-15 21:20:59,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:20:59,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:20:59,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:20:59,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:20:59,880 INFO L87 Difference]: Start difference. First operand 407 states and 596 transitions. Second operand 4 states. [2019-11-15 21:21:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:00,294 INFO L93 Difference]: Finished difference Result 824 states and 1205 transitions. [2019-11-15 21:21:00,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:21:00,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 21:21:00,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:00,298 INFO L225 Difference]: With dead ends: 824 [2019-11-15 21:21:00,298 INFO L226 Difference]: Without dead ends: 427 [2019-11-15 21:21:00,299 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 21:21:00,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-11-15 21:21:00,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 407. [2019-11-15 21:21:00,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 21:21:00,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 594 transitions. [2019-11-15 21:21:00,313 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 594 transitions. Word has length 88 [2019-11-15 21:21:00,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:00,314 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 594 transitions. [2019-11-15 21:21:00,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:21:00,314 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 594 transitions. [2019-11-15 21:21:00,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 21:21:00,316 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:00,316 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:00,316 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:00,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:00,317 INFO L82 PathProgramCache]: Analyzing trace with hash -433365501, now seen corresponding path program 1 times [2019-11-15 21:21:00,317 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:00,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916330660] [2019-11-15 21:21:00,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:00,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:00,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:00,409 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:21:00,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916330660] [2019-11-15 21:21:00,410 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:21:00,410 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:21:00,411 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402905546] [2019-11-15 21:21:00,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:21:00,411 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:21:00,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:21:00,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:21:00,412 INFO L87 Difference]: Start difference. First operand 407 states and 594 transitions. Second operand 4 states. [2019-11-15 21:21:00,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:00,958 INFO L93 Difference]: Finished difference Result 904 states and 1322 transitions. [2019-11-15 21:21:00,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:21:00,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-15 21:21:00,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:00,962 INFO L225 Difference]: With dead ends: 904 [2019-11-15 21:21:00,962 INFO L226 Difference]: Without dead ends: 507 [2019-11-15 21:21:00,963 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 21:21:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-11-15 21:21:00,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 407. [2019-11-15 21:21:00,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 21:21:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 592 transitions. [2019-11-15 21:21:00,978 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 592 transitions. Word has length 89 [2019-11-15 21:21:00,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:00,979 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 592 transitions. [2019-11-15 21:21:00,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:21:00,979 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 592 transitions. [2019-11-15 21:21:00,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 21:21:00,981 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:00,981 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:00,981 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:00,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:00,982 INFO L82 PathProgramCache]: Analyzing trace with hash -185219007, now seen corresponding path program 1 times [2019-11-15 21:21:00,982 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:00,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799462382] [2019-11-15 21:21:00,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:00,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:00,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:01,057 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-15 21:21:01,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799462382] [2019-11-15 21:21:01,058 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:21:01,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:21:01,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523623054] [2019-11-15 21:21:01,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:21:01,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:21:01,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:21:01,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:21:01,060 INFO L87 Difference]: Start difference. First operand 407 states and 592 transitions. Second operand 3 states. [2019-11-15 21:21:01,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:01,111 INFO L93 Difference]: Finished difference Result 806 states and 1179 transitions. [2019-11-15 21:21:01,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:21:01,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-15 21:21:01,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:01,118 INFO L225 Difference]: With dead ends: 806 [2019-11-15 21:21:01,118 INFO L226 Difference]: Without dead ends: 556 [2019-11-15 21:21:01,119 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 21:21:01,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-11-15 21:21:01,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2019-11-15 21:21:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-11-15 21:21:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 809 transitions. [2019-11-15 21:21:01,141 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 809 transitions. Word has length 89 [2019-11-15 21:21:01,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:01,142 INFO L462 AbstractCegarLoop]: Abstraction has 556 states and 809 transitions. [2019-11-15 21:21:01,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:21:01,142 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 809 transitions. [2019-11-15 21:21:01,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 21:21:01,144 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:01,145 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:01,145 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:01,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:01,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1027809079, now seen corresponding path program 1 times [2019-11-15 21:21:01,146 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:01,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476875230] [2019-11-15 21:21:01,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:01,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:01,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-15 21:21:01,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476875230] [2019-11-15 21:21:01,220 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:21:01,220 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:21:01,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648100111] [2019-11-15 21:21:01,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:21:01,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:21:01,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:21:01,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:21:01,223 INFO L87 Difference]: Start difference. First operand 556 states and 809 transitions. Second operand 3 states. [2019-11-15 21:21:01,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:01,276 INFO L93 Difference]: Finished difference Result 1104 states and 1613 transitions. [2019-11-15 21:21:01,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:21:01,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-11-15 21:21:01,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:01,282 INFO L225 Difference]: With dead ends: 1104 [2019-11-15 21:21:01,282 INFO L226 Difference]: Without dead ends: 705 [2019-11-15 21:21:01,284 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 21:21:01,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-11-15 21:21:01,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2019-11-15 21:21:01,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-11-15 21:21:01,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1027 transitions. [2019-11-15 21:21:01,347 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1027 transitions. Word has length 91 [2019-11-15 21:21:01,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:01,347 INFO L462 AbstractCegarLoop]: Abstraction has 705 states and 1027 transitions. [2019-11-15 21:21:01,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:21:01,348 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1027 transitions. [2019-11-15 21:21:01,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-15 21:21:01,350 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:01,351 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:01,351 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:01,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:01,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1254631592, now seen corresponding path program 1 times [2019-11-15 21:21:01,352 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:21:01,352 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621875527] [2019-11-15 21:21:01,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:01,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:21:01,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:21:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:21:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:21:01,906 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:21:01,906 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 21:21:02,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:21:02 BoogieIcfgContainer [2019-11-15 21:21:02,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:21:02,056 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:21:02,057 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:21:02,057 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:21:02,058 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:20:47" (3/4) ... [2019-11-15 21:21:02,061 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:21:02,061 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:21:02,063 INFO L168 Benchmark]: Toolchain (without parser) took 17609.28 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 261.1 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -208.4 MB). Peak memory consumption was 52.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:02,064 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:21:02,064 INFO L168 Benchmark]: CACSL2BoogieTranslator took 935.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -187.4 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:02,065 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:02,065 INFO L168 Benchmark]: Boogie Preprocessor took 141.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:02,066 INFO L168 Benchmark]: RCFGBuilder took 1437.47 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: 86.8 MB). Peak memory consumption was 86.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:02,066 INFO L168 Benchmark]: TraceAbstraction took 14986.37 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 105.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -123.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:21:02,066 INFO L168 Benchmark]: Witness Printer took 5.10 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:21:02,069 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.35 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 935.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -187.4 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 141.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1437.47 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: 86.8 MB). Peak memory consumption was 86.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14986.37 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 105.9 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -123.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 5.10 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1641]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1336. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_client_data ; VAL [init=1, SSLv3_client_data={-3:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1080] BUF_MEM *buf ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int tmp___1 = __VERIFIER_nondet_int() ; [L1090] int tmp___2 = __VERIFIER_nondet_int() ; [L1091] int tmp___3 = __VERIFIER_nondet_int() ; [L1092] int tmp___4 = __VERIFIER_nondet_int() ; [L1093] int tmp___5 = __VERIFIER_nondet_int() ; [L1094] int tmp___6 = __VERIFIER_nondet_int() ; [L1095] int tmp___7 = __VERIFIER_nondet_int() ; [L1096] int tmp___8 = __VERIFIER_nondet_int() ; [L1097] long tmp___9 = __VERIFIER_nondet_long() ; [L1098] int blastFlag ; [L1101] blastFlag = 0 [L1102] s->hit=__VERIFIER_nondet_int () [L1103] s->state = 12292 [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 [L1108] EXPR s->info_callback VAL [init=1, SSLv3_client_data={-3:0}] [L1108] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1109] EXPR s->info_callback [L1109] cb = s->info_callback [L1117] EXPR s->in_handshake [L1117] s->in_handshake += 1 [L1118] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={-3:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={-3:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1131] COND TRUE s->state == 12292 [L1234] s->new_session = 1 [L1235] s->state = 4096 [L1236] EXPR s->ctx [L1236] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1236] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1241] s->server = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1242] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={-3:0}] [L1247] EXPR s->version VAL [init=1, SSLv3_client_data={-3:0}] [L1247] COND FALSE !((s->version & 65280) != 768) [L1253] s->type = 4096 [L1254] EXPR s->init_buf VAL [init=1, SSLv3_client_data={-3:0}] [L1254] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1272] COND FALSE !(! tmp___4) VAL [init=1, SSLv3_client_data={-3:0}] [L1278] COND FALSE !(! tmp___5) [L1284] s->state = 4368 [L1285] EXPR s->ctx [L1285] EXPR (s->ctx)->stats.sess_connect [L1285] (s->ctx)->stats.sess_connect += 1 [L1286] s->init_num = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-3:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={-3:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1146] COND TRUE s->state == 4368 [L1290] s->shutdown = 0 [L1291] ret = __VERIFIER_nondet_int() [L1292] COND TRUE blastFlag == 0 [L1293] blastFlag = 1 VAL [init=1, SSLv3_client_data={-3:0}] [L1297] COND FALSE !(ret <= 0) [L1302] s->state = 4384 [L1303] s->init_num = 0 [L1304] EXPR s->bbio [L1304] EXPR s->wbio VAL [init=1, SSLv3_client_data={-3:0}] [L1304] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-3:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={-3:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1152] COND TRUE s->state == 4384 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 1 [L1314] blastFlag = 2 VAL [init=1, SSLv3_client_data={-3:0}] [L1322] COND FALSE !(ret <= 0) [L1327] s->hit VAL [init=1, SSLv3_client_data={-3:0}] [L1327] COND FALSE !(s->hit) [L1330] s->state = 4400 VAL [init=1, SSLv3_client_data={-3:0}] [L1332] s->init_num = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-3:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={-3:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1158] COND TRUE s->state == 4400 [L1336] EXPR s->s3 [L1336] EXPR (s->s3)->tmp.new_cipher [L1336] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={-3:0}] [L1336] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1339] ret = __VERIFIER_nondet_int() [L1340] COND TRUE blastFlag == 2 [L1341] blastFlag = 3 VAL [init=1, SSLv3_client_data={-3:0}] [L1345] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={-3:0}] [L1351] s->state = 4416 [L1352] s->init_num = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-3:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={-3:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1164] COND TRUE s->state == 4416 [L1356] ret = __VERIFIER_nondet_int() [L1357] COND TRUE blastFlag == 3 [L1358] blastFlag = 4 VAL [init=1, SSLv3_client_data={-3:0}] [L1362] COND FALSE !(ret <= 0) [L1367] s->state = 4432 [L1368] s->init_num = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1369] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={-3:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-3:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={-3:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1164] COND FALSE !(s->state == 4416) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1167] COND FALSE !(s->state == 4417) [L1170] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1170] COND TRUE s->state == 4432 [L1378] ret = __VERIFIER_nondet_int() [L1379] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={-3:0}] [L1641] __VERIFIER_error() VAL [init=1, SSLv3_client_data={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Result: UNSAFE, OverallTime: 14.8s, OverallIterations: 24, TraceHistogramMax: 6, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4903 SDtfs, 1790 SDslu, 6305 SDs, 0 SdLazy, 3605 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 46 SyntacticMatches, 19 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=705occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 1525 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1918 NumberOfCodeBlocks, 1918 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1783 ConstructedInterpolants, 0 QuantifiedInterpolants, 373356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 1532/1532 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 21:21:04,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:21:04,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:21:04,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:21:04,539 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:21:04,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:21:04,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:21:04,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:21:04,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:21:04,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:21:04,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:21:04,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:21:04,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:21:04,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:21:04,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:21:04,573 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:21:04,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:21:04,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:21:04,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:21:04,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:21:04,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:21:04,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:21:04,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:21:04,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:21:04,602 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:21:04,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:21:04,602 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:21:04,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:21:04,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:21:04,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:21:04,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:21:04,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:21:04,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:21:04,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:21:04,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:21:04,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:21:04,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:21:04,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:21:04,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:21:04,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:21:04,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:21:04,620 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 21:21:04,644 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:21:04,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:21:04,645 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:21:04,646 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:21:04,646 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:21:04,646 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:21:04,646 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:21:04,647 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:21:04,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:21:04,647 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:21:04,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:21:04,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:21:04,648 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 21:21:04,648 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 21:21:04,648 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:21:04,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:21:04,649 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:21:04,649 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:21:04,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:21:04,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:21:04,650 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:21:04,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:21:04,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:21:04,650 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:21:04,651 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:21:04,651 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:21:04,651 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 21:21:04,651 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 21:21:04,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:21:04,652 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 21:21:04,652 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_7f9c6f75-7152-4da0-8b22-cc40950d71de/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 -> ed035556db4b60d2bb3e3e70af5f975a04e628c4 [2019-11-15 21:21:04,707 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:21:04,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:21:04,722 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:21:04,724 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:21:04,724 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:21:04,725 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c [2019-11-15 21:21:04,786 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/bin/uautomizer/data/beda9ade7/780128fdd10a4c3ca399692d553aa81a/FLAG5fc43efa2 [2019-11-15 21:21:05,433 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:21:05,434 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/sv-benchmarks/c/ssh/s3_clnt.blast.03.i.cil-1.c [2019-11-15 21:21:05,456 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/bin/uautomizer/data/beda9ade7/780128fdd10a4c3ca399692d553aa81a/FLAG5fc43efa2 [2019-11-15 21:21:05,595 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/bin/uautomizer/data/beda9ade7/780128fdd10a4c3ca399692d553aa81a [2019-11-15 21:21:05,599 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:21:05,601 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:21:05,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:21:05,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:21:05,609 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:21:05,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:21:05" (1/1) ... [2019-11-15 21:21:05,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d78d08d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:05, skipping insertion in model container [2019-11-15 21:21:05,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:21:05" (1/1) ... [2019-11-15 21:21:05,622 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:21:05,703 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:21:06,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:21:06,283 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:21:06,483 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:21:06,517 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:21:06,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:06 WrapperNode [2019-11-15 21:21:06,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:21:06,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:21:06,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:21:06,519 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:21:06,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:06" (1/1) ... [2019-11-15 21:21:06,578 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:06" (1/1) ... [2019-11-15 21:21:06,640 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:21:06,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:21:06,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:21:06,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:21:06,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:06" (1/1) ... [2019-11-15 21:21:06,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:06" (1/1) ... [2019-11-15 21:21:06,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:06" (1/1) ... [2019-11-15 21:21:06,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:06" (1/1) ... [2019-11-15 21:21:06,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:06" (1/1) ... [2019-11-15 21:21:06,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:06" (1/1) ... [2019-11-15 21:21:06,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:06" (1/1) ... [2019-11-15 21:21:06,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:21:06,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:21:06,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:21:06,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:21:06,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/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 21:21:06,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:21:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:21:06,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 21:21:06,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:21:06,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:21:06,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:21:06,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:21:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 21:21:07,134 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:21:11,585 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-15 21:21:11,585 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-15 21:21:11,587 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:21:11,587 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 21:21:11,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:21:11 BoogieIcfgContainer [2019-11-15 21:21:11,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:21:11,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:21:11,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:21:11,595 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:21:11,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:21:05" (1/3) ... [2019-11-15 21:21:11,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b37d2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:21:11, skipping insertion in model container [2019-11-15 21:21:11,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:21:06" (2/3) ... [2019-11-15 21:21:11,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b37d2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:21:11, skipping insertion in model container [2019-11-15 21:21:11,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:21:11" (3/3) ... [2019-11-15 21:21:11,600 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-1.c [2019-11-15 21:21:11,611 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:21:11,620 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:21:11,633 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:21:11,665 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:21:11,666 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:21:11,666 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:21:11,666 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:21:11,666 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:21:11,667 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:21:11,667 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:21:11,667 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:21:11,700 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-11-15 21:21:11,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 21:21:11,714 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:11,715 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] [2019-11-15 21:21:11,717 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:11,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:11,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1457695037, now seen corresponding path program 1 times [2019-11-15 21:21:11,740 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:21:11,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1892366196] [2019-11-15 21:21:11,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/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 21:21:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:11,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:21:11,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:12,033 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 21:21:12,033 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:21:12,056 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 21:21:12,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1892366196] [2019-11-15 21:21:12,059 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:21:12,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 21:21:12,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075456469] [2019-11-15 21:21:12,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:21:12,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:21:12,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:21:12,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:21:12,087 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-11-15 21:21:12,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:12,297 INFO L93 Difference]: Finished difference Result 485 states and 820 transitions. [2019-11-15 21:21:12,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:21:12,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-15 21:21:12,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:12,318 INFO L225 Difference]: With dead ends: 485 [2019-11-15 21:21:12,318 INFO L226 Difference]: Without dead ends: 312 [2019-11-15 21:21:12,323 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 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 21:21:12,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-15 21:21:12,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2019-11-15 21:21:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-11-15 21:21:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 467 transitions. [2019-11-15 21:21:12,433 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 467 transitions. Word has length 24 [2019-11-15 21:21:12,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:12,434 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 467 transitions. [2019-11-15 21:21:12,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:21:12,435 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 467 transitions. [2019-11-15 21:21:12,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 21:21:12,445 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:12,445 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-11-15 21:21:12,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:21:12,649 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:12,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:12,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1854239308, now seen corresponding path program 1 times [2019-11-15 21:21:12,650 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:21:12,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1195625512] [2019-11-15 21:21:12,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/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 21:21:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:12,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:21:12,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:12,939 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:21:12,939 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:21:12,962 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:21:12,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1195625512] [2019-11-15 21:21:12,963 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:21:12,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 21:21:12,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297869902] [2019-11-15 21:21:12,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:21:12,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:21:12,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:21:12,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:21:12,967 INFO L87 Difference]: Start difference. First operand 312 states and 467 transitions. Second operand 4 states. [2019-11-15 21:21:15,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:15,135 INFO L93 Difference]: Finished difference Result 716 states and 1078 transitions. [2019-11-15 21:21:15,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:21:15,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 21:21:15,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:15,141 INFO L225 Difference]: With dead ends: 716 [2019-11-15 21:21:15,141 INFO L226 Difference]: Without dead ends: 512 [2019-11-15 21:21:15,150 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 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 21:21:15,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-11-15 21:21:15,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2019-11-15 21:21:15,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-15 21:21:15,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 764 transitions. [2019-11-15 21:21:15,226 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 764 transitions. Word has length 60 [2019-11-15 21:21:15,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:15,226 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 764 transitions. [2019-11-15 21:21:15,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:21:15,227 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 764 transitions. [2019-11-15 21:21:15,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 21:21:15,233 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:15,233 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:15,436 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:21:15,437 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:15,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:15,437 INFO L82 PathProgramCache]: Analyzing trace with hash 922615118, now seen corresponding path program 1 times [2019-11-15 21:21:15,438 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:21:15,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2117461637] [2019-11-15 21:21:15,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/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 21:21:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:17,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:21:17,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:17,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:17,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:17,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:17,196 INFO L341 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2019-11-15 21:21:17,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 35 [2019-11-15 21:21:17,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:17,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:17,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:21:17,229 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:22 [2019-11-15 21:21:17,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:17,290 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:17,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 26 [2019-11-15 21:21:17,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:17,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:17,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:17,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:15 [2019-11-15 21:21:17,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 21:21:17,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:17,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:17,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:17,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:5 [2019-11-15 21:21:17,394 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 21:21:17,394 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:21:17,521 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 21:21:17,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2117461637] [2019-11-15 21:21:17,522 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:21:17,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:21:17,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851128919] [2019-11-15 21:21:17,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:21:17,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:21:17,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:21:17,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:21:17,524 INFO L87 Difference]: Start difference. First operand 512 states and 764 transitions. Second operand 6 states. [2019-11-15 21:21:22,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:22,658 INFO L93 Difference]: Finished difference Result 1450 states and 2171 transitions. [2019-11-15 21:21:22,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:21:22,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-11-15 21:21:22,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:22,670 INFO L225 Difference]: With dead ends: 1450 [2019-11-15 21:21:22,671 INFO L226 Difference]: Without dead ends: 1044 [2019-11-15 21:21:22,673 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:21:22,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2019-11-15 21:21:22,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 592. [2019-11-15 21:21:22,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-15 21:21:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 894 transitions. [2019-11-15 21:21:22,706 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 894 transitions. Word has length 98 [2019-11-15 21:21:22,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:22,707 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 894 transitions. [2019-11-15 21:21:22,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:21:22,707 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 894 transitions. [2019-11-15 21:21:22,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 21:21:22,711 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:22,711 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:22,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:21:22,919 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:22,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:22,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1761362845, now seen corresponding path program 1 times [2019-11-15 21:21:22,920 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:21:22,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1163302530] [2019-11-15 21:21:22,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:21:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:24,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:21:24,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:24,394 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:24,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:24,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:24,427 INFO L341 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2019-11-15 21:21:24,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 35 [2019-11-15 21:21:24,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:24,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:24,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:21:24,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:22 [2019-11-15 21:21:24,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:24,486 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:24,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 26 [2019-11-15 21:21:24,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:24,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:24,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:24,503 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:15 [2019-11-15 21:21:24,515 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-15 21:21:24,516 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:24,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:24,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:24,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:5 [2019-11-15 21:21:24,540 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 21:21:24,540 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:21:24,611 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 21:21:24,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1163302530] [2019-11-15 21:21:24,612 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:21:24,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 21:21:24,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684925799] [2019-11-15 21:21:24,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:21:24,614 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:21:24,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:21:24,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:21:24,614 INFO L87 Difference]: Start difference. First operand 592 states and 894 transitions. Second operand 6 states. [2019-11-15 21:21:29,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:29,655 INFO L93 Difference]: Finished difference Result 1497 states and 2249 transitions. [2019-11-15 21:21:29,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:21:29,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-15 21:21:29,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:29,670 INFO L225 Difference]: With dead ends: 1497 [2019-11-15 21:21:29,670 INFO L226 Difference]: Without dead ends: 1027 [2019-11-15 21:21:29,671 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:21:29,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2019-11-15 21:21:29,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 597. [2019-11-15 21:21:29,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-11-15 21:21:29,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 899 transitions. [2019-11-15 21:21:29,715 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 899 transitions. Word has length 99 [2019-11-15 21:21:29,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:29,716 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 899 transitions. [2019-11-15 21:21:29,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:21:29,717 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 899 transitions. [2019-11-15 21:21:29,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-15 21:21:29,725 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:29,725 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:29,930 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:21:29,930 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:29,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:29,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1354155866, now seen corresponding path program 1 times [2019-11-15 21:21:29,932 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:21:29,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [608419206] [2019-11-15 21:21:29,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:21:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:21:32,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:21:32,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:21:32,058 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 21:21:32,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:32,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:32,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:32,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-15 21:21:32,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:21:32,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-15 21:21:32,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:32,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:32,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:32,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 21:21:32,151 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:32,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 21:21:32,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:21:32,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:21:32,154 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:21:32,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 21:21:32,200 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-15 21:21:32,200 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 21:21:32,264 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-15 21:21:32,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [608419206] [2019-11-15 21:21:32,264 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:21:32,265 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 8 [2019-11-15 21:21:32,265 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140635940] [2019-11-15 21:21:32,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:21:32,266 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 21:21:32,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:21:32,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:21:32,267 INFO L87 Difference]: Start difference. First operand 597 states and 899 transitions. Second operand 8 states. [2019-11-15 21:21:42,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:21:42,283 INFO L93 Difference]: Finished difference Result 1957 states and 2947 transitions. [2019-11-15 21:21:42,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:21:42,285 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-11-15 21:21:42,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:21:42,295 INFO L225 Difference]: With dead ends: 1957 [2019-11-15 21:21:42,295 INFO L226 Difference]: Without dead ends: 1367 [2019-11-15 21:21:42,297 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:21:42,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2019-11-15 21:21:42,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 751. [2019-11-15 21:21:42,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-11-15 21:21:42,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1153 transitions. [2019-11-15 21:21:42,340 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1153 transitions. Word has length 112 [2019-11-15 21:21:42,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:21:42,343 INFO L462 AbstractCegarLoop]: Abstraction has 751 states and 1153 transitions. [2019-11-15 21:21:42,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:21:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1153 transitions. [2019-11-15 21:21:42,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-15 21:21:42,346 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:21:42,346 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:21:42,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:21:42,556 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:21:42,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:21:42,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1254631592, now seen corresponding path program 1 times [2019-11-15 21:21:42,558 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 21:21:42,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [904844468] [2019-11-15 21:21:42,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:21:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:21:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:21:48,762 INFO L168 tionRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-15 21:21:48,762 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 21:21:48,981 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 21:21:49,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:21:49 BoogieIcfgContainer [2019-11-15 21:21:49,144 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:21:49,145 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:21:49,145 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:21:49,145 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:21:49,146 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:21:11" (3/4) ... [2019-11-15 21:21:49,148 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 21:21:49,297 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7f9c6f75-7152-4da0-8b22-cc40950d71de/bin/uautomizer/witness.graphml [2019-11-15 21:21:49,298 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:21:49,299 INFO L168 Benchmark]: Toolchain (without parser) took 43698.16 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 283.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -121.4 MB). Peak memory consumption was 161.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:49,300 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:21:49,300 INFO L168 Benchmark]: CACSL2BoogieTranslator took 914.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:49,300 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:49,301 INFO L168 Benchmark]: Boogie Preprocessor took 138.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:49,301 INFO L168 Benchmark]: RCFGBuilder took 4804.68 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: 83.8 MB). Peak memory consumption was 83.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:49,302 INFO L168 Benchmark]: TraceAbstraction took 37553.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 114.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -46.8 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:49,303 INFO L168 Benchmark]: Witness Printer took 153.23 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:21:49,305 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 914.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -194.7 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 126.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 138.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4804.68 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: 83.8 MB). Peak memory consumption was 83.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37553.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 114.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -46.8 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. * Witness Printer took 153.23 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1641]: 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_client_data ; VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1065] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1069] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1070] s->ctx = malloc(sizeof(SSL_CTX)) [L1071] s->session = malloc(sizeof(SSL_SESSION)) [L1072] s->state = 12292 [L1073] s->version = __VERIFIER_nondet_int() [L1080] BUF_MEM *buf ; [L1081] unsigned long tmp ; [L1082] unsigned long l ; [L1083] long num1 ; [L1084] void (*cb)() ; [L1085] int ret ; [L1086] int new_state ; [L1087] int state ; [L1088] int skip ; [L1089] int tmp___1 = __VERIFIER_nondet_int() ; [L1090] int tmp___2 = __VERIFIER_nondet_int() ; [L1091] int tmp___3 = __VERIFIER_nondet_int() ; [L1092] int tmp___4 = __VERIFIER_nondet_int() ; [L1093] int tmp___5 = __VERIFIER_nondet_int() ; [L1094] int tmp___6 = __VERIFIER_nondet_int() ; [L1095] int tmp___7 = __VERIFIER_nondet_int() ; [L1096] int tmp___8 = __VERIFIER_nondet_int() ; [L1097] long tmp___9 = __VERIFIER_nondet_long() ; [L1098] int blastFlag ; [L1101] blastFlag = 0 [L1102] s->hit=__VERIFIER_nondet_int () [L1103] s->state = 12292 [L1104] tmp = __VERIFIER_nondet_int() [L1105] cb = (void (*)())((void *)0) [L1106] ret = -1 [L1107] skip = 0 [L1108] EXPR s->info_callback VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1108] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1109] EXPR s->info_callback [L1109] cb = s->info_callback [L1117] EXPR s->in_handshake [L1117] s->in_handshake += 1 [L1118] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1131] COND TRUE s->state == 12292 [L1234] s->new_session = 1 [L1235] s->state = 4096 [L1236] EXPR s->ctx [L1236] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1236] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1241] s->server = 0 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1242] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1247] EXPR s->version VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1247] COND FALSE !((s->version & 65280) != 768) [L1253] s->type = 4096 [L1254] EXPR s->init_buf VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1254] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1272] COND FALSE !(! tmp___4) VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1278] COND FALSE !(! tmp___5) [L1284] s->state = 4368 [L1285] EXPR s->ctx [L1285] EXPR (s->ctx)->stats.sess_connect [L1285] (s->ctx)->stats.sess_connect += 1 [L1286] s->init_num = 0 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1146] COND TRUE s->state == 4368 [L1290] s->shutdown = 0 [L1291] ret = __VERIFIER_nondet_int() [L1292] COND TRUE blastFlag == 0 [L1293] blastFlag = 1 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1297] COND FALSE !(ret <= 0) [L1302] s->state = 4384 [L1303] s->init_num = 0 [L1304] EXPR s->bbio [L1304] EXPR s->wbio VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1304] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1152] COND TRUE s->state == 4384 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 1 [L1314] blastFlag = 2 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1322] COND FALSE !(ret <= 0) [L1327] s->hit VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1327] COND FALSE !(s->hit) [L1330] s->state = 4400 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1332] s->init_num = 0 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1158] COND TRUE s->state == 4400 [L1336] EXPR s->s3 [L1336] EXPR (s->s3)->tmp.new_cipher [L1336] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1336] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1339] ret = __VERIFIER_nondet_int() [L1340] COND TRUE blastFlag == 2 [L1341] blastFlag = 3 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1345] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1351] s->state = 4416 [L1352] s->init_num = 0 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1164] COND TRUE s->state == 4416 [L1356] ret = __VERIFIER_nondet_int() [L1357] COND TRUE blastFlag == 3 [L1358] blastFlag = 4 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1362] COND FALSE !(ret <= 0) [L1367] s->state = 4432 [L1368] s->init_num = 0 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1369] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1600] EXPR s->s3 [L1600] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1600] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1629] skip = 0 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1128] COND TRUE 1 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1130] EXPR s->state [L1130] state = s->state [L1131] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1131] COND FALSE !(s->state == 12292) [L1134] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1134] COND FALSE !(s->state == 16384) [L1137] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1137] COND FALSE !(s->state == 4096) [L1140] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1140] COND FALSE !(s->state == 20480) [L1143] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1143] COND FALSE !(s->state == 4099) [L1146] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1146] COND FALSE !(s->state == 4368) [L1149] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1149] COND FALSE !(s->state == 4369) [L1152] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1152] COND FALSE !(s->state == 4384) [L1155] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1155] COND FALSE !(s->state == 4385) [L1158] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1158] COND FALSE !(s->state == 4400) [L1161] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1161] COND FALSE !(s->state == 4401) [L1164] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1164] COND FALSE !(s->state == 4416) [L1167] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1167] COND FALSE !(s->state == 4417) [L1170] EXPR s->state VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1170] COND TRUE s->state == 4432 [L1378] ret = __VERIFIER_nondet_int() [L1379] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={-1510471540:0}] [L1641] __VERIFIER_error() VAL [init=1, SSLv3_client_data={-1510471540:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 1 error locations. Result: UNSAFE, OverallTime: 37.4s, OverallIterations: 6, TraceHistogramMax: 6, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 875 SDtfs, 1650 SDslu, 2097 SDs, 0 SdLazy, 1610 SolverSat, 218 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 20.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 784 GetRequests, 756 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=751occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 1498 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 7.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 505 NumberOfCodeBlocks, 505 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 776 ConstructedInterpolants, 0 QuantifiedInterpolants, 187485 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1063 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 836/836 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...