./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/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 6b059dfef9f85366fcaeddec812cf96c32b1df0d ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_07deb365-bf9d-4acd-a471-73e4ae1f550b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/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 6b059dfef9f85366fcaeddec812cf96c32b1df0d ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 23:45:32,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:45:32,375 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:45:32,388 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:45:32,389 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:45:32,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:45:32,392 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:45:32,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:45:32,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:45:32,398 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:45:32,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:45:32,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:45:32,401 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:45:32,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:45:32,403 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:45:32,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:45:32,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:45:32,407 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:45:32,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:45:32,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:45:32,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:45:32,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:45:32,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:45:32,417 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:45:32,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:45:32,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:45:32,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:45:32,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:45:32,423 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:45:32,425 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:45:32,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:45:32,426 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:45:32,427 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:45:32,428 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:45:32,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:45:32,429 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:45:32,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:45:32,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:45:32,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:45:32,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:45:32,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:45:32,433 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:45:32,450 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:45:32,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:45:32,452 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:45:32,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:45:32,452 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:45:32,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:45:32,453 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:45:32,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:45:32,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:45:32,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:45:32,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:45:32,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:45:32,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:45:32,455 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:45:32,456 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:45:32,456 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:45:32,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:45:32,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:45:32,457 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:45:32,457 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:45:32,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:45:32,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:45:32,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:45:32,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:45:32,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:45:32,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:45:32,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:45:32,460 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:45:32,460 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_07deb365-bf9d-4acd-a471-73e4ae1f550b/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 -> 6b059dfef9f85366fcaeddec812cf96c32b1df0d [2019-11-15 23:45:32,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:45:32,506 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:45:32,510 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:45:32,511 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:45:32,512 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:45:32,513 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c [2019-11-15 23:45:32,575 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/bin/uautomizer/data/28a39a9e7/03a99644c59c4a86a6f535444049b5c6/FLAGb77f8a68a [2019-11-15 23:45:33,238 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:45:33,239 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c [2019-11-15 23:45:33,278 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/bin/uautomizer/data/28a39a9e7/03a99644c59c4a86a6f535444049b5c6/FLAGb77f8a68a [2019-11-15 23:45:33,463 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/bin/uautomizer/data/28a39a9e7/03a99644c59c4a86a6f535444049b5c6 [2019-11-15 23:45:33,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:45:33,468 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:45:33,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:45:33,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:45:33,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:45:33,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:45:33" (1/1) ... [2019-11-15 23:45:33,476 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b7dd61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:33, skipping insertion in model container [2019-11-15 23:45:33,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:45:33" (1/1) ... [2019-11-15 23:45:33,484 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:45:33,572 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:45:34,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:45:34,200 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:45:34,337 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:45:34,361 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:45:34,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:34 WrapperNode [2019-11-15 23:45:34,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:45:34,367 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:45:34,367 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:45:34,367 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:45:34,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:34" (1/1) ... [2019-11-15 23:45:34,424 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:34" (1/1) ... [2019-11-15 23:45:34,503 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:45:34,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:45:34,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:45:34,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:45:34,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:34" (1/1) ... [2019-11-15 23:45:34,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:34" (1/1) ... [2019-11-15 23:45:34,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:34" (1/1) ... [2019-11-15 23:45:34,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:34" (1/1) ... [2019-11-15 23:45:34,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:34" (1/1) ... [2019-11-15 23:45:34,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:34" (1/1) ... [2019-11-15 23:45:34,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:34" (1/1) ... [2019-11-15 23:45:34,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:45:34,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:45:34,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:45:34,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:45:34,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/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 23:45:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:45:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:45:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:45:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:45:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:45:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:45:34,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:45:34,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:45:34,972 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:45:35,978 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-15 23:45:35,978 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-15 23:45:35,980 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:45:35,980 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:45:35,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:45:35 BoogieIcfgContainer [2019-11-15 23:45:35,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:45:35,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:45:35,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:45:35,985 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:45:35,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:45:33" (1/3) ... [2019-11-15 23:45:35,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1998c6c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:45:35, skipping insertion in model container [2019-11-15 23:45:35,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:34" (2/3) ... [2019-11-15 23:45:35,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1998c6c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:45:35, skipping insertion in model container [2019-11-15 23:45:35,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:45:35" (3/3) ... [2019-11-15 23:45:35,988 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2019-11-15 23:45:35,997 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:45:36,005 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:45:36,015 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:45:36,043 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:45:36,043 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:45:36,043 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:45:36,043 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:45:36,043 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:45:36,044 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:45:36,044 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:45:36,044 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:45:36,065 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2019-11-15 23:45:36,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:45:36,074 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:36,075 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 23:45:36,078 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:36,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:36,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2019-11-15 23:45:36,094 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:36,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216849718] [2019-11-15 23:45:36,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:36,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:36,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:36,457 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 23:45:36,458 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216849718] [2019-11-15 23:45:36,459 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:36,460 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:36,460 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689397358] [2019-11-15 23:45:36,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:36,466 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:36,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:36,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:36,486 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 4 states. [2019-11-15 23:45:37,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:37,054 INFO L93 Difference]: Finished difference Result 259 states and 432 transitions. [2019-11-15 23:45:37,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:37,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-15 23:45:37,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:37,072 INFO L225 Difference]: With dead ends: 259 [2019-11-15 23:45:37,072 INFO L226 Difference]: Without dead ends: 118 [2019-11-15 23:45:37,077 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 23:45:37,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-15 23:45:37,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-11-15 23:45:37,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-15 23:45:37,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 174 transitions. [2019-11-15 23:45:37,153 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 174 transitions. Word has length 24 [2019-11-15 23:45:37,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:37,154 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 174 transitions. [2019-11-15 23:45:37,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:37,155 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 174 transitions. [2019-11-15 23:45:37,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 23:45:37,159 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:37,160 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:37,160 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:37,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:37,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1411658380, now seen corresponding path program 1 times [2019-11-15 23:45:37,161 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:37,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942357578] [2019-11-15 23:45:37,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:37,162 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:37,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:37,417 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 23:45:37,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942357578] [2019-11-15 23:45:37,418 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:37,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:37,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060012177] [2019-11-15 23:45:37,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:37,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:37,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:37,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:37,422 INFO L87 Difference]: Start difference. First operand 117 states and 174 transitions. Second operand 3 states. [2019-11-15 23:45:37,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:37,496 INFO L93 Difference]: Finished difference Result 327 states and 490 transitions. [2019-11-15 23:45:37,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:37,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-15 23:45:37,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:37,501 INFO L225 Difference]: With dead ends: 327 [2019-11-15 23:45:37,501 INFO L226 Difference]: Without dead ends: 220 [2019-11-15 23:45:37,503 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 23:45:37,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-11-15 23:45:37,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-11-15 23:45:37,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-15 23:45:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 324 transitions. [2019-11-15 23:45:37,526 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 324 transitions. Word has length 39 [2019-11-15 23:45:37,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:37,527 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 324 transitions. [2019-11-15 23:45:37,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:37,527 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 324 transitions. [2019-11-15 23:45:37,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 23:45:37,531 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:37,531 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, 1] [2019-11-15 23:45:37,531 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:37,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:37,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1352249408, now seen corresponding path program 1 times [2019-11-15 23:45:37,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:37,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671626055] [2019-11-15 23:45:37,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:37,533 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:37,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:37,722 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 23:45:37,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671626055] [2019-11-15 23:45:37,722 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:37,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:37,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974484296] [2019-11-15 23:45:37,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:37,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:37,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:37,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:37,725 INFO L87 Difference]: Start difference. First operand 220 states and 324 transitions. Second operand 3 states. [2019-11-15 23:45:37,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:37,835 INFO L93 Difference]: Finished difference Result 429 states and 639 transitions. [2019-11-15 23:45:37,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:37,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-15 23:45:37,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:37,842 INFO L225 Difference]: With dead ends: 429 [2019-11-15 23:45:37,842 INFO L226 Difference]: Without dead ends: 322 [2019-11-15 23:45:37,844 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 23:45:37,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-15 23:45:37,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2019-11-15 23:45:37,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-11-15 23:45:37,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 473 transitions. [2019-11-15 23:45:37,911 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 473 transitions. Word has length 54 [2019-11-15 23:45:37,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:37,911 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 473 transitions. [2019-11-15 23:45:37,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:37,912 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 473 transitions. [2019-11-15 23:45:37,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 23:45:37,920 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:37,921 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 23:45:37,922 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:37,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:37,922 INFO L82 PathProgramCache]: Analyzing trace with hash 210697016, now seen corresponding path program 1 times [2019-11-15 23:45:37,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:37,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115695425] [2019-11-15 23:45:37,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:37,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:37,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:38,123 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 23:45:38,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115695425] [2019-11-15 23:45:38,124 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:38,125 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:38,125 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183866497] [2019-11-15 23:45:38,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:38,126 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:38,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:38,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:38,127 INFO L87 Difference]: Start difference. First operand 322 states and 473 transitions. Second operand 4 states. [2019-11-15 23:45:38,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:38,911 INFO L93 Difference]: Finished difference Result 822 states and 1213 transitions. [2019-11-15 23:45:38,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:38,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-15 23:45:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:38,916 INFO L225 Difference]: With dead ends: 822 [2019-11-15 23:45:38,916 INFO L226 Difference]: Without dead ends: 510 [2019-11-15 23:45:38,919 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 23:45:38,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-11-15 23:45:38,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 372. [2019-11-15 23:45:38,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-11-15 23:45:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 559 transitions. [2019-11-15 23:45:38,943 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 559 transitions. Word has length 72 [2019-11-15 23:45:38,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:38,943 INFO L462 AbstractCegarLoop]: Abstraction has 372 states and 559 transitions. [2019-11-15 23:45:38,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:38,944 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 559 transitions. [2019-11-15 23:45:38,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 23:45:38,949 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:38,949 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 23:45:38,949 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:38,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:38,950 INFO L82 PathProgramCache]: Analyzing trace with hash 76683510, now seen corresponding path program 1 times [2019-11-15 23:45:38,950 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:38,950 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734159075] [2019-11-15 23:45:38,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:38,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:38,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:39,063 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 23:45:39,064 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734159075] [2019-11-15 23:45:39,065 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:39,065 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:39,066 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910897728] [2019-11-15 23:45:39,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:39,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:39,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:39,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:39,069 INFO L87 Difference]: Start difference. First operand 372 states and 559 transitions. Second operand 4 states. [2019-11-15 23:45:39,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:39,590 INFO L93 Difference]: Finished difference Result 818 states and 1229 transitions. [2019-11-15 23:45:39,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:39,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-15 23:45:39,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:39,598 INFO L225 Difference]: With dead ends: 818 [2019-11-15 23:45:39,599 INFO L226 Difference]: Without dead ends: 456 [2019-11-15 23:45:39,600 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 23:45:39,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-11-15 23:45:39,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 412. [2019-11-15 23:45:39,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-11-15 23:45:39,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 627 transitions. [2019-11-15 23:45:39,619 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 627 transitions. Word has length 72 [2019-11-15 23:45:39,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:39,620 INFO L462 AbstractCegarLoop]: Abstraction has 412 states and 627 transitions. [2019-11-15 23:45:39,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:39,620 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 627 transitions. [2019-11-15 23:45:39,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 23:45:39,623 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:39,624 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, 1] [2019-11-15 23:45:39,624 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:39,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:39,625 INFO L82 PathProgramCache]: Analyzing trace with hash -2062745025, now seen corresponding path program 1 times [2019-11-15 23:45:39,625 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:39,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450998815] [2019-11-15 23:45:39,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:39,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:39,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:39,740 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 23:45:39,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450998815] [2019-11-15 23:45:39,741 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:39,741 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:39,743 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255283259] [2019-11-15 23:45:39,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:39,743 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:39,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:39,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:39,746 INFO L87 Difference]: Start difference. First operand 412 states and 627 transitions. Second operand 4 states. [2019-11-15 23:45:40,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:40,518 INFO L93 Difference]: Finished difference Result 946 states and 1426 transitions. [2019-11-15 23:45:40,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:40,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-15 23:45:40,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:40,527 INFO L225 Difference]: With dead ends: 946 [2019-11-15 23:45:40,528 INFO L226 Difference]: Without dead ends: 544 [2019-11-15 23:45:40,529 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 23:45:40,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-11-15 23:45:40,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 414. [2019-11-15 23:45:40,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2019-11-15 23:45:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 629 transitions. [2019-11-15 23:45:40,551 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 629 transitions. Word has length 73 [2019-11-15 23:45:40,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:40,558 INFO L462 AbstractCegarLoop]: Abstraction has 414 states and 629 transitions. [2019-11-15 23:45:40,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:40,558 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 629 transitions. [2019-11-15 23:45:40,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 23:45:40,560 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:40,560 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, 1, 1] [2019-11-15 23:45:40,560 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:40,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:40,560 INFO L82 PathProgramCache]: Analyzing trace with hash 475156595, now seen corresponding path program 1 times [2019-11-15 23:45:40,561 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:40,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495284173] [2019-11-15 23:45:40,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:40,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:40,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:40,710 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 23:45:40,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495284173] [2019-11-15 23:45:40,711 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:40,712 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:40,712 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552574010] [2019-11-15 23:45:40,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:40,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:40,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:40,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:40,713 INFO L87 Difference]: Start difference. First operand 414 states and 629 transitions. Second operand 4 states. [2019-11-15 23:45:41,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:41,420 INFO L93 Difference]: Finished difference Result 948 states and 1426 transitions. [2019-11-15 23:45:41,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:41,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 23:45:41,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:41,425 INFO L225 Difference]: With dead ends: 948 [2019-11-15 23:45:41,426 INFO L226 Difference]: Without dead ends: 544 [2019-11-15 23:45:41,427 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 23:45:41,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-11-15 23:45:41,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 416. [2019-11-15 23:45:41,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-11-15 23:45:41,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 631 transitions. [2019-11-15 23:45:41,443 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 631 transitions. Word has length 74 [2019-11-15 23:45:41,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:41,444 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 631 transitions. [2019-11-15 23:45:41,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:41,444 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 631 transitions. [2019-11-15 23:45:41,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 23:45:41,446 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:41,446 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, 1, 1, 1] [2019-11-15 23:45:41,446 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:41,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:41,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1840475418, now seen corresponding path program 1 times [2019-11-15 23:45:41,447 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:41,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066756058] [2019-11-15 23:45:41,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:41,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:41,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:41,604 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 23:45:41,605 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066756058] [2019-11-15 23:45:41,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:41,606 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:41,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003791896] [2019-11-15 23:45:41,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:41,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:41,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:41,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:41,614 INFO L87 Difference]: Start difference. First operand 416 states and 631 transitions. Second operand 4 states. [2019-11-15 23:45:42,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:42,278 INFO L93 Difference]: Finished difference Result 940 states and 1414 transitions. [2019-11-15 23:45:42,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:42,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-15 23:45:42,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:42,285 INFO L225 Difference]: With dead ends: 940 [2019-11-15 23:45:42,287 INFO L226 Difference]: Without dead ends: 534 [2019-11-15 23:45:42,288 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 23:45:42,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-11-15 23:45:42,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 418. [2019-11-15 23:45:42,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-15 23:45:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 633 transitions. [2019-11-15 23:45:42,302 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 633 transitions. Word has length 75 [2019-11-15 23:45:42,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:42,304 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 633 transitions. [2019-11-15 23:45:42,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 633 transitions. [2019-11-15 23:45:42,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 23:45:42,305 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:42,306 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, 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 23:45:42,306 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:42,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:42,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1935805867, now seen corresponding path program 2 times [2019-11-15 23:45:42,307 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:42,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821935465] [2019-11-15 23:45:42,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:42,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:42,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:42,408 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 23:45:42,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821935465] [2019-11-15 23:45:42,408 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:42,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:42,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932478416] [2019-11-15 23:45:42,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:42,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:42,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:42,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:42,410 INFO L87 Difference]: Start difference. First operand 418 states and 633 transitions. Second operand 4 states. [2019-11-15 23:45:42,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:42,956 INFO L93 Difference]: Finished difference Result 940 states and 1412 transitions. [2019-11-15 23:45:42,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:42,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 23:45:42,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:42,960 INFO L225 Difference]: With dead ends: 940 [2019-11-15 23:45:42,961 INFO L226 Difference]: Without dead ends: 532 [2019-11-15 23:45:42,962 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 23:45:42,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-15 23:45:42,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2019-11-15 23:45:42,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-15 23:45:42,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 631 transitions. [2019-11-15 23:45:42,980 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 631 transitions. Word has length 87 [2019-11-15 23:45:42,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:42,983 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 631 transitions. [2019-11-15 23:45:42,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:42,984 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 631 transitions. [2019-11-15 23:45:42,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 23:45:42,986 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:42,986 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:42,986 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:42,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:42,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1954461325, now seen corresponding path program 1 times [2019-11-15 23:45:42,987 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:42,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633690756] [2019-11-15 23:45:42,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:42,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:42,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:43,092 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 23:45:43,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633690756] [2019-11-15 23:45:43,093 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:43,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:43,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700101392] [2019-11-15 23:45:43,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:43,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:43,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:43,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:43,095 INFO L87 Difference]: Start difference. First operand 418 states and 631 transitions. Second operand 4 states. [2019-11-15 23:45:43,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:43,757 INFO L93 Difference]: Finished difference Result 940 states and 1408 transitions. [2019-11-15 23:45:43,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:43,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 23:45:43,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:43,762 INFO L225 Difference]: With dead ends: 940 [2019-11-15 23:45:43,762 INFO L226 Difference]: Without dead ends: 532 [2019-11-15 23:45:43,763 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 23:45:43,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-15 23:45:43,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2019-11-15 23:45:43,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-15 23:45:43,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 629 transitions. [2019-11-15 23:45:43,781 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 629 transitions. Word has length 87 [2019-11-15 23:45:43,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:43,781 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 629 transitions. [2019-11-15 23:45:43,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 629 transitions. [2019-11-15 23:45:43,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 23:45:43,783 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:43,784 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, 1] [2019-11-15 23:45:43,784 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:43,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:43,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1635005334, now seen corresponding path program 1 times [2019-11-15 23:45:43,785 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:43,785 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317799011] [2019-11-15 23:45:43,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:43,786 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:43,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:43,874 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 23:45:43,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317799011] [2019-11-15 23:45:43,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:43,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:43,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115082491] [2019-11-15 23:45:43,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:43,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:43,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:43,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:43,877 INFO L87 Difference]: Start difference. First operand 418 states and 629 transitions. Second operand 4 states. [2019-11-15 23:45:44,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:44,487 INFO L93 Difference]: Finished difference Result 791 states and 1178 transitions. [2019-11-15 23:45:44,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:44,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 23:45:44,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:44,493 INFO L225 Difference]: With dead ends: 791 [2019-11-15 23:45:44,493 INFO L226 Difference]: Without dead ends: 532 [2019-11-15 23:45:44,494 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 23:45:44,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-15 23:45:44,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2019-11-15 23:45:44,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-15 23:45:44,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 627 transitions. [2019-11-15 23:45:44,513 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 627 transitions. Word has length 87 [2019-11-15 23:45:44,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:44,514 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 627 transitions. [2019-11-15 23:45:44,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:44,514 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 627 transitions. [2019-11-15 23:45:44,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 23:45:44,516 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:44,517 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, 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 23:45:44,517 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:44,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:44,517 INFO L82 PathProgramCache]: Analyzing trace with hash 513794263, now seen corresponding path program 2 times [2019-11-15 23:45:44,518 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:44,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792483287] [2019-11-15 23:45:44,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:44,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:44,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 23:45:44,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792483287] [2019-11-15 23:45:44,634 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:44,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:44,634 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660125865] [2019-11-15 23:45:44,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:44,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:44,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:44,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:44,636 INFO L87 Difference]: Start difference. First operand 418 states and 627 transitions. Second operand 4 states. [2019-11-15 23:45:45,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:45,159 INFO L93 Difference]: Finished difference Result 868 states and 1293 transitions. [2019-11-15 23:45:45,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:45,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 23:45:45,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:45,163 INFO L225 Difference]: With dead ends: 868 [2019-11-15 23:45:45,164 INFO L226 Difference]: Without dead ends: 460 [2019-11-15 23:45:45,165 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 23:45:45,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-11-15 23:45:45,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2019-11-15 23:45:45,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-15 23:45:45,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 625 transitions. [2019-11-15 23:45:45,181 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 625 transitions. Word has length 87 [2019-11-15 23:45:45,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:45,181 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 625 transitions. [2019-11-15 23:45:45,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:45,182 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 625 transitions. [2019-11-15 23:45:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 23:45:45,183 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:45,184 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:45,185 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:45,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:45,185 INFO L82 PathProgramCache]: Analyzing trace with hash 495138805, now seen corresponding path program 1 times [2019-11-15 23:45:45,185 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:45,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048968641] [2019-11-15 23:45:45,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:45,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:45,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 23:45:45,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048968641] [2019-11-15 23:45:45,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:45,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:45,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642463559] [2019-11-15 23:45:45,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:45,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:45,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:45,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:45,276 INFO L87 Difference]: Start difference. First operand 418 states and 625 transitions. Second operand 4 states. [2019-11-15 23:45:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:45,743 INFO L93 Difference]: Finished difference Result 868 states and 1289 transitions. [2019-11-15 23:45:45,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:45,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 23:45:45,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:45,747 INFO L225 Difference]: With dead ends: 868 [2019-11-15 23:45:45,748 INFO L226 Difference]: Without dead ends: 460 [2019-11-15 23:45:45,749 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 23:45:45,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-11-15 23:45:45,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2019-11-15 23:45:45,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-15 23:45:45,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 623 transitions. [2019-11-15 23:45:45,764 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 623 transitions. Word has length 87 [2019-11-15 23:45:45,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:45,765 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 623 transitions. [2019-11-15 23:45:45,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:45,765 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 623 transitions. [2019-11-15 23:45:45,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 23:45:45,767 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:45,767 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, 1] [2019-11-15 23:45:45,767 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:45,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:45,768 INFO L82 PathProgramCache]: Analyzing trace with hash -210361832, now seen corresponding path program 1 times [2019-11-15 23:45:45,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:45,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223163581] [2019-11-15 23:45:45,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:45,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:45,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:45,865 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 23:45:45,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223163581] [2019-11-15 23:45:45,865 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:45,866 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:45,866 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886804600] [2019-11-15 23:45:45,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:45,866 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:45,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:45,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:45,867 INFO L87 Difference]: Start difference. First operand 418 states and 623 transitions. Second operand 4 states. [2019-11-15 23:45:46,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:46,352 INFO L93 Difference]: Finished difference Result 719 states and 1062 transitions. [2019-11-15 23:45:46,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:46,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 23:45:46,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:46,357 INFO L225 Difference]: With dead ends: 719 [2019-11-15 23:45:46,357 INFO L226 Difference]: Without dead ends: 460 [2019-11-15 23:45:46,359 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 23:45:46,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-11-15 23:45:46,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2019-11-15 23:45:46,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-15 23:45:46,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 621 transitions. [2019-11-15 23:45:46,377 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 621 transitions. Word has length 87 [2019-11-15 23:45:46,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:46,377 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 621 transitions. [2019-11-15 23:45:46,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:46,377 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 621 transitions. [2019-11-15 23:45:46,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 23:45:46,379 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:46,379 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:46,380 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:46,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:46,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1668397004, now seen corresponding path program 1 times [2019-11-15 23:45:46,380 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:46,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996881334] [2019-11-15 23:45:46,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:46,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:46,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:46,456 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 23:45:46,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996881334] [2019-11-15 23:45:46,456 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:46,457 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:46,457 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625031847] [2019-11-15 23:45:46,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:46,457 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:46,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:46,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:46,458 INFO L87 Difference]: Start difference. First operand 418 states and 621 transitions. Second operand 4 states. [2019-11-15 23:45:47,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:47,117 INFO L93 Difference]: Finished difference Result 940 states and 1388 transitions. [2019-11-15 23:45:47,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:47,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 23:45:47,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:47,122 INFO L225 Difference]: With dead ends: 940 [2019-11-15 23:45:47,122 INFO L226 Difference]: Without dead ends: 532 [2019-11-15 23:45:47,125 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 23:45:47,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-15 23:45:47,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 418. [2019-11-15 23:45:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-15 23:45:47,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 619 transitions. [2019-11-15 23:45:47,142 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 619 transitions. Word has length 88 [2019-11-15 23:45:47,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:47,143 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 619 transitions. [2019-11-15 23:45:47,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:47,143 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 619 transitions. [2019-11-15 23:45:47,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 23:45:47,145 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:47,145 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, 1] [2019-11-15 23:45:47,145 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:47,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:47,146 INFO L82 PathProgramCache]: Analyzing trace with hash -570561745, now seen corresponding path program 1 times [2019-11-15 23:45:47,146 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:47,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451777656] [2019-11-15 23:45:47,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:47,147 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:47,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:47,236 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 23:45:47,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451777656] [2019-11-15 23:45:47,239 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:47,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:47,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967905874] [2019-11-15 23:45:47,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:47,240 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:47,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:47,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:47,241 INFO L87 Difference]: Start difference. First operand 418 states and 619 transitions. Second operand 4 states. [2019-11-15 23:45:47,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:47,874 INFO L93 Difference]: Finished difference Result 785 states and 1156 transitions. [2019-11-15 23:45:47,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:47,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 23:45:47,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:47,879 INFO L225 Difference]: With dead ends: 785 [2019-11-15 23:45:47,879 INFO L226 Difference]: Without dead ends: 526 [2019-11-15 23:45:47,880 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 23:45:47,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-11-15 23:45:47,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 418. [2019-11-15 23:45:47,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-15 23:45:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 617 transitions. [2019-11-15 23:45:47,898 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 617 transitions. Word has length 88 [2019-11-15 23:45:47,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:47,898 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 617 transitions. [2019-11-15 23:45:47,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:47,898 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 617 transitions. [2019-11-15 23:45:47,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 23:45:47,900 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:47,900 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:47,901 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:47,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:47,901 INFO L82 PathProgramCache]: Analyzing trace with hash 296589706, now seen corresponding path program 1 times [2019-11-15 23:45:47,901 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:47,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966308880] [2019-11-15 23:45:47,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:47,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:47,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 23:45:47,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966308880] [2019-11-15 23:45:47,985 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:47,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:47,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630013784] [2019-11-15 23:45:48,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:48,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:48,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:48,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:48,026 INFO L87 Difference]: Start difference. First operand 418 states and 617 transitions. Second operand 4 states. [2019-11-15 23:45:48,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:48,487 INFO L93 Difference]: Finished difference Result 868 states and 1273 transitions. [2019-11-15 23:45:48,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:48,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 23:45:48,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:48,491 INFO L225 Difference]: With dead ends: 868 [2019-11-15 23:45:48,491 INFO L226 Difference]: Without dead ends: 460 [2019-11-15 23:45:48,493 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 23:45:48,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-11-15 23:45:48,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 418. [2019-11-15 23:45:48,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-15 23:45:48,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 615 transitions. [2019-11-15 23:45:48,509 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 615 transitions. Word has length 88 [2019-11-15 23:45:48,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:48,509 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 615 transitions. [2019-11-15 23:45:48,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:48,510 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 615 transitions. [2019-11-15 23:45:48,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 23:45:48,511 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:48,511 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, 1] [2019-11-15 23:45:48,512 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:48,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:48,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1942369043, now seen corresponding path program 1 times [2019-11-15 23:45:48,512 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:48,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363487996] [2019-11-15 23:45:48,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:48,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:48,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:48,594 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 23:45:48,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363487996] [2019-11-15 23:45:48,595 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:48,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:48,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905056647] [2019-11-15 23:45:48,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:48,596 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:48,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:48,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:48,597 INFO L87 Difference]: Start difference. First operand 418 states and 615 transitions. Second operand 4 states. [2019-11-15 23:45:49,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:49,080 INFO L93 Difference]: Finished difference Result 713 states and 1043 transitions. [2019-11-15 23:45:49,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:49,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 23:45:49,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:49,084 INFO L225 Difference]: With dead ends: 713 [2019-11-15 23:45:49,084 INFO L226 Difference]: Without dead ends: 454 [2019-11-15 23:45:49,085 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 23:45:49,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-15 23:45:49,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 418. [2019-11-15 23:45:49,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-15 23:45:49,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 613 transitions. [2019-11-15 23:45:49,101 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 613 transitions. Word has length 88 [2019-11-15 23:45:49,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:49,102 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 613 transitions. [2019-11-15 23:45:49,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:49,102 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 613 transitions. [2019-11-15 23:45:49,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 23:45:49,104 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:49,104 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:49,104 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:49,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:49,105 INFO L82 PathProgramCache]: Analyzing trace with hash -233112104, now seen corresponding path program 1 times [2019-11-15 23:45:49,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:49,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933787473] [2019-11-15 23:45:49,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:49,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:49,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 23:45:49,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933787473] [2019-11-15 23:45:49,185 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:49,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:49,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081864184] [2019-11-15 23:45:49,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:49,187 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:49,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:49,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:49,188 INFO L87 Difference]: Start difference. First operand 418 states and 613 transitions. Second operand 4 states. [2019-11-15 23:45:49,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:49,813 INFO L93 Difference]: Finished difference Result 934 states and 1365 transitions. [2019-11-15 23:45:49,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:49,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-15 23:45:49,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:49,818 INFO L225 Difference]: With dead ends: 934 [2019-11-15 23:45:49,818 INFO L226 Difference]: Without dead ends: 526 [2019-11-15 23:45:49,819 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 23:45:49,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-11-15 23:45:49,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 418. [2019-11-15 23:45:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-15 23:45:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 611 transitions. [2019-11-15 23:45:49,837 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 611 transitions. Word has length 89 [2019-11-15 23:45:49,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:49,837 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 611 transitions. [2019-11-15 23:45:49,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:49,838 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 611 transitions. [2019-11-15 23:45:49,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 23:45:49,839 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:49,840 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:49,840 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:49,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:49,840 INFO L82 PathProgramCache]: Analyzing trace with hash 190534618, now seen corresponding path program 1 times [2019-11-15 23:45:49,841 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:49,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744506143] [2019-11-15 23:45:49,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:49,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:49,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 23:45:49,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744506143] [2019-11-15 23:45:49,939 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:49,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:49,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396317985] [2019-11-15 23:45:49,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:49,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:49,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:49,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:49,941 INFO L87 Difference]: Start difference. First operand 418 states and 611 transitions. Second operand 4 states. [2019-11-15 23:45:50,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:50,396 INFO L93 Difference]: Finished difference Result 862 states and 1254 transitions. [2019-11-15 23:45:50,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:50,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-15 23:45:50,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:50,400 INFO L225 Difference]: With dead ends: 862 [2019-11-15 23:45:50,400 INFO L226 Difference]: Without dead ends: 454 [2019-11-15 23:45:50,402 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 23:45:50,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-15 23:45:50,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 418. [2019-11-15 23:45:50,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-15 23:45:50,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 609 transitions. [2019-11-15 23:45:50,417 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 609 transitions. Word has length 89 [2019-11-15 23:45:50,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:50,418 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 609 transitions. [2019-11-15 23:45:50,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:50,418 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 609 transitions. [2019-11-15 23:45:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 23:45:50,423 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:50,423 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:50,423 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:50,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:50,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1591319919, now seen corresponding path program 1 times [2019-11-15 23:45:50,424 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:50,424 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237955716] [2019-11-15 23:45:50,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:50,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:50,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:50,505 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 23:45:50,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237955716] [2019-11-15 23:45:50,505 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:50,506 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:50,506 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933819128] [2019-11-15 23:45:50,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:50,507 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:50,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:50,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:50,507 INFO L87 Difference]: Start difference. First operand 418 states and 609 transitions. Second operand 4 states. [2019-11-15 23:45:51,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:51,109 INFO L93 Difference]: Finished difference Result 916 states and 1335 transitions. [2019-11-15 23:45:51,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:51,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-15 23:45:51,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:51,114 INFO L225 Difference]: With dead ends: 916 [2019-11-15 23:45:51,114 INFO L226 Difference]: Without dead ends: 508 [2019-11-15 23:45:51,115 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 23:45:51,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-11-15 23:45:51,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 418. [2019-11-15 23:45:51,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-15 23:45:51,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 607 transitions. [2019-11-15 23:45:51,130 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 607 transitions. Word has length 90 [2019-11-15 23:45:51,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:51,131 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 607 transitions. [2019-11-15 23:45:51,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:51,131 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 607 transitions. [2019-11-15 23:45:51,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 23:45:51,133 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:51,133 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] [2019-11-15 23:45:51,133 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:51,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:51,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1012220386, now seen corresponding path program 1 times [2019-11-15 23:45:51,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:51,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573756015] [2019-11-15 23:45:51,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:51,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:51,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:51,229 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 23:45:51,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573756015] [2019-11-15 23:45:51,230 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:51,230 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:51,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985113175] [2019-11-15 23:45:51,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:51,231 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:51,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:51,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:51,232 INFO L87 Difference]: Start difference. First operand 418 states and 607 transitions. Second operand 4 states. [2019-11-15 23:45:51,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:51,889 INFO L93 Difference]: Finished difference Result 916 states and 1331 transitions. [2019-11-15 23:45:51,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:51,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-15 23:45:51,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:51,896 INFO L225 Difference]: With dead ends: 916 [2019-11-15 23:45:51,896 INFO L226 Difference]: Without dead ends: 508 [2019-11-15 23:45:51,898 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 23:45:51,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-11-15 23:45:51,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 418. [2019-11-15 23:45:51,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-15 23:45:51,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 605 transitions. [2019-11-15 23:45:51,916 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 605 transitions. Word has length 90 [2019-11-15 23:45:51,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:51,917 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 605 transitions. [2019-11-15 23:45:51,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:51,917 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 605 transitions. [2019-11-15 23:45:51,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 23:45:51,919 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:51,919 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:51,919 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:51,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:51,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1343173425, now seen corresponding path program 1 times [2019-11-15 23:45:51,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:51,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994447249] [2019-11-15 23:45:51,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:51,921 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:51,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:52,022 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 23:45:52,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994447249] [2019-11-15 23:45:52,023 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:52,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:52,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288945994] [2019-11-15 23:45:52,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:52,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:52,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:52,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:52,026 INFO L87 Difference]: Start difference. First operand 418 states and 605 transitions. Second operand 4 states. [2019-11-15 23:45:52,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:52,471 INFO L93 Difference]: Finished difference Result 844 states and 1220 transitions. [2019-11-15 23:45:52,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:52,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-15 23:45:52,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:52,475 INFO L225 Difference]: With dead ends: 844 [2019-11-15 23:45:52,476 INFO L226 Difference]: Without dead ends: 436 [2019-11-15 23:45:52,477 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 23:45:52,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-11-15 23:45:52,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 418. [2019-11-15 23:45:52,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-11-15 23:45:52,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 603 transitions. [2019-11-15 23:45:52,493 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 603 transitions. Word has length 90 [2019-11-15 23:45:52,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:52,494 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 603 transitions. [2019-11-15 23:45:52,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:52,494 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 603 transitions. [2019-11-15 23:45:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 23:45:52,496 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:52,496 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] [2019-11-15 23:45:52,496 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:52,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:52,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1260366880, now seen corresponding path program 1 times [2019-11-15 23:45:52,497 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:52,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537702026] [2019-11-15 23:45:52,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:52,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:52,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:52,572 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 23:45:52,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537702026] [2019-11-15 23:45:52,572 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:52,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:52,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007108147] [2019-11-15 23:45:52,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:52,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:52,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:52,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:52,574 INFO L87 Difference]: Start difference. First operand 418 states and 603 transitions. Second operand 3 states. [2019-11-15 23:45:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:52,620 INFO L93 Difference]: Finished difference Result 828 states and 1201 transitions. [2019-11-15 23:45:52,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:52,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-11-15 23:45:52,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:52,625 INFO L225 Difference]: With dead ends: 828 [2019-11-15 23:45:52,625 INFO L226 Difference]: Without dead ends: 571 [2019-11-15 23:45:52,626 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 23:45:52,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-15 23:45:52,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-11-15 23:45:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-15 23:45:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 824 transitions. [2019-11-15 23:45:52,647 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 824 transitions. Word has length 90 [2019-11-15 23:45:52,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:52,647 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 824 transitions. [2019-11-15 23:45:52,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:52,648 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 824 transitions. [2019-11-15 23:45:52,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 23:45:52,650 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:52,650 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, 1] [2019-11-15 23:45:52,650 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:52,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:52,651 INFO L82 PathProgramCache]: Analyzing trace with hash -584407498, now seen corresponding path program 1 times [2019-11-15 23:45:52,651 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:52,651 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173073627] [2019-11-15 23:45:52,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:52,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:52,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:52,722 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 23:45:52,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173073627] [2019-11-15 23:45:52,723 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:52,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:52,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197418820] [2019-11-15 23:45:52,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:52,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:52,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:52,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:52,725 INFO L87 Difference]: Start difference. First operand 571 states and 824 transitions. Second operand 3 states. [2019-11-15 23:45:52,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:52,769 INFO L93 Difference]: Finished difference Result 726 states and 1049 transitions. [2019-11-15 23:45:52,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:52,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-11-15 23:45:52,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:52,775 INFO L225 Difference]: With dead ends: 726 [2019-11-15 23:45:52,775 INFO L226 Difference]: Without dead ends: 724 [2019-11-15 23:45:52,775 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 23:45:52,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-11-15 23:45:52,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2019-11-15 23:45:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-11-15 23:45:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1046 transitions. [2019-11-15 23:45:52,799 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1046 transitions. Word has length 92 [2019-11-15 23:45:52,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:52,799 INFO L462 AbstractCegarLoop]: Abstraction has 724 states and 1046 transitions. [2019-11-15 23:45:52,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:52,799 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1046 transitions. [2019-11-15 23:45:52,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-15 23:45:52,802 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:52,802 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, 1] [2019-11-15 23:45:52,802 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:52,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:52,803 INFO L82 PathProgramCache]: Analyzing trace with hash -782701753, now seen corresponding path program 1 times [2019-11-15 23:45:52,806 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:52,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131634231] [2019-11-15 23:45:52,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:52,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:52,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:52,894 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 23:45:52,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131634231] [2019-11-15 23:45:52,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:52,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:45:52,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845911368] [2019-11-15 23:45:52,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:45:52,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:52,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:45:52,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:45:52,897 INFO L87 Difference]: Start difference. First operand 724 states and 1046 transitions. Second operand 3 states. [2019-11-15 23:45:52,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:52,930 INFO L93 Difference]: Finished difference Result 726 states and 1047 transitions. [2019-11-15 23:45:52,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:45:52,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-11-15 23:45:52,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:52,936 INFO L225 Difference]: With dead ends: 726 [2019-11-15 23:45:52,936 INFO L226 Difference]: Without dead ends: 724 [2019-11-15 23:45:52,936 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 23:45:52,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-11-15 23:45:52,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2019-11-15 23:45:52,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-11-15 23:45:52,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1045 transitions. [2019-11-15 23:45:52,961 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1045 transitions. Word has length 113 [2019-11-15 23:45:52,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:52,961 INFO L462 AbstractCegarLoop]: Abstraction has 724 states and 1045 transitions. [2019-11-15 23:45:52,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:45:52,962 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1045 transitions. [2019-11-15 23:45:52,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-15 23:45:52,964 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:52,964 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, 1, 1, 1] [2019-11-15 23:45:52,965 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:52,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:52,965 INFO L82 PathProgramCache]: Analyzing trace with hash -698320702, now seen corresponding path program 1 times [2019-11-15 23:45:52,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:52,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209848411] [2019-11-15 23:45:52,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:52,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:52,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:53,075 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 23:45:53,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209848411] [2019-11-15 23:45:53,076 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:53,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:53,076 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568956587] [2019-11-15 23:45:53,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:53,077 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:53,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:53,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:53,078 INFO L87 Difference]: Start difference. First operand 724 states and 1045 transitions. Second operand 4 states. [2019-11-15 23:45:53,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:53,620 INFO L93 Difference]: Finished difference Result 1695 states and 2458 transitions. [2019-11-15 23:45:53,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:53,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-15 23:45:53,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:53,629 INFO L225 Difference]: With dead ends: 1695 [2019-11-15 23:45:53,629 INFO L226 Difference]: Without dead ends: 981 [2019-11-15 23:45:53,631 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:45:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2019-11-15 23:45:53,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 844. [2019-11-15 23:45:53,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-11-15 23:45:53,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1255 transitions. [2019-11-15 23:45:53,665 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1255 transitions. Word has length 115 [2019-11-15 23:45:53,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:53,665 INFO L462 AbstractCegarLoop]: Abstraction has 844 states and 1255 transitions. [2019-11-15 23:45:53,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1255 transitions. [2019-11-15 23:45:53,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-15 23:45:53,669 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:53,669 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:53,669 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:53,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:53,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1667253281, now seen corresponding path program 2 times [2019-11-15 23:45:53,670 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:53,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391503034] [2019-11-15 23:45:53,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:53,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:53,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:53,781 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 23:45:53,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391503034] [2019-11-15 23:45:53,782 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:53,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:53,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200450005] [2019-11-15 23:45:53,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:53,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:53,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:53,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:53,784 INFO L87 Difference]: Start difference. First operand 844 states and 1255 transitions. Second operand 4 states. [2019-11-15 23:45:54,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:54,302 INFO L93 Difference]: Finished difference Result 1810 states and 2658 transitions. [2019-11-15 23:45:54,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:54,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-11-15 23:45:54,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:54,311 INFO L225 Difference]: With dead ends: 1810 [2019-11-15 23:45:54,311 INFO L226 Difference]: Without dead ends: 976 [2019-11-15 23:45:54,313 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:45:54,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-11-15 23:45:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 844. [2019-11-15 23:45:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-11-15 23:45:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1250 transitions. [2019-11-15 23:45:54,345 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1250 transitions. Word has length 130 [2019-11-15 23:45:54,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:54,346 INFO L462 AbstractCegarLoop]: Abstraction has 844 states and 1250 transitions. [2019-11-15 23:45:54,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:54,346 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1250 transitions. [2019-11-15 23:45:54,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-15 23:45:54,350 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:54,350 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:54,350 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:54,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:54,351 INFO L82 PathProgramCache]: Analyzing trace with hash 919227327, now seen corresponding path program 1 times [2019-11-15 23:45:54,351 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:54,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562107412] [2019-11-15 23:45:54,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:54,352 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:54,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:54,455 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 23:45:54,456 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562107412] [2019-11-15 23:45:54,456 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:54,456 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:54,457 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818061542] [2019-11-15 23:45:54,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:54,459 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:54,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:54,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:54,465 INFO L87 Difference]: Start difference. First operand 844 states and 1250 transitions. Second operand 4 states. [2019-11-15 23:45:55,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:55,006 INFO L93 Difference]: Finished difference Result 1810 states and 2648 transitions. [2019-11-15 23:45:55,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:55,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-11-15 23:45:55,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:55,014 INFO L225 Difference]: With dead ends: 1810 [2019-11-15 23:45:55,014 INFO L226 Difference]: Without dead ends: 976 [2019-11-15 23:45:55,017 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:45:55,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-11-15 23:45:55,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 844. [2019-11-15 23:45:55,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2019-11-15 23:45:55,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1245 transitions. [2019-11-15 23:45:55,050 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1245 transitions. Word has length 130 [2019-11-15 23:45:55,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:55,050 INFO L462 AbstractCegarLoop]: Abstraction has 844 states and 1245 transitions. [2019-11-15 23:45:55,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:55,051 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1245 transitions. [2019-11-15 23:45:55,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-15 23:45:55,054 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:55,054 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:55,054 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:55,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:55,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1537947938, now seen corresponding path program 1 times [2019-11-15 23:45:55,055 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:55,055 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157273678] [2019-11-15 23:45:55,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:55,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:55,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:55,215 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-15 23:45:55,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157273678] [2019-11-15 23:45:55,215 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:55,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:55,216 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236576352] [2019-11-15 23:45:55,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:55,217 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:55,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:55,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:55,217 INFO L87 Difference]: Start difference. First operand 844 states and 1245 transitions. Second operand 4 states. [2019-11-15 23:45:55,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:55,648 INFO L93 Difference]: Finished difference Result 1641 states and 2428 transitions. [2019-11-15 23:45:55,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:55,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-11-15 23:45:55,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:55,656 INFO L225 Difference]: With dead ends: 1641 [2019-11-15 23:45:55,656 INFO L226 Difference]: Without dead ends: 982 [2019-11-15 23:45:55,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:45:55,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-11-15 23:45:55,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 916. [2019-11-15 23:45:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-11-15 23:45:55,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1365 transitions. [2019-11-15 23:45:55,690 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1365 transitions. Word has length 130 [2019-11-15 23:45:55,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:55,691 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1365 transitions. [2019-11-15 23:45:55,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:55,691 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1365 transitions. [2019-11-15 23:45:55,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-15 23:45:55,694 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:55,695 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:55,695 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:55,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:55,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1834884522, now seen corresponding path program 1 times [2019-11-15 23:45:55,696 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:55,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385465746] [2019-11-15 23:45:55,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:55,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:55,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:55,791 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 23:45:55,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385465746] [2019-11-15 23:45:55,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:55,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:55,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697348514] [2019-11-15 23:45:55,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:55,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:55,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:55,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:55,793 INFO L87 Difference]: Start difference. First operand 916 states and 1365 transitions. Second operand 4 states. [2019-11-15 23:45:56,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:56,310 INFO L93 Difference]: Finished difference Result 1954 states and 2878 transitions. [2019-11-15 23:45:56,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:56,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-11-15 23:45:56,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:56,318 INFO L225 Difference]: With dead ends: 1954 [2019-11-15 23:45:56,318 INFO L226 Difference]: Without dead ends: 1048 [2019-11-15 23:45:56,320 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:45:56,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-11-15 23:45:56,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 916. [2019-11-15 23:45:56,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-11-15 23:45:56,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1360 transitions. [2019-11-15 23:45:56,351 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1360 transitions. Word has length 131 [2019-11-15 23:45:56,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:56,351 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1360 transitions. [2019-11-15 23:45:56,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:56,352 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1360 transitions. [2019-11-15 23:45:56,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-15 23:45:56,355 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:56,355 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:56,356 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:56,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:56,356 INFO L82 PathProgramCache]: Analyzing trace with hash 653511332, now seen corresponding path program 1 times [2019-11-15 23:45:56,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:56,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071584750] [2019-11-15 23:45:56,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:56,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:56,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 23:45:56,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071584750] [2019-11-15 23:45:56,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:56,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:56,461 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304016428] [2019-11-15 23:45:56,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:56,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:56,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:56,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:56,463 INFO L87 Difference]: Start difference. First operand 916 states and 1360 transitions. Second operand 4 states. [2019-11-15 23:45:56,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:56,950 INFO L93 Difference]: Finished difference Result 1954 states and 2868 transitions. [2019-11-15 23:45:56,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:56,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-11-15 23:45:56,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:56,959 INFO L225 Difference]: With dead ends: 1954 [2019-11-15 23:45:56,959 INFO L226 Difference]: Without dead ends: 1048 [2019-11-15 23:45:56,962 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:45:56,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-11-15 23:45:56,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 916. [2019-11-15 23:45:56,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-11-15 23:45:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1355 transitions. [2019-11-15 23:45:56,994 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1355 transitions. Word has length 132 [2019-11-15 23:45:56,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:56,995 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1355 transitions. [2019-11-15 23:45:56,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:56,995 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1355 transitions. [2019-11-15 23:45:56,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-15 23:45:56,999 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:56,999 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:56,999 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:57,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:57,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1844078565, now seen corresponding path program 1 times [2019-11-15 23:45:57,000 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:57,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813388528] [2019-11-15 23:45:57,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:57,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:57,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:57,092 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 23:45:57,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813388528] [2019-11-15 23:45:57,092 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:57,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:57,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778983036] [2019-11-15 23:45:57,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:57,094 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:57,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:57,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:57,094 INFO L87 Difference]: Start difference. First operand 916 states and 1355 transitions. Second operand 4 states. [2019-11-15 23:45:57,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:57,551 INFO L93 Difference]: Finished difference Result 1909 states and 2803 transitions. [2019-11-15 23:45:57,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:57,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-11-15 23:45:57,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:57,560 INFO L225 Difference]: With dead ends: 1909 [2019-11-15 23:45:57,560 INFO L226 Difference]: Without dead ends: 1003 [2019-11-15 23:45:57,562 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:45:57,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-11-15 23:45:57,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 916. [2019-11-15 23:45:57,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2019-11-15 23:45:57,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1350 transitions. [2019-11-15 23:45:57,595 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1350 transitions. Word has length 133 [2019-11-15 23:45:57,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:57,596 INFO L462 AbstractCegarLoop]: Abstraction has 916 states and 1350 transitions. [2019-11-15 23:45:57,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:57,596 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1350 transitions. [2019-11-15 23:45:57,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-15 23:45:57,600 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:57,600 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:57,600 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:57,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:57,601 INFO L82 PathProgramCache]: Analyzing trace with hash 487188268, now seen corresponding path program 1 times [2019-11-15 23:45:57,601 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:57,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059856100] [2019-11-15 23:45:57,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:57,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:57,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:57,711 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-11-15 23:45:57,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059856100] [2019-11-15 23:45:57,712 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:45:57,712 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:45:57,712 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979577114] [2019-11-15 23:45:57,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:45:57,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:45:57,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:45:57,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:45:57,714 INFO L87 Difference]: Start difference. First operand 916 states and 1350 transitions. Second operand 4 states. [2019-11-15 23:45:58,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:58,235 INFO L93 Difference]: Finished difference Result 2054 states and 3033 transitions. [2019-11-15 23:45:58,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:45:58,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-11-15 23:45:58,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:58,245 INFO L225 Difference]: With dead ends: 2054 [2019-11-15 23:45:58,245 INFO L226 Difference]: Without dead ends: 1148 [2019-11-15 23:45:58,247 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:45:58,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-11-15 23:45:58,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1026. [2019-11-15 23:45:58,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026 states. [2019-11-15 23:45:58,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1540 transitions. [2019-11-15 23:45:58,288 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1540 transitions. Word has length 133 [2019-11-15 23:45:58,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:58,288 INFO L462 AbstractCegarLoop]: Abstraction has 1026 states and 1540 transitions. [2019-11-15 23:45:58,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:45:58,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1540 transitions. [2019-11-15 23:45:58,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-15 23:45:58,292 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:58,293 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1] [2019-11-15 23:45:58,294 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:45:58,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:58,294 INFO L82 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2019-11-15 23:45:58,294 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:58,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436370956] [2019-11-15 23:45:58,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:58,295 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:58,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:45:59,098 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:45:59,098 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:45:59,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:45:59 BoogieIcfgContainer [2019-11-15 23:45:59,355 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:45:59,355 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:45:59,356 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:45:59,356 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:45:59,357 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:45:35" (3/4) ... [2019-11-15 23:45:59,362 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:45:59,363 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:45:59,365 INFO L168 Benchmark]: Toolchain (without parser) took 25896.91 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 360.2 MB). Free memory was 938.0 MB in the beginning and 1.3 GB in the end (delta: -363.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:45:59,366 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:45:59,367 INFO L168 Benchmark]: CACSL2BoogieTranslator took 897.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -157.9 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:59,367 INFO L168 Benchmark]: Boogie Procedure Inliner took 137.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:59,368 INFO L168 Benchmark]: Boogie Preprocessor took 137.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:59,369 INFO L168 Benchmark]: RCFGBuilder took 1339.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 993.5 MB in the end (delta: 86.3 MB). Peak memory consumption was 86.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:59,369 INFO L168 Benchmark]: TraceAbstraction took 23372.36 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 241.2 MB). Free memory was 993.5 MB in the beginning and 1.3 GB in the end (delta: -307.6 MB). Peak memory consumption was 418.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:59,369 INFO L168 Benchmark]: Witness Printer took 7.29 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:45:59,372 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 897.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -157.9 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 137.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 137.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1339.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 993.5 MB in the end (delta: 86.3 MB). Peak memory consumption was 86.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23372.36 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 241.2 MB). Free memory was 993.5 MB in the beginning and 1.3 GB in the end (delta: -307.6 MB). Peak memory consumption was 418.0 MB. Max. memory is 11.5 GB. * Witness Printer took 7.29 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1644]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1329. 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 = (BUF_MEM *)__VERIFIER_nondet_ulong(); [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 ; [L1092] int tmp___4 ; [L1093] int tmp___5 ; [L1094] int tmp___6 ; [L1095] int tmp___7 ; [L1096] int tmp___8 ; [L1097] long tmp___9 ; [L1099] int blastFlag ; [L1102] blastFlag = 0 [L1103] s->hit=__VERIFIER_nondet_int () [L1104] s->state = 12292 [L1105] tmp = __VERIFIER_nondet_int() [L1106] cb = (void (*)())((void *)0) [L1107] ret = -1 [L1108] skip = 0 [L1109] EXPR s->info_callback VAL [init=1, SSLv3_client_data={-3:0}] [L1109] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1110] EXPR s->info_callback [L1110] cb = s->info_callback [L1118] EXPR s->in_handshake [L1118] s->in_handshake += 1 [L1119] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={-3:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={-3:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1132] COND TRUE s->state == 12292 [L1235] s->new_session = 1 [L1236] s->state = 4096 [L1237] EXPR s->ctx [L1237] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1237] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1242] s->server = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1243] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={-3:0}] [L1248] EXPR s->version VAL [init=1, SSLv3_client_data={-3:0}] [L1248] COND FALSE !((s->version & 65280) != 768) [L1254] s->type = 4096 [L1255] EXPR s->init_buf VAL [init=1, SSLv3_client_data={-3:0}] [L1255] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1267] tmp___4 = __VERIFIER_nondet_int() [L1268] COND FALSE !(! tmp___4) [L1274] tmp___5 = __VERIFIER_nondet_int() [L1275] COND FALSE !(! tmp___5) [L1281] s->state = 4368 [L1282] EXPR s->ctx [L1282] EXPR (s->ctx)->stats.sess_connect [L1282] (s->ctx)->stats.sess_connect += 1 [L1283] s->init_num = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-3:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={-3:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1147] COND TRUE s->state == 4368 [L1287] s->shutdown = 0 [L1288] ret = __VERIFIER_nondet_int() [L1289] COND TRUE blastFlag == 0 [L1290] blastFlag = 1 VAL [init=1, SSLv3_client_data={-3:0}] [L1294] COND FALSE !(ret <= 0) [L1299] s->state = 4384 [L1300] s->init_num = 0 [L1301] EXPR s->bbio [L1301] EXPR s->wbio VAL [init=1, SSLv3_client_data={-3:0}] [L1301] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-3:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={-3:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1153] COND TRUE s->state == 4384 [L1309] ret = __VERIFIER_nondet_int() [L1310] COND TRUE blastFlag == 1 [L1311] blastFlag = 2 VAL [init=1, SSLv3_client_data={-3:0}] [L1315] COND FALSE !(ret <= 0) [L1320] s->hit VAL [init=1, SSLv3_client_data={-3:0}] [L1320] COND FALSE !(s->hit) [L1323] s->state = 4400 VAL [init=1, SSLv3_client_data={-3:0}] [L1325] s->init_num = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-3:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={-3:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1159] COND TRUE s->state == 4400 [L1329] EXPR s->s3 [L1329] EXPR (s->s3)->tmp.new_cipher [L1329] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={-3:0}] [L1329] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1332] ret = __VERIFIER_nondet_int() [L1333] COND TRUE blastFlag == 2 [L1334] blastFlag = 3 VAL [init=1, SSLv3_client_data={-3:0}] [L1338] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={-3:0}] [L1344] s->state = 4416 [L1345] s->init_num = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-3:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={-3:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1159] COND FALSE !(s->state == 4400) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1162] COND FALSE !(s->state == 4401) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1165] COND TRUE s->state == 4416 [L1349] ret = __VERIFIER_nondet_int() [L1350] COND TRUE blastFlag == 3 [L1351] blastFlag = 4 VAL [init=1, SSLv3_client_data={-3:0}] [L1355] COND FALSE !(ret <= 0) [L1360] s->state = 4432 [L1361] s->init_num = 0 [L1362] tmp___6 = __VERIFIER_nondet_int() [L1363] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={-3:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-3:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={-3:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1159] COND FALSE !(s->state == 4400) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1162] COND FALSE !(s->state == 4401) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1165] COND FALSE !(s->state == 4416) [L1168] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1168] COND FALSE !(s->state == 4417) [L1171] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1171] COND TRUE s->state == 4432 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={-3:0}] [L1378] COND FALSE !(ret <= 0) [L1383] s->state = 4448 [L1384] s->init_num = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={-3:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={-3:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={-3:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1159] COND FALSE !(s->state == 4400) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1162] COND FALSE !(s->state == 4401) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1165] COND FALSE !(s->state == 4416) [L1168] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1168] COND FALSE !(s->state == 4417) [L1171] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1171] COND FALSE !(s->state == 4432) [L1174] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1174] COND FALSE !(s->state == 4433) [L1177] EXPR s->state VAL [init=1, SSLv3_client_data={-3:0}] [L1177] COND TRUE s->state == 4448 [L1388] ret = __VERIFIER_nondet_int() [L1389] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={-3:0}] [L1644] __VERIFIER_error() VAL [init=1, SSLv3_client_data={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Result: UNSAFE, OverallTime: 23.3s, OverallIterations: 35, TraceHistogramMax: 7, AutomataDifference: 16.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7208 SDtfs, 2447 SDslu, 9311 SDs, 0 SdLazy, 5221 SolverSat, 199 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 68 SyntacticMatches, 21 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1026occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 34 MinimizatonAttempts, 2607 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 3271 NumberOfCodeBlocks, 3271 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3100 ConstructedInterpolants, 0 QuantifiedInterpolants, 675721 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 3328/3328 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 23:46:01,778 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:46:01,780 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:46:01,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:46:01,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:46:01,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:46:01,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:46:01,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:46:01,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:46:01,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:46:01,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:46:01,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:46:01,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:46:01,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:46:01,807 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:46:01,808 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:46:01,809 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:46:01,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:46:01,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:46:01,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:46:01,816 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:46:01,818 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:46:01,819 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:46:01,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:46:01,828 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:46:01,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:46:01,831 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:46:01,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:46:01,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:46:01,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:46:01,836 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:46:01,837 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:46:01,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:46:01,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:46:01,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:46:01,843 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:46:01,844 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:46:01,845 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:46:01,845 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:46:01,846 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:46:01,851 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:46:01,852 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 23:46:01,868 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:46:01,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:46:01,870 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:46:01,870 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:46:01,870 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:46:01,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:46:01,871 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:46:01,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:46:01,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:46:01,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:46:01,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:46:01,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:46:01,873 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 23:46:01,873 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 23:46:01,873 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:46:01,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:46:01,874 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:46:01,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:46:01,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:46:01,875 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:46:01,875 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:46:01,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:46:01,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:46:01,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:46:01,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:46:01,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:46:01,877 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 23:46:01,877 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 23:46:01,877 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:46:01,877 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 23:46:01,878 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_07deb365-bf9d-4acd-a471-73e4ae1f550b/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 -> 6b059dfef9f85366fcaeddec812cf96c32b1df0d [2019-11-15 23:46:01,915 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:46:01,932 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:46:01,936 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:46:01,937 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:46:01,938 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:46:01,939 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c [2019-11-15 23:46:02,000 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/bin/uautomizer/data/45bef5dfa/c4bce917d7c44318a07c92004b4ddbe9/FLAGa7a2a7200 [2019-11-15 23:46:02,596 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:46:02,597 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/sv-benchmarks/c/ssh/s3_clnt.blast.01.i.cil-2.c [2019-11-15 23:46:02,616 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/bin/uautomizer/data/45bef5dfa/c4bce917d7c44318a07c92004b4ddbe9/FLAGa7a2a7200 [2019-11-15 23:46:02,789 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/bin/uautomizer/data/45bef5dfa/c4bce917d7c44318a07c92004b4ddbe9 [2019-11-15 23:46:02,793 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:46:02,795 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:46:02,796 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:46:02,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:46:02,801 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:46:02,802 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:46:02" (1/1) ... [2019-11-15 23:46:02,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8368256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:02, skipping insertion in model container [2019-11-15 23:46:02,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:46:02" (1/1) ... [2019-11-15 23:46:02,816 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:46:02,909 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:46:03,588 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:46:03,618 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:46:03,769 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:46:03,809 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:46:03,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:03 WrapperNode [2019-11-15 23:46:03,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:46:03,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:46:03,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:46:03,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:46:03,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:03" (1/1) ... [2019-11-15 23:46:03,865 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:03" (1/1) ... [2019-11-15 23:46:03,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:46:03,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:46:03,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:46:03,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:46:03,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:03" (1/1) ... [2019-11-15 23:46:03,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:03" (1/1) ... [2019-11-15 23:46:03,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:03" (1/1) ... [2019-11-15 23:46:03,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:03" (1/1) ... [2019-11-15 23:46:04,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:03" (1/1) ... [2019-11-15 23:46:04,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:03" (1/1) ... [2019-11-15 23:46:04,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:03" (1/1) ... [2019-11-15 23:46:04,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:46:04,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:46:04,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:46:04,055 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:46:04,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/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 23:46:04,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:46:04,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:46:04,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 23:46:04,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:46:04,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:46:04,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:46:04,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:46:04,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 23:46:04,525 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:46:08,783 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-15 23:46:08,783 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-15 23:46:08,785 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:46:08,785 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:46:08,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:46:08 BoogieIcfgContainer [2019-11-15 23:46:08,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:46:08,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:46:08,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:46:08,793 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:46:08,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:46:02" (1/3) ... [2019-11-15 23:46:08,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75544336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:46:08, skipping insertion in model container [2019-11-15 23:46:08,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:46:03" (2/3) ... [2019-11-15 23:46:08,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75544336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:46:08, skipping insertion in model container [2019-11-15 23:46:08,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:46:08" (3/3) ... [2019-11-15 23:46:08,801 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.c [2019-11-15 23:46:08,813 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:46:08,825 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:46:08,838 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:46:08,875 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:46:08,875 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:46:08,876 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:46:08,876 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:46:08,876 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:46:08,876 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:46:08,876 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:46:08,876 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:46:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states. [2019-11-15 23:46:08,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:46:08,906 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:08,907 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 23:46:08,909 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:08,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:08,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2019-11-15 23:46:08,925 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:46:08,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1476488132] [2019-11-15 23:46:08,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/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 23:46:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:09,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:46:09,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:09,253 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 23:46:09,254 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:46:09,278 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 23:46:09,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1476488132] [2019-11-15 23:46:09,280 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:09,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 23:46:09,280 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698469611] [2019-11-15 23:46:09,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:46:09,289 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:46:09,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:46:09,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:09,310 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 4 states. [2019-11-15 23:46:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:09,494 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2019-11-15 23:46:09,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:46:09,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-15 23:46:09,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:09,526 INFO L225 Difference]: With dead ends: 375 [2019-11-15 23:46:09,526 INFO L226 Difference]: Without dead ends: 217 [2019-11-15 23:46:09,532 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 23:46:09,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-11-15 23:46:09,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2019-11-15 23:46:09,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-15 23:46:09,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 320 transitions. [2019-11-15 23:46:09,636 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 320 transitions. Word has length 24 [2019-11-15 23:46:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:09,637 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 320 transitions. [2019-11-15 23:46:09,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:46:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 320 transitions. [2019-11-15 23:46:09,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 23:46:09,642 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:09,643 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:09,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:46:09,856 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:09,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:09,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1495258694, now seen corresponding path program 1 times [2019-11-15 23:46:09,858 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:46:09,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2098714074] [2019-11-15 23:46:09,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/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 23:46:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:10,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:46:10,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:46:10,128 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:46:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:46:10,146 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2098714074] [2019-11-15 23:46:10,146 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:10,147 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 23:46:10,147 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633052956] [2019-11-15 23:46:10,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:46:10,150 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:46:10,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:46:10,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:10,151 INFO L87 Difference]: Start difference. First operand 217 states and 320 transitions. Second operand 4 states. [2019-11-15 23:46:12,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:12,186 INFO L93 Difference]: Finished difference Result 528 states and 787 transitions. [2019-11-15 23:46:12,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:46:12,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-11-15 23:46:12,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:12,192 INFO L225 Difference]: With dead ends: 528 [2019-11-15 23:46:12,192 INFO L226 Difference]: Without dead ends: 421 [2019-11-15 23:46:12,198 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 78 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 23:46:12,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-11-15 23:46:12,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2019-11-15 23:46:12,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-15 23:46:12,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 622 transitions. [2019-11-15 23:46:12,245 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 622 transitions. Word has length 41 [2019-11-15 23:46:12,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:12,246 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 622 transitions. [2019-11-15 23:46:12,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:46:12,246 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 622 transitions. [2019-11-15 23:46:12,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-15 23:46:12,253 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:12,253 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:12,457 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:46:12,458 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:12,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:12,458 INFO L82 PathProgramCache]: Analyzing trace with hash 924360661, now seen corresponding path program 1 times [2019-11-15 23:46:12,459 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:46:12,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1861197426] [2019-11-15 23:46:12,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/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 23:46:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:12,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:46:12,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:12,767 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:46:12,767 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:46:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:46:12,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1861197426] [2019-11-15 23:46:12,804 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:12,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 23:46:12,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022331505] [2019-11-15 23:46:12,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:46:12,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:46:12,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:46:12,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:46:12,809 INFO L87 Difference]: Start difference. First operand 421 states and 622 transitions. Second operand 4 states. [2019-11-15 23:46:13,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:13,587 INFO L93 Difference]: Finished difference Result 939 states and 1394 transitions. [2019-11-15 23:46:13,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:46:13,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-15 23:46:13,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:13,595 INFO L225 Difference]: With dead ends: 939 [2019-11-15 23:46:13,596 INFO L226 Difference]: Without dead ends: 628 [2019-11-15 23:46:13,598 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 156 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 23:46:13,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-11-15 23:46:13,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 628. [2019-11-15 23:46:13,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-11-15 23:46:13,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 927 transitions. [2019-11-15 23:46:13,648 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 927 transitions. Word has length 80 [2019-11-15 23:46:13,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:13,649 INFO L462 AbstractCegarLoop]: Abstraction has 628 states and 927 transitions. [2019-11-15 23:46:13,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:46:13,649 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 927 transitions. [2019-11-15 23:46:13,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 23:46:13,655 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:13,656 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, 1, 1] [2019-11-15 23:46:13,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:46:13,867 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:13,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:13,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1855651051, now seen corresponding path program 1 times [2019-11-15 23:46:13,869 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:46:13,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1085567137] [2019-11-15 23:46:13,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/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 23:46:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:15,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:46:15,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:15,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:46:15,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 23:46:15,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:46:15,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:15,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:46:15,650 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 23:46:15,705 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:15,705 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 23:46:15,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:46:15,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:15,709 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 23:46:15,709 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 23:46:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-15 23:46:15,751 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:46:15,795 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 20 treesize of output 18 [2019-11-15 23:46:15,803 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:46:15,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:15,804 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:46:15,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:15,805 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 23:46:15,806 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 23:46:15,825 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-15 23:46:15,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1085567137] [2019-11-15 23:46:15,826 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:15,826 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 23:46:15,826 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826354874] [2019-11-15 23:46:15,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:46:15,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:46:15,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:46:15,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:46:15,832 INFO L87 Difference]: Start difference. First operand 628 states and 927 transitions. Second operand 7 states. [2019-11-15 23:46:29,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:29,036 INFO L93 Difference]: Finished difference Result 2254 states and 3344 transitions. [2019-11-15 23:46:29,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:46:29,038 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-11-15 23:46:29,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:29,057 INFO L225 Difference]: With dead ends: 2254 [2019-11-15 23:46:29,057 INFO L226 Difference]: Without dead ends: 1633 [2019-11-15 23:46:29,059 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:46:29,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2019-11-15 23:46:29,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 784. [2019-11-15 23:46:29,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-15 23:46:29,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1203 transitions. [2019-11-15 23:46:29,124 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1203 transitions. Word has length 100 [2019-11-15 23:46:29,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:29,124 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1203 transitions. [2019-11-15 23:46:29,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:46:29,125 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1203 transitions. [2019-11-15 23:46:29,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-15 23:46:29,128 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:29,128 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, 1, 1, 1] [2019-11-15 23:46:29,338 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:46:29,339 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:29,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:29,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1695084872, now seen corresponding path program 1 times [2019-11-15 23:46:29,341 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:46:29,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [177025787] [2019-11-15 23:46:29,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/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 23:46:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:30,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:46:30,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:30,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:46:30,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 23:46:30,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:46:30,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:30,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:46:30,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 23:46:31,023 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:31,023 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 23:46:31,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:46:31,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:31,027 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 23:46:31,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 23:46:31,071 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-15 23:46:31,071 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:46:31,115 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 20 treesize of output 18 [2019-11-15 23:46:31,118 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:46:31,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:31,120 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:46:31,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:31,122 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 23:46:31,122 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 23:46:31,138 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-15 23:46:31,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [177025787] [2019-11-15 23:46:31,139 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:31,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 23:46:31,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17345548] [2019-11-15 23:46:31,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:46:31,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:46:31,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:46:31,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:46:31,142 INFO L87 Difference]: Start difference. First operand 784 states and 1203 transitions. Second operand 7 states. [2019-11-15 23:46:45,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:45,333 INFO L93 Difference]: Finished difference Result 2546 states and 3867 transitions. [2019-11-15 23:46:45,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:46:45,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 101 [2019-11-15 23:46:45,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:45,357 INFO L225 Difference]: With dead ends: 2546 [2019-11-15 23:46:45,357 INFO L226 Difference]: Without dead ends: 1769 [2019-11-15 23:46:45,360 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:46:45,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2019-11-15 23:46:45,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 946. [2019-11-15 23:46:45,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2019-11-15 23:46:45,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1491 transitions. [2019-11-15 23:46:45,476 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1491 transitions. Word has length 101 [2019-11-15 23:46:45,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:45,478 INFO L462 AbstractCegarLoop]: Abstraction has 946 states and 1491 transitions. [2019-11-15 23:46:45,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:46:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1491 transitions. [2019-11-15 23:46:45,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-15 23:46:45,483 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:45,484 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:45,694 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:46:45,695 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:45,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:45,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1703481135, now seen corresponding path program 1 times [2019-11-15 23:46:45,696 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:46:45,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [513070456] [2019-11-15 23:46:45,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/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 23:46:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:47,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:46:47,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:47,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:46:47,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:46:47,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:46:47,750 INFO L341 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2019-11-15 23:46:47,750 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 23:46:47,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:46:47,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:47,775 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 23:46:47,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:22 [2019-11-15 23:46:47,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:46:47,826 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:47,827 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 23:46:47,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:46:47,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:47,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:46:47,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:15 [2019-11-15 23:46:47,850 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 23:46:47,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:46:47,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:47,854 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 23:46:47,854 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:5 [2019-11-15 23:46:47,878 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-15 23:46:47,878 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:46:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-15 23:46:47,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [513070456] [2019-11-15 23:46:47,944 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:47,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 23:46:47,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75433649] [2019-11-15 23:46:47,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:46:47,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:46:47,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:46:47,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:46:47,946 INFO L87 Difference]: Start difference. First operand 946 states and 1491 transitions. Second operand 6 states. [2019-11-15 23:46:55,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:46:55,317 INFO L93 Difference]: Finished difference Result 2358 states and 3652 transitions. [2019-11-15 23:46:55,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:46:55,318 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-11-15 23:46:55,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:46:55,329 INFO L225 Difference]: With dead ends: 2358 [2019-11-15 23:46:55,330 INFO L226 Difference]: Without dead ends: 1573 [2019-11-15 23:46:55,331 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 237 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 23:46:55,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2019-11-15 23:46:55,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1042. [2019-11-15 23:46:55,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1042 states. [2019-11-15 23:46:55,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1641 transitions. [2019-11-15 23:46:55,389 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1641 transitions. Word has length 122 [2019-11-15 23:46:55,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:46:55,389 INFO L462 AbstractCegarLoop]: Abstraction has 1042 states and 1641 transitions. [2019-11-15 23:46:55,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:46:55,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1641 transitions. [2019-11-15 23:46:55,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-15 23:46:55,393 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:46:55,393 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:46:55,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:46:55,612 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:46:55,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:46:55,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1558577382, now seen corresponding path program 1 times [2019-11-15 23:46:55,613 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:46:55,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [969765022] [2019-11-15 23:46:55,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:46:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:46:57,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:46:57,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:46:57,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:46:57,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:46:57,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:46:57,669 INFO L341 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2019-11-15 23:46:57,670 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 23:46:57,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:46:57,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:57,689 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 23:46:57,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:22 [2019-11-15 23:46:57,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:46:57,718 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:57,718 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 23:46:57,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:46:57,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:57,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:46:57,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:13 [2019-11-15 23:46:57,743 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 23:46:57,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:46:57,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:46:57,746 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 23:46:57,747 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:5 [2019-11-15 23:46:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-15 23:46:57,778 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:46:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-15 23:46:57,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [969765022] [2019-11-15 23:46:57,854 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:46:57,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 23:46:57,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128220839] [2019-11-15 23:46:57,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:46:57,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:46:57,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:46:57,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:46:57,856 INFO L87 Difference]: Start difference. First operand 1042 states and 1641 transitions. Second operand 6 states. [2019-11-15 23:47:03,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:03,052 INFO L93 Difference]: Finished difference Result 2418 states and 3741 transitions. [2019-11-15 23:47:03,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:47:03,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-11-15 23:47:03,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:03,064 INFO L225 Difference]: With dead ends: 2418 [2019-11-15 23:47:03,064 INFO L226 Difference]: Without dead ends: 1553 [2019-11-15 23:47:03,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 238 SyntacticMatches, 2 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 23:47:03,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2019-11-15 23:47:03,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1048. [2019-11-15 23:47:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-11-15 23:47:03,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1641 transitions. [2019-11-15 23:47:03,136 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1641 transitions. Word has length 123 [2019-11-15 23:47:03,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:03,137 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 1641 transitions. [2019-11-15 23:47:03,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:47:03,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1641 transitions. [2019-11-15 23:47:03,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-15 23:47:03,141 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:03,141 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1] [2019-11-15 23:47:03,349 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:47:03,350 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:03,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:03,350 INFO L82 PathProgramCache]: Analyzing trace with hash 498183356, now seen corresponding path program 1 times [2019-11-15 23:47:03,351 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:47:03,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1016782307] [2019-11-15 23:47:03,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:47:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:47:05,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:47:05,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:47:05,480 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 23:47:05,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:05,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:05,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:47:05,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-15 23:47:05,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:47:05,519 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 23:47:05,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:05,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:05,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:47:05,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 23:47:05,559 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:05,560 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 23:47:05,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:47:05,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:47:05,562 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 23:47:05,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 23:47:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-15 23:47:05,599 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:47:05,685 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-15 23:47:05,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1016782307] [2019-11-15 23:47:05,685 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:47:05,686 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 8 [2019-11-15 23:47:05,686 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503848448] [2019-11-15 23:47:05,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:47:05,687 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:47:05,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:47:05,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:47:05,687 INFO L87 Difference]: Start difference. First operand 1048 states and 1641 transitions. Second operand 8 states. [2019-11-15 23:47:15,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:47:15,863 INFO L93 Difference]: Finished difference Result 3042 states and 4656 transitions. [2019-11-15 23:47:15,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:47:15,866 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 137 [2019-11-15 23:47:15,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:47:15,879 INFO L225 Difference]: With dead ends: 3042 [2019-11-15 23:47:15,879 INFO L226 Difference]: Without dead ends: 2001 [2019-11-15 23:47:15,882 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 266 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 23:47:15,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2019-11-15 23:47:15,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1153. [2019-11-15 23:47:15,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2019-11-15 23:47:15,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1799 transitions. [2019-11-15 23:47:15,948 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1799 transitions. Word has length 137 [2019-11-15 23:47:15,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:47:15,949 INFO L462 AbstractCegarLoop]: Abstraction has 1153 states and 1799 transitions. [2019-11-15 23:47:15,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:47:15,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1799 transitions. [2019-11-15 23:47:15,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-15 23:47:15,953 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:47:15,954 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1] [2019-11-15 23:47:16,166 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:47:16,167 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:47:16,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:47:16,167 INFO L82 PathProgramCache]: Analyzing trace with hash -272550210, now seen corresponding path program 1 times [2019-11-15 23:47:16,168 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:47:16,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [514001082] [2019-11-15 23:47:16,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:47:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:47:22,657 INFO L168 tionRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-15 23:47:22,658 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:47:22,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:47:23,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:47:23 BoogieIcfgContainer [2019-11-15 23:47:23,045 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:47:23,046 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:47:23,046 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:47:23,046 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:47:23,047 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:46:08" (3/4) ... [2019-11-15 23:47:23,050 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:47:23,225 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_07deb365-bf9d-4acd-a471-73e4ae1f550b/bin/uautomizer/witness.graphml [2019-11-15 23:47:23,225 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:47:23,227 INFO L168 Benchmark]: Toolchain (without parser) took 80432.74 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 300.4 MB). Free memory was 945.6 MB in the beginning and 961.4 MB in the end (delta: -15.8 MB). Peak memory consumption was 284.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:47:23,227 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:47:23,228 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1013.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:47:23,228 INFO L168 Benchmark]: Boogie Procedure Inliner took 126.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:47:23,229 INFO L168 Benchmark]: Boogie Preprocessor took 116.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:47:23,229 INFO L168 Benchmark]: RCFGBuilder took 4733.39 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: 85.4 MB). Peak memory consumption was 85.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:47:23,230 INFO L168 Benchmark]: TraceAbstraction took 74256.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 166.2 MB). Free memory was 1.0 GB in the beginning and 979.2 MB in the end (delta: 28.6 MB). Peak memory consumption was 194.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:47:23,230 INFO L168 Benchmark]: Witness Printer took 179.82 ms. Allocated memory is still 1.3 GB. Free memory was 979.2 MB in the beginning and 961.4 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:47:23,236 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1013.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -160.9 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 126.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 116.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4733.39 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: 85.4 MB). Peak memory consumption was 85.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 74256.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 166.2 MB). Free memory was 1.0 GB in the beginning and 979.2 MB in the end (delta: 28.6 MB). Peak memory consumption was 194.8 MB. Max. memory is 11.5 GB. * Witness Printer took 179.82 ms. Allocated memory is still 1.3 GB. Free memory was 979.2 MB in the beginning and 961.4 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1644]: 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={536718084: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 = (BUF_MEM *)__VERIFIER_nondet_ulong(); [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 ; [L1092] int tmp___4 ; [L1093] int tmp___5 ; [L1094] int tmp___6 ; [L1095] int tmp___7 ; [L1096] int tmp___8 ; [L1097] long tmp___9 ; [L1099] int blastFlag ; [L1102] blastFlag = 0 [L1103] s->hit=__VERIFIER_nondet_int () [L1104] s->state = 12292 [L1105] tmp = __VERIFIER_nondet_int() [L1106] cb = (void (*)())((void *)0) [L1107] ret = -1 [L1108] skip = 0 [L1109] EXPR s->info_callback VAL [init=1, SSLv3_client_data={536718084:0}] [L1109] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1110] EXPR s->info_callback [L1110] cb = s->info_callback [L1118] EXPR s->in_handshake [L1118] s->in_handshake += 1 [L1119] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_client_data={536718084:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={536718084:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1132] COND TRUE s->state == 12292 [L1235] s->new_session = 1 [L1236] s->state = 4096 [L1237] EXPR s->ctx [L1237] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1237] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1242] s->server = 0 VAL [init=1, SSLv3_client_data={536718084:0}] [L1243] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [init=1, SSLv3_client_data={536718084:0}] [L1248] EXPR s->version VAL [init=1, SSLv3_client_data={536718084:0}] [L1248] COND FALSE !((s->version & 65280) != 768) [L1254] s->type = 4096 [L1255] EXPR s->init_buf VAL [init=1, SSLv3_client_data={536718084:0}] [L1255] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1267] tmp___4 = __VERIFIER_nondet_int() [L1268] COND FALSE !(! tmp___4) [L1274] tmp___5 = __VERIFIER_nondet_int() [L1275] COND FALSE !(! tmp___5) [L1281] s->state = 4368 [L1282] EXPR s->ctx [L1282] EXPR (s->ctx)->stats.sess_connect [L1282] (s->ctx)->stats.sess_connect += 1 [L1283] s->init_num = 0 VAL [init=1, SSLv3_client_data={536718084:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={536718084:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={536718084:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={536718084:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1147] COND TRUE s->state == 4368 [L1287] s->shutdown = 0 [L1288] ret = __VERIFIER_nondet_int() [L1289] COND TRUE blastFlag == 0 [L1290] blastFlag = 1 VAL [init=1, SSLv3_client_data={536718084:0}] [L1294] COND FALSE !(ret <= 0) [L1299] s->state = 4384 [L1300] s->init_num = 0 [L1301] EXPR s->bbio [L1301] EXPR s->wbio VAL [init=1, SSLv3_client_data={536718084:0}] [L1301] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={536718084:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={536718084:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={536718084:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1153] COND TRUE s->state == 4384 [L1309] ret = __VERIFIER_nondet_int() [L1310] COND TRUE blastFlag == 1 [L1311] blastFlag = 2 VAL [init=1, SSLv3_client_data={536718084:0}] [L1315] COND FALSE !(ret <= 0) [L1320] s->hit VAL [init=1, SSLv3_client_data={536718084:0}] [L1320] COND FALSE !(s->hit) [L1323] s->state = 4400 VAL [init=1, SSLv3_client_data={536718084:0}] [L1325] s->init_num = 0 VAL [init=1, SSLv3_client_data={536718084:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={536718084:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={536718084:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={536718084:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1159] COND TRUE s->state == 4400 [L1329] EXPR s->s3 [L1329] EXPR (s->s3)->tmp.new_cipher [L1329] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [init=1, SSLv3_client_data={536718084:0}] [L1329] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1332] ret = __VERIFIER_nondet_int() [L1333] COND TRUE blastFlag == 2 [L1334] blastFlag = 3 VAL [init=1, SSLv3_client_data={536718084:0}] [L1338] COND FALSE !(ret <= 0) VAL [init=1, SSLv3_client_data={536718084:0}] [L1344] s->state = 4416 [L1345] s->init_num = 0 VAL [init=1, SSLv3_client_data={536718084:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={536718084:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={536718084:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={536718084:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1159] COND FALSE !(s->state == 4400) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1162] COND FALSE !(s->state == 4401) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1165] COND TRUE s->state == 4416 [L1349] ret = __VERIFIER_nondet_int() [L1350] COND TRUE blastFlag == 3 [L1351] blastFlag = 4 VAL [init=1, SSLv3_client_data={536718084:0}] [L1355] COND FALSE !(ret <= 0) [L1360] s->state = 4432 [L1361] s->init_num = 0 [L1362] tmp___6 = __VERIFIER_nondet_int() [L1363] COND FALSE !(! tmp___6) VAL [init=1, SSLv3_client_data={536718084:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={536718084:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={536718084:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={536718084:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1159] COND FALSE !(s->state == 4400) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1162] COND FALSE !(s->state == 4401) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1165] COND FALSE !(s->state == 4416) [L1168] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1168] COND FALSE !(s->state == 4417) [L1171] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1171] COND TRUE s->state == 4432 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND FALSE !(blastFlag == 5) VAL [init=1, SSLv3_client_data={536718084:0}] [L1378] COND FALSE !(ret <= 0) [L1383] s->state = 4448 [L1384] s->init_num = 0 VAL [init=1, SSLv3_client_data={536718084:0}] [L1603] EXPR s->s3 [L1603] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_client_data={536718084:0}] [L1603] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1632] skip = 0 VAL [init=1, SSLv3_client_data={536718084:0}] [L1129] COND TRUE 1 VAL [init=1, SSLv3_client_data={536718084:0}] [L1131] EXPR s->state [L1131] state = s->state [L1132] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1132] COND FALSE !(s->state == 12292) [L1135] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1135] COND FALSE !(s->state == 16384) [L1138] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1138] COND FALSE !(s->state == 4096) [L1141] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1141] COND FALSE !(s->state == 20480) [L1144] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1144] COND FALSE !(s->state == 4099) [L1147] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1147] COND FALSE !(s->state == 4368) [L1150] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1150] COND FALSE !(s->state == 4369) [L1153] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1153] COND FALSE !(s->state == 4384) [L1156] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1156] COND FALSE !(s->state == 4385) [L1159] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1159] COND FALSE !(s->state == 4400) [L1162] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1162] COND FALSE !(s->state == 4401) [L1165] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1165] COND FALSE !(s->state == 4416) [L1168] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1168] COND FALSE !(s->state == 4417) [L1171] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1171] COND FALSE !(s->state == 4432) [L1174] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1174] COND FALSE !(s->state == 4433) [L1177] EXPR s->state VAL [init=1, SSLv3_client_data={536718084:0}] [L1177] COND TRUE s->state == 4448 [L1388] ret = __VERIFIER_nondet_int() [L1389] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_client_data={536718084:0}] [L1644] __VERIFIER_error() VAL [init=1, SSLv3_client_data={536718084:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 131 locations, 1 error locations. Result: UNSAFE, OverallTime: 74.1s, OverallIterations: 9, TraceHistogramMax: 7, AutomataDifference: 53.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1501 SDtfs, 2712 SDslu, 3017 SDs, 0 SdLazy, 2649 SolverSat, 395 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 49.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1456 GetRequests, 1409 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1153occurred in iteration=8, 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, 8 MinimizatonAttempts, 3556 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 11.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 865 NumberOfCodeBlocks, 865 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1440 ConstructedInterpolants, 0 QuantifiedInterpolants, 460745 SizeOfPredicates, 38 NumberOfNonLiveVariables, 1908 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 1838/1838 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...